This is an educational contest revolving around the IOI problem Meetings. Problems will be uploaded over time.
Data may change without notice to ensure only intended solutions pass.
My very simple O(N^2) keeps getting TLE...
EDIT: Just managed to squeeze the thing into the time limit, but it was a pain in the ass. It'd be great
if the time limit was less strict.
I believe the author is using a time limit of 1.5x the reference solution
Hmm, that's good to know. I basically changed a loop with N^2 iterations to one with N(N+1)/2 iterations and passed with ~2.0-2.1s (it was >2.5s previously), which is very weird.
Anyway, do you know when newer versions are coming? :)
Why is this contest so long?
I just want an answer!!!
Then you can delete my question
We were planning to add more content as the easier versions get solved, with a series of accompanying blog posts. This problem uses a large portion of the data structures tricks in the books, so is very useful to know well.