CSES Problem Set "Shortest Routes I" using Dijkstra algo

Revision en1, by Brainless_Loco, 2020-09-03 18:58:00

I was trying to solve Shortest Routes I problem using Dijkstra Algorithm. But I am getting TLE Verdict on 2 test cases and the rests were accepted. My Solution Link. I saw some solutions on online but i didn't understand those. Can anyone please let me know the problem with my code,how can i modify this code to get accepted?

Thanks in advance.

Tags #cses

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Brainless_Loco 2020-09-03 18:58:00 493 Initial revision (published)