That trick for pairs in problem M is just awesome... During the whole contest we were struggling to remove that logn factor but couldn't find the way.

I think that there is a mis-written part in problem A in editorial: a[posi−1]≤a[posi]≥a[posi+1] should be a[posi−1]≤a[posi]≤a[posi+1]

I think there is an error in tutorial for L. "If there are no more than 2 such integers" (second sequence) should be "If there are no more than 1 such integers" or "If there are less than 2 such integers". Because in next paragraph $$$k_i > 1$$$ implies that $$$p$$$ can be important if there are 2 numbers of form $$$p^q$$$.

For M, how is finding all pairs (x,y) not time complexity (k^2)? How exactly do you create a separate array for each integer x and then add all values y to it

In problem C Berpizza why I am getting tle on test case 12 My code please let me know and also how to resolve it

In problem M's tutorial, does it mean that: For every small sets, we find all pairs, which is O(k^2) where the k is the size of the sets. There are M/k sets so that their are O(M*k) pairs in total? How should I implement it? I tried 2 dimension unorderedmap but TLE.

Can anybody share the code of C. Berpizza

"Now, we can note that each a[i] is either minimum in LaIS or i = nxt[j] for some other element a[j]".

Can someone give me a proof of that?

can someone explain how are we finding if it is possible to burst f crackers in problem D?

How do you get to the conclusion that only collinear but oppositely facing vision vectors will make eye contact in problem f. How to prove that any other vision vectors wont make it ??

A note on problem $$$M$$$: it's actually better to set the bound to be $$$400$$$ as opposed to $$$\sqrt{N}$$$. My solution improved from $$$900$$$ ms to $$$700$$$ ms using this better bound.

I know this is extremely late, but for problem D, you don't even need to do binary search. All you need to do is sort the firecrackers. Then iterate from the firecrackers with largest time to smallest time. For firecracker i, check if the space between the hooligan and the cop plus the space between the hooligan and the end is greater than the time of the firecracker and that the hooligan isn't caught yet. Then increase your answer by 1

149971062

The problem $$$M$$$ has a bipartite graph and asks if there is a cycle of length $$$4$$$.

Given any bipartite graph if we want to find if there exists a cycle of size $$$N$$$. Where $$$N$$$ is even. Is there any general solution for this?

Btw, I don't think anyone said this yet, but you actually don't need to use binary search for D! After sorting the array, set $$$f = min(m, |a - b| - 1)$$$ since we can't possibly chose any more firecrackers than this. Like the editorial, the optimal order is to chose $$$s[f], s[f - 1], ... s[1]$$$ in that order. The amount of time the security guard will take to reach him depends on where the hooligan is in comparison. If the hooligan is to the left, it will take $$$b - 1$$$ time, since he will run to the left at the end and there are that many squares to the left. If he is to the right, then it will take $$$n - b$$$ units of time since there are that many squares to the right. Let's make that value be equal to $$$t$$$. If we have already selected $$$k$$$ values, there is a bound on the $$$i$$$th value we chose: $$$s[i] <= t - k - 1$$$. The first value must be at most $$$t - 1$$$ instead of $$$t$$$ because it explodes $$$s[i]$$$ seconds after it is dropped, i.e. not including the moment it is dropped. After selecting $$$k$$$ values (the aforementioned case was $$$k = 0$$$), the requirement will decrease by $$$k$$$, of course. If $$$s[i]$$$ does satisfy this condition, we increment $$$k$$$, but either ways we move on to the next. The actual method takes at most $$$O(m)$$$ time since $$$f$$$ is the minimum of it and $$$|a - b| - 1$$$, so the time complexity is $$$O(mlogm)$$$ due to sorting. If you like using counting sort it is $$$O(m)$$$. I used the built-in sort, aka the former. This is my accepted submission using this method.. Also, sorry for being extremely late lol.