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.
Leetcode.com/tag/graph Leetcode.com/tag/dynamic-programming Hackerearth.com
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 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.
Leetcode.com/tag/graph Leetcode.com/tag/dynamic-programming Hackerearth.com
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|