Auto comment: topic has been updated by Kinon (previous revision, new revision, compare).

Clashes with codechef Lunchtime.

Move a day later maybe if possible (28th looks completely free as of now).

Niceee!! Will be looking forward to it <3 :punch: :sunglasses: JvThunder yz_ MetalPower CyberSleeper Zanite Edbert.H gansixeneh Bryannoel :fanfare:

Do you guys have any plan to add contest reminder on google calander? It's hard for me to keep track of the contests without it :(

Fun fact about the author, might give you an idea of how the problems are gonna be :)

Thanks for the great contest! I just want to give abit of feedback.

I think testdata for D is super weak. With only 20 tests, I feel that the problem is very easily able to be scammed with heuristics and other weird strategies.

I think one of the participants (Submission #339419) coded the editorial's solution without attaching the extra node (greedily remove cliques) and it ACed.

I think you should reduce limits and give multitests instead.

Edit: ok it turns out that greedily removing cliques actually works using similar analysis as the editorial. so now im more confused on why the editorial didnt just talk about the more natural solution of removing cliques...

empirically removing cliques seems to only use 60k queries

not able to see English problem statements while upsolving, tried viewing problem statements in mobile, laptop(chrome, brave browser)

upd: Iam able to view now

C's author solution is beautiful <3, I wonder how many were able to think of it, I iterated over bitmask.