| # | User | Rating |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 9 | TheScrasse | 144 |
CSES Problem Set "Shortest Routes I" using Dijkstra algo
I was trying to solve Shortest Routes I problem using Dijkstra Algorithm. But I am getting TLE Verdict on 2 test cases and the rests were accepted. My Solution Link. I saw some solutions on online but i didn't understand those. Can anyone please let me know the problem with my code,how can i modify this code to get accepted?
Thanks in advance.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
Brainless_Loco | 2020-09-03 18:58:00 | 493 | Initial revision (published) |
