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.↵
↵
Leetcode.com/tag/graph↵
Leetcode.com/tag/dynamic-programming↵
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.↵
↵
Leetcode.com/tag/graph↵
Leetcode.com/tag/dynamic-programming↵
Hackerearth.com