Jzzhu and Cities WA (dijkstra)

Revision en1, by Mr.Awesome, 2015-08-30 12:56:49

I'm getting WA in this 449B this is my submission

i implemented the dijkstra's algorithm to find shortest path between the capital and each city , and the result is stored in dist[] .

could anyone point out the problem , or tell me if my idea is wrong ??

Tags graph, shortest path

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Mr.Awesome 2015-08-30 12:56:49 394 Initial revision (published)