Скачать или смотреть Codeforces Round 1054 (Div 3) Overall Rank 1 Win

So nice to get the third win in a row -- unfortunately there are two mediocre (w.r.t my rating) div1 performances in between.

About this contest:
Problem A,B,C was very smooth. In fact, I am surprised I could maintain the high speed on problem C as it was slightly complicated.

Problem D, I did not correctly read the problem statement on first try, costing maybe 2 minutes (=8 penalty).

Problem E is a very technical two pointers implementations (twice), technically could be prevented by a heavy log^2 range count disjoint methods but it might not fit. It was relatively lucky to not get it wrong too many times.

Problem F: The edgecase of h = 1 is annoying. Initially I thought game over when h less than 0, which makes h=1 not an edgecases. I quickly recovered the h=1 and remembered to add the edge case back.

Problem G: stadnard segment tree problem. The only issue is I was afraid it would be too slow to pass, and the forgetting the output format requires sorted costs me 12 minutes total penalty.