With insight of the 5 color theorem (precursor to 4 color theorem) I tried a simple dfs greedy solution. It passed the hidden test!
Not sure if/why it really works, I downloaded the test inputs and tried it. Took me half an hour trying to increase the stack size, finally it runs, and... BOOM, only 10 mascots are used! That's a wide margin from 13. And it's just a crude, greedy solution. So, I wonder if someone can do it with less than 10 mascots. I'll appreciate it if you can post a solution with even less mascots, or to show a proof otherwise. Regards, WC Leung. -- -- You received this message because you are subscribed to the Google Groups Code Jam group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at https://groups.google.com/d/forum/google-code?hl=en --- 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 [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/58228b4c-cbd0-4b4c-91e0-38574d7d38f5n%40googlegroups.com.
