It was my first time testing a contest, and I really liked the problems. I hope you guys participate, too! A bit late comment.

A look-up in a set or a map is at most $$$O(\log{n})$$$. And the reason that I deciphered from your post is to force two lookups.

In my solution, I use a vector and then perform a binary search all the 8 times! Hitting the worst without any effort. But this solution did AC. Is it because vectors' contagiousness leads to better caching for this kind of stuff?

Well I almost follow the same strategy.

I submit a WA first and then never submit. That works for me.

Firstly I would like to acknowledge the contest author's effort and thank them. Now I can began my issue with the contest.

I think the statements for problems could have been more clear considering this is a Div 3. Also the explanations for the samples wasn't there or was not even helpful at all. I know that the author is not duty bound to explain the samples but with poor statement explanation I think this should have been done.

I did quite bad in the contest and to check whether I was feeling these issues because I did bad, I slept this off. Now even in the morning I feel the statements could have been better with better sample explanations.

I wanted to just try out the problems in the online round, any way to register without having to upload a resume?

Will you be posting a separate blog regarding the changes ? I'm just curious when will we be able to try the new stuff hands on.

Thanks for your work!

What work in cf you find to be most tedious and uninteresting ? And what do you find the most interesting?

You got lucky that it passes. Undefined behaviour would lead to stranger things.

You have undefined behaviour when you acess a[n]

MrPaul_TUser I'm trying to view this editorial on edge (on laptop) and chrome (on phone), but on both platforms, the editorials aren't available

Spoiler