Saturday, May 08, 2010

Google Code Jam - Qualification Round 2010

Google Codejam 2010 is here! As usual, there are three problems with 33 points each (10 points for the small dataset and 23 points for the big dataset). Here's my overview so far of the tournament.

Problem A : Snapper Chain
So far the problem has 84% correct ratio, so it'd indicate it's an easy problem and it is. The problem statement might seem a bit confusing but break it down to essentials, understand the atomic problem and you'll have your solution in no time. But beware, if you don't use appropriate techniques, you might be in trouble for the bigger dataset, so try out some long inputs on your own before you run it for the actual dataset.

Problem C : Theme Park
94% percent correct ratio! Wow, that's saying something. Looks like most of the people got it right. I think I did too and I hope it stays the same for the big testset too. It's quite a straight-forward problem to give any hint. Just manage your data structures well and you should be able to solve it in no time.

Problem B : Fair Warning
As always is the case with Google Code Jam, there will always be one problem where only your coding skills will not save you. You can't just crunch your numbers with a really huge data-type and get away with it. No sir! And Problem B falls straight into that category. As the problem clearly states, "64 bits will not save you. You have been warned." One of the inputs could be as high as 1050 And that's where I am stuck. Hopefully I can solve it out.

I'll post the solutions and tricks here once the contest is over. Till then, happy coding and stay tuned!