Hints for Binary Codes problem please. Got a few trivial observations but nothing close to a full solution. :(
Hints for Binary Codes problem please. Got a few trivial observations but nothing close to a full solution. :(
However I get TLE in last 2 subtasks. O(N*log(N)*log(N)) should work comfortably in 4s right? The TC judge seems to be very slow for other problems that should easily pass too. :(
Any hints? Seems like an annoying problem of pattern analysis, but if its more than just that, I would really like to know!
Sorry, my bad. It wasn't there until last year. :/ I myself don't know it, unfortunately.
Got AC.
Here are some hints:
Maximum Bipartite Matching and Matrix Exponentiation are not in the IOI syllabus. However, Convex Hull is a considerably basic and important geometry algorithm that might feature in the IOITC Tests. You can see more of the official IOI syllabus here: https://people.ksp.sk/~misof/ioi-syllabus/ioi-syllabus.pdf
There is a problem with the judge at the moment. Visit iarcs.org.in and look for the problems archive. The problems with all the testdata have been uploaded.
There is one, but unfortunately for you, its only for students qualified for the IOITC.. :/
I did not understand this:
Could you please explain? :p