Shayan's blog

Codeforces Round 959 by NEAR — Video Tutorial
By Shayan, 2 years ago, In English

1994A — Diverse Game

1994B — Fun Game

1994C — Hungry Games

1994D — Funny Game

1994E — Wooden Game

1994F — Stardew Valley

1994G — Minecraft

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

Comments Comments (8)
| Write comment?
»
2 years ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

Was literally waiting for this!

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

waiting...

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

@shayan please sir can you explain this : PROBLEM D: we are using f[] array to make the node dead and lets say we get node z and node y' for operation x then we make node y' as dead .How are we ensuring that down the line for any other x ,node y' will be not be critical node(only node forming pair with some other node divisible by operation number )??? or in simple words please prove choosing any node among two would be fine .

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

    So if you look closely, actually the Pegion-hole principle ensures that. At every step down the line, let's say we have (x) alive nodes and at that point we will be requiring (x-1) edges. So there will surely be a pair that will be having the same modulo value (as per Pegion-hole principle). Hence it does not matter which edge we had removed previously as we are sure to find a pair at every step!

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

waited for this , thanks brother.

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

Chinese video editorial by me

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

there is no video for C

→ Reply