Hello CodeForces, I am curious about how people tackle such problems but cant find resources (at least with a very brief google search). I would appreciate it if someone provided me with some.

La Paz is clearly no place to host IOI. (It has already been talked about but I wanted to reignite the discussion.) https://mirror.codeforces.com/blog/entry/128667 by E869120 explains the issue thoroughly.

This is the first time I see pdf editorials for a round that is not for ICPC or similar contest. I love the format and just wanted to support the setters by writing this blog.

Hello CodeForces, today I was solving the problem 1985H2 - Maximize the Largest Component (Hard Version) and implemented it with C++. It passes all the tests seperately but throws RE when I try to run multiple tests. I have been debugging for around half an hour but can't find the problem. I would appreciate any help. Here is my submission:268092158

PS: Local compiler also throws RE.

The submission is here: 265738238

I do not think that I use significant stack memory here, it is mostly heap memory. Also I have cloned to the mashup to test with 2GB memory limits and got exactly the same result.

The code is pretty clear in my opinion but I will be happy to clarify if asked.

Thanks for your interest.

The only difference between the two submissions is using a lambda function vs a global function. Lambda functions made the runtime around 7 times slower.

What do you think this is because?

AC: 255501228

TLE: 255500672

so should we always prefer global functions over lambdas then?

Hello CodeForces, today I tried solving the problem from a recent contest: 1923E - Count Paths

My Solution:

If you see any problems with the code, please let me know as I can't see the problem. If you don't understand a part of the code, please ask and I will clarify.

Submission: 255437477

UPD: The runtime takes more than 30 seconds! So I guess the runtime is O(N^2) somehow.