Hello Codeforces,

I was trying to solve Codeforces Round #632 (Div. 2) Problem C. It gave me TLE on the last case (87th case) when I used unordered_map (Link) while it was accepted when I used map (Link).

I know the worst-case time complexity of the unordered_map is O(n) for searching, insertion, and deletion. Is the last case the worst case? Could someone help me to figure out how this is happening or where I'm getting wrong?

Hello Codeforces, I have some issue related to last unsolved problems. I solved some problems but still, I can see in my unsolved problems section. Please help me to get rid out of this my problem.

Thank you in advance.

I have tried to submit the solution to the problem which is shown below. I tried a lot but still get idleness limit exceeded.

This is my solution link.

http://mirror.codeforces.com/contest/916/submission/35832727

Can somebody help me how to overcome this??

Thank you in advance.