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
First comment xD
Second comment XDDD
Thank to this contest which give me a chance to CM qwq
congrats :)
Congra XD
Third Comment xDDDDD
Oh! nice. Contest was at 1AM IST. Most Cheaters from India could not have participated.
It's a bit of racist, but there are significantly less cheaters (probably because there are less participants lol
U also didn't participate :)
Hard D2, but really amazing.
Is the n limited to 69 people in D1, because it says the limit of n<=10^5?
hey,can anyone provide me the problems of same type of b,c and d here?i would be grateful
B was a very bad problem.
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.
any ideas for D2 anyone ?
For solving D2, you gotta make three key observations:
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?