1771 - Getting Home

[ymondelo20]

http://coj.uci.cu/24h/problem.xhtml?abb=1771

[Phantom]

May you can post a more ugly test case here?? Because my algorithm works for all my test cases, but the COJ dislike it...

[george]

my algorithm works for all my test cases, but the COJ dislike it...

Can you describe your algorithm?? so someone could understand what you are doing..

[Phantom]

My algorithm is very simple. I initialize the first and the last vertex whith value 0, because Stadium will always be at neighbourhood 1 and Mirko’s house will be at neighbourhood N in the map, and he won't need to pay anything on those two points. Afterward, I implement an algorithm that give me the shorted path since an origin(the first vertex in this case). Afterward, I print the value of the shorted path of the last vertex. Are something wrong??

[ymondelo20]

The main idea is correctly
I think that you should see for the way that you find the shortest path, more especifically, the way in which you make the graph.