Dijkstra variation problem

Revision en3, by Rehmaan_2001, 2021-12-18 16:57:01

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.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English Rehmaan_2001 2023-08-06 20:03:55 333
en5 English Rehmaan_2001 2023-07-28 13:03:17 30
en4 English Rehmaan_2001 2023-07-28 13:02:09 81
en3 English Rehmaan_2001 2021-12-18 16:57:01 59
en2 English Rehmaan_2001 2021-12-18 14:41:38 11
en1 English Rehmaan_2001 2021-12-18 12:32:11 272 Initial revision (published)