Thanks a lot! I will try to keep those optimzations in mind when I try again next year.
I have the feeling that in previous years (when we just computed and submitted the output file) as long as you got the optimal asymptotic complexity (like sth in O(NK) in this case), you were guaranteed to solve the inputs in the appropiate time. My guess is now that since we now just have to submit a program, the available time for the large datasets is much less than 8 min, so we have much less time. So the N is much smaller in our O(NK) Algorithm and that sadly makes sure that the constant in front of the NK matters much more. And that constant seems to be quite high for python. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/472e0cbe-c98b-44bd-8678-a7da738f426e%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
