Hello,

I don't understand why my solution got a TLE for problem B. Here is the solution I came up with during the contest: 299645061. I'm quite sure the complexity is O(nlogn) but maybe I'm wrong. Here is another solution that doesn't use del: 299814673 even though if I remember correctly the complexity of del is O(1).

Does anyone have similar results?

https://codeforces.me/contest/1526/submission/276695133

It outputs YES YES NO on my computer but YES NO NO on codeforces, for the first test case.

Can somebody help me figure it out? Thanks