Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) — Screencast & Editorial of Problems A–D, F

Revision en1, by orz, 2026-03-29 19:27:02

link

Personally I felt like my participation in Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) was acceptable, but this perception contrasted sharply with my objective standing in the standings. Either I'm that rusty after six months of idleness, or probably my rank might have been affected by some mass effects. What could they be, that is the question!

Overall, the problems were really nice. I felt like 2211F - Learning Binary Search was easier than 2211D - AND-array, and also in last half an hour, unfortunately, I chose to aim for 2211G - Rational Bubble Sort instead of 2211E - Minimum Path Cover (to try and win duels against isaf27 and turmax), but I lost the race and the duels. A subsequent investigation showed that I had excellent chances of solving problem 2211E - Minimum Path Cover, if only I’d given it a try. Maybe such strategic mistakes (along with lack of consistent training) are what's keeping me from nutelling.

Tags nebius, codeforces, round, screencast, editorial

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English orz 2026-03-29 19:27:02 1102 Initial revision (published)