Query regarding time complexity of the solution

Правка en1, от Sad_reacts_only, 2020-08-15 18:10:17

I have made a submission to problem — 1398G - Running Competition My submission — 90009972

According to me, it's time complexity is O(n^2 / 32) and n is 2*10^5. Then why it's not TLE? or am I calculating the time complexity wrong?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Sad_reacts_only 2020-08-15 18:10:17 295 Initial revision (published)