I chose an algorithm at random, and ran into model size trouble. I really should have though about testing the implementation on a real sized one ! >_<
One interesting phrase about all this is this one
The general case is NP complete. (If i understand correctly). Well to be fair, the nintendo one isn't the general case, that's for sure. Still i wonder on the "right" way of solving it.
And that's wondering what's the highest size that can be solved within the 5 allocated seconds on the coding game server (well, i'm still lacking a way to pass the so called 32 bits sized test cases, but well).
Edit : So the question is thus -> How long does it takes your algorithm to solve the official test cases (let's say at least one of the biggest) on the codin game server (if you use more than one thread, please say so)