TLE with algorithm O(q * sqrt(n)) Where q = 10^5, n = 10^5?

Revision en2, by Mhammad1, 2015-07-11 19:31:49

I'm trying to solve this problem:

http://mirror.codeforces.com/problemset/problem/455/D

My submission:

http://mirror.codeforces.com/contest/455/submission/12009574

My algorithm runs in O(q * sqrt(n)) so it should pass the test cases. So the question is: what's wrong in my code to make it giving me TLE?

Tags tle, sqrt_decomposition

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Mhammad1 2015-07-11 19:31:49 24
en1 English Mhammad1 2015-07-11 19:15:11 345 Initial revision (published)