We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
For me, changing the way to read the input (either input() or sys.stdin.readline()) did not prevent the timeout.
I had to use a priority queue to perform the step "find node with the least distance" of Dijkstra's algorithm.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Dijkstra: Shortest Reach 2
You are viewing a single comment's thread. Return to all comments →
For me, changing the way to read the input (either
input()
orsys.stdin.readline()
) did not prevent the timeout. I had to use a priority queue to perform the step "find node with the least distance" of Dijkstra's algorithm.