Problem 42290. GJam 2015 Rd1B: Noisy Neighbors
There is no need to test all cases. The ideal case is a swiss cheese in which no guest share a wall. Just start filling rooms from there if needed (the only problems is that room filling must follow an order, which makes the code quite large (but repetitive and boring), and there are two base cases for the swiss cheese structure). Maybe it's possible to create a function and decrease code size, but unless you see it at the moment that you are coding it, it would mean loosing too much time during competition when a Ctrl+C, Ctrl+V would be faster (and better than testing all cases).
Currently, my solutions and this one are the only that don't use brute force, but this one is the smallest. Congrats. :) (I was able to create a smaller solution after looking at your code.)
Problem Recent Solvers10
Vectorize the digits of an Integer
Longest run of consecutive numbers
Count consecutive 0's in between values of 1
More from this Author260
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!