ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1254. Die Hard

A little hint for those, who have TLE and who use Dijkstra's algorithm
Posted by Leonid (SLenik) Andrievskiy 3 Jul 2011 03:53
My program was written on C#

I had written simple Dijkstra -> TLE #6 [ID = 2902593]
I had written Dijkstra over Heap (a.k.a. PriorityQueue) -> TLE #6 [ID = 2902684]
I had written Dijkstra over RMQ -> AC (3.296 s) [ID = 3643861]

Use RMQ for Dijkstra!