Heya there, I just want to ask a couple of things to anyone reading this blog regarding contests strategy (mainly revolving around normal CF round).
So, most Codeforces round are hold in a very interesting way of scoring, where each problem is initially given a fixed score from the score distribution, and as time goes by, each problem's score will drop until it reaches the minimum (e.g. if the score for a problem is $$$500$$$, then at some point it will not decrease below $$$250$$$ or something, correct me if i'm wrong pls .w.). Now, here are the questions for you guys, as i'm little bit a fan for data and statistics :p.
- What is your strategy for these type of Codeforces contests? Is it the classic strategy (from first to last), modified rainboy strategy (choose the hardest problem you think you can solve (e.g. problem E maybe), then solve from that problem to first, before returning back to classic strategy), or other strategy you crafted yourself?
- Does your strategy involves skipping problems? If so, how does it work? If not, have you ever skipped a problem in CF contest before?
For just practicing it doesn't really matter, and solving easier problems may waste your time (though it's good to be fluent in coding simple solutions). For maximizing score I'd recommend a simple variant of the classic strategy:
I go from first to as many I can solve, if 2 problems have equal scores, I try to read both. I often look at the solve count for problems to get an idea of their difficulty during the contest.
I skip(at least try to) problems when I notice a more "difficult" problem(e.g. D instead of C) that I know how to do in order to try and maximize the points I can get(only if I can't figure out the preceding problems).
mostly from first to last, but if I stuck at the problem for too long or the problem(or statement) seems too complicated, I'll skip it.
this