In short: I have trouble figuring out what I did wrong on Problem A. I had 3 incorrect submissions, but the exact same code gives the correct solution for the practice input now that the round is over.
I've attempted problem A, Charging Chaos, for the previous Round 1A with Java. While I recognized the problem as relatively simple bit pattern matching, I'm not experienced with bitwise operations. Because of the time constraint I couldn't afford to familiarize myself with bitwise operations so I (sadly) wrote a lot of logic in order to work with the data. Despite the messy resulting code I was certain I was very close to a correct solution. I had taken the sample input and provided the correct output, and after my first incorrect submission I've added some cases to this 'sample input' in order to debug my program. I ended up with a brute force approach where I generated all possible permutations of bit patterns... I've since inspected some of the top ranked Java submissions and understand their solutions. However, it doesn't show me which corner cases my approach misses, since it gave an incorrect output during the attempts in the actual round. If someone would be willing to quickly sift through my code and try to find which corner cases I could be missing, I would be very grateful. I couldn't find a way to link my submissions (since there's no actual correct solution) so here's my zipped file shared publicly on my Drive. https://drive.google.com/file/d/0B6GdM9JUZFc6YkVYRjViamlDMTg/edit?usp=sharing -- 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/0877b50e-0916-4279-996a-da16d0e9fd40%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
