You are righr, but Genshin is a great game.

Hi, cheaters will be detected some time after the round. Please give us some time.

But, can you please not use an alt to send such offensive comments? I don't believe an unrated account should care about these.

I can confirm it's on 25th in the very beginning.

Codeforces >>> Leetcode.

It can be the difference between UNIX and CRLF.

As a coordinator, THUPC is a good contest!

Unfortunately, we have very strong evidence showing that he was cheating yesterday. :(

I'm always your fan Mr Z!!

Oh no, I always use MOD in my code...

oops it's my carelessness!

Ok this is reasonable

What's more, you finished this code is 56 seconds 352190212. Wow, that's really impressive!

Could you please teach me how to write this code in 9 minutes? 352201903

Note: your submission to D is at 00:19, while your first submission to F, as I linked above, is at 00:25.

You really made me laugh.

It is not any form of official solution. We don't guarantee the user-created editorials. Please wait for our official editorial, and do not trust such gpt-based things

I totally agree. Why are you posting such editorials like 1 min after contest? Shayan

Sorry to hear that. You can try uphacks anyway :)

I did it.

Auto comment: topic has been updated by Error_Yuan (previous revision, new revision, compare).

Both last goodbye round and this round told us a lesson: always write the purest brute force solution.

In this round, I think the preparation of problem is not up to the standards because, as you said, you used the conclusion of $$$a_i \gt a_j \gt a_k$$$, which at least used some observations and is not the purest brute force. However, the purest brute force which works in $$$O(n!\cdot n^2)$$$ can run under $$$n\le 6$$$, thus will avoid the issue.

You forgot to read the number of test cases...

The interactor did respond you with $$$0$$$. I guess you misread the output. 2 1 7863 means: you answered $$$2$$$, used $$$1$$$ query, and total length is $$$7863$$$.

The definition of the subproblem was wrong. It is corrected now ("cross" -> "touch"). Sorry for the inconvenience.

We are sorry about that...

It's very discouraging to see your rude words.

First of all, you didn't even solve a single problem from the contest — how can you just call it "trash"? Do you know anything about the problem qualities? Authors, coordinators, and testers put endless efforts to make this round possible, but you are just staring at standings and send offensive comments. Aren't you too rude?

Actually I found most problems enjoyable and interesting. The only issue is C being too easy — that's very hard to estimate difficulty for easy problems, so it is understandable for me. All the rest problems have nice difficulties. What are you complaining about?

skill issue

The user is disabled now.

Hello, Mr -220.

Sorry, after I clicked the "add hacks" button, I forgot to build packages and started system testing. And after seeing your comment, I randomly opened a submission and saw there were 10 tests. (Yes, the package was built after system testing and idk why...). I apologize for my mistake.

Hacks were added to the main tests before system testing. This problem has ~10 tests now.

Now we found some really obvious solutions to this problem (like graph matching), but none of them are found during testing. Even worse, the only tester who solved this problem used the same algorithm as MCS.

We apologize for this bad-setting problem — it shouldn't have occurred in the round. We are very very sorry for the bad experience.

Yes. It is about $$$\exp(n/2)$$$. Now we realize that we should change this problem into counting...

I'd like to remind you that skip!=cheat.

What do you want to express?

Nice problems, recommend to participate

what do you want to express?

I'm always your fans Mr W

Currently, in Polygon's rules, it is required to use "permutation of length $$$n$$$" and footnotes to define permutations. So basically it is a rule to do so, and we are not really able to change.

It doesn't matter. You just need to know that an optimal strategy always use $$$k/2$$$ l-s and $$$k/2$$$ r-s. Thus, if we encounter the global optimal middle point, it does not matter which we choose if $$$l=r$$$ — the answer will keep the same.

Well, if you see the tutorial, you will see that there exists a much easier for F2 than just going for DS bash. I hope you will like the linear solution.

Thanks!

That is basically because this round have 35k registration.

Nice contest!

I tried hard hacking this kind of solution during testing, but never succeeded.

Partly because the authors decided to not accept Chinese testers.

First, it is well known; Secondly, it is not hard to observe that $$$(a+b)=(a\oplus b)\Leftrightarrow a\operatorname{\&}b = 0$$$. You just need to look at the binary representation.

As a coordinator, I was playing Genshin with the author!

As a tester, I can confirm that this round is somehow ralated to squid games!

As a tester, this contest was a div2-only round when I tested it.

As a tester, ... are you really a tester?

I'm concerned about whether System and Una_shem will be rejected...

upd: It works! Thank you all :3

I suppose you haven't ever participated in tracker rounds?

Bruh, it's just your personal taste

Bruh, o3 will beat me for sure...

Hmm, I think this is not the leak of MCS output. The authors intentionally changed the output at the last minute before the contest.

How can such comment get upvotes?

I think you can build without verification.

Unfortunately, this is still too short. My Div1 proposal (Round 985) got the coordinator 8 months after I published it.

Let's mention our dear child irr74.

Edit: It seems that irris.cpp, irris-32bit.cpp, LMydd0225_hash.cpp (3 solutions on Polygon marked as correct) are all wrong.

Edit 2: After checking all in-contest submissions, there are three solutions hacked:

• 298891497 by strapple;
• 298886859 by Xylenox;
• 298875300 by Ormlis.

Unfortunately, pretest 1 was wrong.

As a parent, I can confirm that _istil is cute!

2029I - Variance Challenge — I think this is the ever best problem of mine!

You reached GM, this is insane!

Nice explanation Orz. Thanks for sharing the amazing solution!

Well, what's wrong with C2? imo it is indeed a nice problem (maybe nicer without C1). But currently it got 165 downvotes.

As a tester, I can confirm that I tested this round.

$$$dp_S$$$ means that the probability that there exists some certain time, such that exactly the points in $$$S$$$ have the message.

As a tester: Genshin, Activate!

Note that:

• Now $$$curg = g_i$$$, and we want to calculate $$$g_{i-1}$$$ based on it.

Then we see that if $$$curg=a_i$$$, when the rating is $$$curg-1$$$, it will increase by $$$1$$$ after the $$$i$$$-th contest, because $$$curg-1 \lt a_i$$$. Thus, $$$g_{i-1}=curg-1$$$ instead of $$$curg$$$.

Emphasis. :)

Edit: Well, why is this comment getting downvoted?

I'm sorry to hear that... We didn't know the existence of this problem before :(

preL and preR are just the prefix sum array of cntL and cntR.

Our testers' solution (which is $$$\mathcal{O}(n^2\cdot 2^n)$$$) runs for ~10s. :(

In fact, it is the badge of sszcdjr)

Congrats!

No.

No.

As an author, I can confirm that no problems are authored by AI!

It will be a rated Div.1+2 contest. You shouldn't use use AI anyways.

For problem E, I just submitted a brute force and it passed within 10ms...

You will be banned by Mike.

This is one of the intended solutions. My solution requires some case work and it is deterministic.

Disclaimer: The contest is SCP-S, but not CSP-S.

As a tester, I tested after the announcement was post :pensive:

How many contests did you participate? Is pupil your actual rating level?

Are you supposing that the owners of your alts are not you? The one to be punished is you instead of your account, although the sudden ban without any warning is somehow annoying and unreasonable.

As a tester, I

MagicalFlower will lose IOI 2024!

Currently, it is a rule of CF that you must use multi-tests unless it affects the time complexity.

Then where is my boyfriend /ll

Curious: if this not even an argument, what do want to express when writing comments under announcements?

When people view negative comments, they may simply choose not to participate.

You are invited to test a round, then it means you are trusted. You can talk in the discord server, with coordinator and authors, about yout unsatisfactory with the problems. I don't see any reason to post such negative comments of the round before it ends. If you still have the same idea, it would be better for you to stop testing rounds. :)

What do you want to express by posting this? Have you ever read the testers' guidelines?

In all, being 74 rounds means higher chance of being sponsored but higher chance of low quality.

Better quality of problems — higher chance of Global

That is really laughing.

74TrAkToR never let me down :))))

As a tester, I wasn't removed from the standings during testing.

This time you are right!!!

You can register at any time.

Fun fact 2: being an LGM on Codeforces doesn't mean one can got silver or above medals in APIO for sure.

Unfortunately, according to the coordinators from MXOJ, we are not allowed to publish English statements during the contest.

We will post the English statement here after contest.

Link: Google Drive.