OJ Board

Has anyone got any decent test data for this problem?

I'm getting WA and have no idea why! My code appears to work for all of the cases I've been able to come up with, but fails when I submit it.

These are all cases for which my code works properly:


0 0 10 10 1 # Tree can't fall anywhere - 0 ...

The discussion above is very dependent on how you interpret the problem statement.

There is nowhere in the problem statement that says that the integers on the tiles have to be either in the range 1-8 or, more importantly, unique numbers.

1 1 1
1 1 1
0 1 1

has a most distant state of

1 1 0
1 1 1 ...

Your code produces the same output as mine (which works), save for an extra blank line after the very last test case in your code.

Adrian

This!

Adrian

Zopper wrote:Alright, I'm getting RE (runtime) errors, anyone see anything wrong here?

Code: Select all

		delete field;