The obstacle nodes can be any node between 1 to n( max vertices). If no path is possible then -1 otherwise the length between the source and destination.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 163 |
| 1 | maomao90 | 163 |
| 3 | -is-this-fft- | 160 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 6 | awoo | 157 |
| 7 | nor | 155 |
| 8 | adamant | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
find the shortest distance between the source node and destination node in an undirected weighted graph with obstacles
Revision en1, by kxx_monica, 2020-05-14 12:47:23
History
Revisions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/08/2024 01:26:18 (l2).
Desktop version, switch to mobile version.
Supported by
