What can be in this test? What answer for this test?

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

Is answer "0.00"???

Yes. It is "0.00".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!

Is that #2?

I can't get through test#2 please help.

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

Thank you!

Thanks