Problem link: https://mirror.codeforces.com/problemset/problem/1294/D My submission: https://mirror.codeforces.com/contest/1294/submission/172332862

The problem I am trying to solve has constraints as given, 1 <= q, x <= 4 * 10^5 The time complexity of the solution I have submitted is around O(2 * q). It's basically a linear time solution.

My expectation was that the highest time it would take would be around 100-200 mx. But the solution took around 1200 ms at worst case. Which is far higher than I expected. What is the reason behind this high time complexity