TLE for Problem C — Cheap Kangaroo

Revision en3, by masmoudi, 2017-11-19 23:30:14

I'm trying to solve the problem C http://codeforces.net/gym/101350/status/C but I don't understand why did I got TLE on test 2, while I used O(n) solution. Can anyone help me explaining it?

My solution 32444002

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English masmoudi 2017-11-19 23:36:05 295
en5 English masmoudi 2017-11-19 23:35:41 313
en4 English masmoudi 2017-11-19 23:34:57 295
en3 English masmoudi 2017-11-19 23:30:14 291
en2 English masmoudi 2017-11-19 23:28:23 4 Tiny change: 'input())\ndef f(a,' -> 'input())\n\ndef f(a,'
en1 English masmoudi 2017-11-19 23:27:31 521 Initial revision (published)