The original version of the statement was unclear, and not all the limitations were described in the input data format.

Both English and Russian version of the statement were updated.

I don't understand, why output have (2,3),(3,3),(4,3) graves? When Lara will dig out the second grave with treasure, she at once will go back, it is true?

I checked, the 1st test is actually sample, but my program proccesses it correctly on my computer. then why wa1?


Edited by author 17.08.2006 18:58

I'm sorry I don't understand this problem, who can explain it to me? Thank you.

The problem states:
 "[output]The graves shall be sorted by the distance that Lara will have to run from this grave to the cemetry entrance."
But in the sample output:
####
5 2
5 1
4 1
3 1
2 1
2 2
2 3
3 3
4 3
####
Clearly (2,1) is the nearest grave to entrace (1,1), but it appears in the middle !
Another thing is: (4,3) has not been digged by the time Lara is detected. So Lara shouldn't have time to be able to be (4,3). But (4,3) is in the sample output.
I think before Lara is detected, she does a snake shaped traversal( (1,1)->(1,2)->(1,3)->(1,4)->(2,4)->... ), am I right?
And what is the right interpretation of this problem, please ?