Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

stefdasca's blog

Codeforces Round #631 — Video Editorials(Div2 BCD)
By stefdasca, history, 7 years ago, In English

Hello!

Since the editorials are still not out, I prepared video editorials for div2 B, C and D.

B

C

D

Check the videos and if you liked them, subscribe to the channel for more CP content

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

»
7 years ago, hide # |
← Rev. 2  
Vote: I like it +16 Vote: I do not like it

This is much better than usual Editorials
Please keep doing this.

→ Reply
»
7 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Where is the channel link or tell me the channel name

→ Reply
»
7 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Can anyone explain why O(n^2) would not work for div 2 B?

→ Reply
  • »
    »
    7 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Look at the constraints of n it will go (200000)^2 =>4 x 10^10 cf compiler can execute only approx. 10^8 operations per second so it will give TLE.

    → Reply
»
7 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Thanks for these video editorials

→ Reply