I am generally bad at greedy problems so I knew problem A would cause me issues even though i thought of that solution. I decided to play it safe, first solved A-small using the bruteforce BFS method, then coded the greedy I couldn't prove and compared its output file with the one I already knew was correct.
On Sep 27, 1:12 am, vivek agarwal <[email protected]> wrote: > I had thought about the swap thing, but I never could prove that it would > give me an optimal solution. Anyways, great contest! Hope I can do better > next year!!! > What I was really wondering is why dont Petr take part in the contest? I > mean, its just cause he is working in Google? As far as I saw till now, he > is not into making problems for any of the rounds. So he can take part, and > may be we can hope for some stiff challenge to ACRush. Or else, ACRush > rushes to the first position so fast!!!! :P > > It was jus 1 hr 9 minutes and he was home with 100 points :) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" 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 http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
