ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1200. Horns and Hoofs

How come the suboptimal algorithms get accepted?
Posted by waddlepoof 20 Apr 2020 12:07
I mean, there obviously must be some compiler optimizations that enable the O(K^2) algorithm to be accepted for the worst case.

For example, I've tried binary search, given that this is a convex function, and the amount of branch prediction misses slows the thing down a lot.

I've been looking at godbolt.org output and can't figure out what is happening here.