Please read the new rule regarding the restriction on the use of AI tools. ×

Shayan's blog

Codeforces Round 978 (Div. 2) — Video Tutorial
By Shayan, 6 hours ago, In English

Note: The text editorials will be provided by the authors of the round. This video tutorial acts as an additional resource for those who prefer video over text, not as a substitute for the text editorial.

2022A — Bus to Pénjamo

Video

2022B — Kar Salesman

Video

2022C — Gerrymandering

Video

2022D1 — Asesino (Easy Version)

Video

2022E1 — Billetes MX (Easy Version)

Video

2022E2 — Billetes MX (Hard Version)

Video
  • Vote: I like it
  • -17
  • Vote: I do not like it

»
6 hours ago, # |
← Rev. 3   Vote: I like it -19 Vote: I do not like it

First comment xD

→ Reply
»
5 hours ago, # |
  Vote: I like it -6 Vote: I do not like it

Second comment XDDD

→ Reply
»
5 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Third Comment xDDDDD

→ Reply
»
4 hours ago, # |
  Vote: I like it +6 Vote: I do not like it

Oh! nice. Contest was at 1AM IST. Most Cheaters from India could not have participated.

→ Reply
  • »
    »
    4 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It's a bit of racist, but there are significantly less cheaters (probably because there are less participants lol

    → Reply
  • »
    »
    5 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    U also didn't participate :)

    → Reply
»
4 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Hard D2, but really amazing.

→ Reply
»
101 minute(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Is the n limited to 69 people in D1, because it says the limit of n<=10^5?

→ Reply
»
100 minutes ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

hey,can anyone provide me the problems of same type of b,c and d here?i would be grateful

→ Reply
»
93 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

B was a very bad problem.

→ Reply
»
47 minutes ago, # |
  Vote: I like it +1 Vote: I do not like it

To all those who are downvoting this blog, please understand that this is not the official editorial and this guy had nothing to do with the preparation of the problems to be used for the round.

→ Reply
»
40 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

any ideas for D2 anyone ?

→ Reply
»
34 minutes ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

For solving D2, you gotta make three key observations:

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

For B, I'm taking the max x elements from the array and choosing them (subtracting them by the minimum of this subarray), sorting the array again and then repeating until all elements are zero. It's failing at some 294th testcase, why?

→ Reply