https://www.hackerearth.com/challenges/competitive/september-clash-15/algorithm/dangerous-dungeon/description/ ↵
↵
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.↵
↵
https://leetcode.com/problemset/all/?topicSlugs=dynamic-programming%2Cunion-find%2Cgraph%2Ctopological-sort%2Ctrie%2Cbinary-indexed-tree%2Csegment-tree%2Ctree%2Cdepth-first-search%2Cbreadth-first-search%2Cminimum-spanning-tree%2Cbiconnected-component%2Cstrongly-connected-component%2Cshortest-path%2Cordered-set&difficulty=Hard↵
↵
↵
https://leetcode.com/tag/graph↵
https://leetcode.com/tag/dynamic-programming↵
https://hackerearth.com
↵
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.↵
↵
https://leetcode.com/problemset/all/?topicSlugs=dynamic-programming%2Cunion-find%2Cgraph%2Ctopological-sort%2Ctrie%2Cbinary-indexed-tree%2Csegment-tree%2Ctree%2Cdepth-first-search%2Cbreadth-first-search%2Cminimum-spanning-tree%2Cbiconnected-component%2Cstrongly-connected-component%2Cshortest-path%2Cordered-set&difficulty=Hard↵
↵
↵
https://leetcode.com/tag/graph↵
https://leetcode.com/tag/dynamic-programming↵
https://hackerearth.com
