Shayan's blog

Codeforces Round 956 Video Editorial
By Shayan, history, 22 months ago, In English

1983A — Array Divisibility

1983B — Corner Twist

1983C — Have Your Cake and Eat It Too

1983D — Swap Dilemma

1983E — I Love Balls

1983F — array-value

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

Comments Comments (12)
| Write comment?
»
22 months ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

Why are the video editorials (made by Shayan, who to my knowledge had no relationship with the problemsetting of today's round) being downvoted? Anyway, thank you Shayan for these video editorials. Always appreciate them.

→ Reply
»
22 months ago, hide # |
← Rev. 2  
Vote: I like it +17 Vote: I do not like it

All those downvotes are coming from the people who craved these good solutions during the contest.

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

Great explanation for problem E, very easy to understand. I think that if the problem statement was clearer with saying that the special balls were on the first k positions there would be more ACs.

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

thanks

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

Hi Shayan,

For problem F, you said that, while counting the subarrays having xor value less than k, there will be a index j for index each index i, such that all the subarray's xor values will be less than or equal to k. can you prove this ?

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

How about moving these wonderful video into China. They really benefits a lot!

→ Reply