Taking more execution time than expected

Revision en1, by errorfound, 2020-10-25 21:05:36

In Problem D-Bandit in a City (Codeforces Round 678), the binary search solution has complexity of O(Nlog(2e14)), where N=2e5, So, it should take around 100ms, but most of submissions using binary search, like this are taking more than 900ms. Can anyone tell why is this happening?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English errorfound 2020-10-25 21:05:36 429 Initial revision (published)