I have got the solution for small p by calculating Dist [u] [i] for i=0 to p-1 using Dijkstra.. how to solve it such that the solution is independent of the value of p.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 172 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
9 | pajenegod | 145 |
Dijkstra variation problem
I have got the solution for small p by calculating Dist [u] [i] for i=0 to p-1 using Dijkstra.. how to solve it such that the solution is independent of the value of p.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en6 | Rehmaan_2001 | 2023-08-06 20:03:55 | 333 | |||
en5 | Rehmaan_2001 | 2023-07-28 13:03:17 | 30 | |||
en4 | Rehmaan_2001 | 2023-07-28 13:02:09 | 81 | |||
en3 | Rehmaan_2001 | 2021-12-18 16:57:01 | 59 | |||
en2 | Rehmaan_2001 | 2021-12-18 14:41:38 | 11 | |||
en1 | Rehmaan_2001 | 2021-12-18 12:32:11 | 272 | Initial revision (published) |
Name |
---|