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 ??
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Did you considered that maybe the shortest path between capital and a city will use one train route and some other roads?
No because the statement inform that train's routes can only connect a city and the capital directly and not 2 cities .
The shortest path between 1 and X could be a train route between 1 and Y and then a path(the shortest path) between Y and X...
i got it , i will work on that . Thanks !!