|
|
| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | | Problem 1364 “LaraKiller”. The statement was updated. | Sandro (USU) | 1364. Поймать Лару | 12 авг 2022 10:38 | 2 | 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. It's still unclear what to output if Lara has enough time to escape (i.e. there is no reason to hide) - empty output? My AC solution ignores that case like if entrance is locked. | | wa on 6 test!!! | Artem Ladik | 1364. Поймать Лару | 2 авг 2012 16:36 | 3 | check some tests
input
5 5
1 5
1 3
0
output
1 3
input
5 5
1 5
1 3
10000000
output
1 1
1 2
1 3
1 4
1 5
input
100 100
51 50
1 1
1000000
output
1 1
1 2
...
51 51
51 50
#10000 points
input
2 100
2 1
1 1
100000
output
1 1
1 2
...
1 99
1 100
2 100
2 99
...
2 2
2 1
#200 points
Just check more carefully borders you print!
For example (Lara's position - T) can be less or equal to zero. Try this test:
2 2
2 1
2 1
4 | | Help me please, I am very stupid | Romow Peter | 1364. Поймать Лару | 14 фев 2008 02:00 | 2 | 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 guess the statement "As soon as Lara finds the second treasure (and goes immediately to buy the usual bottle of champagne), a new alarm system (of "LaraKiller" brand) will be set off." should not be there in the question.
I wrote my program with the assumption that the alarm can ring even before Lara has found the treasure and i got AC 0.031.
I used recursion to do the whole thing(The problem reverts to a (N-2)X(M-2) cemetry problem after each round). | | that's icredible! why wa#1? (+) | Krayev Alexey (PSU) | 1364. Поймать Лару | 17 авг 2006 02:21 | 1 | 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 | | Why in the test 9 I'm have TLE? | test | 1364. Поймать Лару | 23 мар 2006 12:47 | 1 | | | What does this problem mean??? | Fu Dong | 1364. Поймать Лару | 5 июл 2005 03:27 | 3 | I'm sorry I don't understand this problem, who can explain it to me? Thank you. With someone's help, I've understood the mean of this problem. Can you explain me the problem? To be more specific, I don't understand what Lara does. | | I found some ambiguity of LaraKiller(1364) | semiconductor | 1364. Поймать Лару | 26 апр 2005 17:58 | 3 | 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 ?
Lara runs through the underground passage she dugged before.
And "graves shall be sorted by the distance" through this passage. As you can see output is a part of passage.
Lara is detected only then she stoled treasure.
Lara does a right spiral traversal. Thanks Pavel, now I got ac. This problem is pretty easy after one figures out what it means |
|
|
|
