| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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 ??
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 !!