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 | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 154 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | pajenegod | 144 |
9 | orz | 144 |
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 |
---|