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?

I was just going through random solutions for task A (to observe different approaches), and then I came over this Submission . Doesn't it seems that this guy mahimahans111 cheated. And to prevent plagiarism, he typed unnecessary while loops. His submission for task B suggests the same.

First, he tried to do B himself Submission, but got WA. Then he cheated again and this time This submission got AC.

It may be possible that this is his default boilerplate and he might use it in all submissions, but 2 different submissions for B proved this wrong.

Also see his submission for C Submission is completely different from previous two. Apparently he solved C himself.

From this, I came to conclusion that he cheated in task A and B. I request concerned authority to take some action