Hi guys, i tryed to solve this problem with the treap (the randomized binary search tree ). It works for O(N*logN) , but i got TLE!!!!!

For examlpe, i tryed to solve one problem (1208) with bruteforce (2^18 * 18), and i also  got TLE, but on the CodeForces in max case, i got MAX : 0.3ms on the same complillers...
Maybe you shouldn't put such small time limits?
(Soz for Eng)