I was trying to solveCSES Shortest Routes Iusing priority_queue. However, I faced TLE even though I was storing negative of distance in it. After a bit of reading onCP-Algo's Page, they said that The main difference to the implementation with set is that in many languages, including C++...
I was trying to solveCSES Shortest Routes Iusing priority_queue. However, I faced TLE even though I was storing negative of distance in it. After a bit of reading onCP-Algo's Page, they said that The main difference to the implementation with set is that in many languages, including C++...