ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1254. Die Hard

M@STeR.SoBG Strange WA #2 [6] // Problem 1254. Die Hard 25 Jul 2007 05:43
What can be in this test? What answer for this test?

5 1 1 0.02
.#...
1 1
5 1

Is answer "0.00"???
Rafail Ahmadisheff "0.00" is correct (+) [5] // Problem 1254. Die Hard 9 Aug 2007 01:15
M@STeR.SoBG wrote 25 July 2007 05:43
Is answer "0.00"???
Yes. It is "0.00".
If he can't reach some bomb he moves to the next one.
What if none of the bombs can be reached? If this is the case, you may assume, that agent's mission is complete - he can do nothing, so he does nothing and it takes him no time to do it!
TlaughE I got WA in #2 too [4] // Problem 1254. Die Hard 19 Nov 2007 09:45
Is that #2?
KALO Re: I got WA in #2 too [3] // Problem 1254. Die Hard 28 Oct 2010 00:14
I can't get through test#2 please help.
Ibragim Atadjanov (Tashkent U of IT) Re: I got WA in #2 too [2] // Problem 1254. Die Hard 12 Nov 2010 08:15
I also had that problem(wa2). But when I made a test I understood my mistake and got ac. I've used dijkstra
and in main method I did like this

for(int i = 0; i< k - 1; i ++){
   dijkstra(i);
    ......
}

and this was wrong
example imagine I cannot reach to th 3rd boomb.So my walk will be like this
0 ->1 ->2 ->3(unreachable) 3->4 .....
instead, it must be like this
0 ->1 ->2 ->3(unreachable) 2->4 .....

I dont know your problem but mine was like above [stupid(:]

test
5 5 5 1
.....
.###.
.#.#.
.###.
.....
1 1
5 1
3 3
5 5
1 5
1 3
ans 14
If it wont help,  you can post me ur code(to email)


Edited by author 12.11.2010 08:20
KALO Re: I got WA in #2 too // Problem 1254. Die Hard 15 Nov 2010 00:06
Thank you!
Edric Mao Re: I got WA in #2 too // Problem 1254. Die Hard 22 Oct 2011 16:55
Thanks