rembocoder's blog

Codeforces Round #861 (Div. 2) – O(log N) solution for E + full video editorial
By rembocoder, history, 13 months ago, In English

Hello, I've made a full video editorial for the latest CF round. I'm a bit late, but I can compensate that by having a super-solution for problem E, which is faster than the authors' and also easier in my opinion.

https://www.youtube.com/watch?v=i1i_7lqnGwA

Thanks to all the authors for a cool contest!

  • Vote: I like it
  • +26
  • Vote: I do not like it

»
13 months ago, # |
  Vote: I like it +5 Vote: I do not like it

Awesome work. But I request you not to spoil the problem or give hints to the problem in your blog titles. Your previous blogs also had titles like "greedy", "process dp" along with exact problem names etc that spoiled the problem. Some of us cant write the contest on time, and its kinda a bummer when the problem gets spoiled this way.

Great work again!

→ Reply
»
13 months ago, # |
  Vote: I like it +24 Vote: I do not like it

> super-solution for problem E, which is faster than the authors'

Our main author solution on Polygon is exactly this O(log) solution with formula.

→ Reply