Hey guys,
The following submission keeps getting TLE even though it has the same time complexity as the official solution ($$$\mathcal{O}(n)$$$)
Submission: https://mirror.codeforces.com/contest/1430/submission/104613827
Problem: https://mirror.codeforces.com/problemset/problem/1430/C
Any ideas about what's going on?