On Tuesday, 15 April 2014 07:39:01 UTC+1, Abhilash Kulkarni wrote: > Hi everyone, > I am newbie to competitive programming contest; this code jam was my first > one. I was able to solve the minesweeper master problem and got correct > result for the small input. But my code was perhaps pretty bad and the > execution time for large input crossed the time limit. > My question is, is it necessary to make separate versions of the program for > small input and large input, and what strategies must we apply to handle > large inputs effectively? Is it necessary to have knowledge of special > algorithms, especially considering that future rounds may contain more such > questions. > Also please suggest me some good books for algorithms, as I find online > tutorials to limited in detail. > Thanks in advance!
Any program that can solve the large inputs should also be able to solve the small inputs. The main thing to recognise in minesweeper was that the cell to click should always be in the corner, so it's a case of filling up the rest of the grid leaving a gap in one corner, plus some special rules to avoid breaking the constraints. There are more in-depth explanations around if you search a bit. -- 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 post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/3e8e0df4-882a-420a-a037-21c7c1c1dbbb%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
