All of you who solved 2256C - Hot Potatoes at the Fairy Warehouse know very well that this is a simple ad-hoc problem. It is not an implementation heavy problem at all. Almost idea behind all the solutions are exactly the same. Also, My submission is quite different than this one. My coding style like parity checking using And operator, templates are not the same as the other person. It's like, in a contest, you are asked to print "Hello World". Then, system will detect that all the users have same code and all of your codes of that contest will be marked "Skipped".

MikeMirzayanov, I want to confirm you that I never cheated in any CF contest and I request you to review my case, restore my submissions, remove the "Skipped" verdicts and keep my account active.

In last Div-2 contest, my this code 377729532 got accepted where this submission 377724457 recieved TLE verdict. Logic of both code are exactly the same. But, in the TLE version, I used bitset and used string instead in the AC submission. But, note that I initialized bitset array in global scope. So, in the TLE version, my code should do at max $$$3N + 2\sum n + T(7 \cdot \frac{N}{w} + 9 \cdot 31)$$$ operations. Here, $$$T \le 10^4, N = 10^5 + 1, w$$$ is word size i.e $$$64$$$. So, it shouldn't take more than $$$1.3$$$ s at all. But, then, why am I getting TLE? Can anyone explain, please?

For the last few days, I’ve been facing extremely long judging times on Codeforces. Many submissions are taking 20–30 minutes to get a verdict, even for simple problems.

This becomes a big issue during contests — sometimes I need to wait around 15 minutes just to see if my solution is correct. It’s stressful and affects the contest experience.

I really love solving problems on Codeforces, so I wanted to share my thoughts. If possible, please look into the current judging queue issues.

Today I solved this problem 1791F - Range Update Point Query. My first submission:345869729 & second submission:345873398 .

As you can see, those two codes are exactly the same. The only difference is: In first submission, I wrote auto it=lower_bound(all(s),l) & in 2nd submission, I wrote auto it=s.lower_bound(l), where s is a std::set . But, as far I know, both of these functions are of logarithmic time complexity. Then, why did I get TLE in my first submission? Please, explain.