PROBLEM LINK :
In standard Dijkstra's algorithm problem, you have to take a 1D array but in the modified Dijkstra problem we have to take a 2D distance array and we have to compute the answer
you can check my submission for hints :)
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | atcoder_official | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
→ Find user
→ Recent actions
Another Modified Dijkstra's algorithm problem same as Codeforces Round 974 (Div. 3) problem E
Revision en1, by utkarsh_108, 2024-09-22 21:49:37
History
Revisions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/23/2024 02:18:04 (i2).
Desktop version, switch to mobile version.
Supported by
