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.
It feels like a fool to mess with TLE for all these hours, scratching my head over it, reading the implementations of others in other languages, compare and debug line by line, and only to realise the ordering of heapq is actually (priority, task) instead of the (task, priority).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #83: Path sum: four ways
You are viewing a single comment's thread. Return to all comments →
It feels like a fool to mess with TLE for all these hours, scratching my head over it, reading the implementations of others in other languages, compare and debug line by line, and only to realise the ordering of
heapq
is actually(priority, task)
instead of the(task, priority)
.