ENG
RUS
Timus 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
1004
. Sightseeing Trip
Show all messages
Hide all messages
TLE #3
[FALL] Levon Oganesyan [RAU]
21 Mar 2015 01:19
I use the algo with N Dijkstras. Does anyone know, can I get AC with that algo, or 0.5 sec is not enough for it?
Re: TLE #3
Pablo Hofstra
23 Aug 2015 18:40
I use Dijkstra and the language Python. If you are using C/C++ you can be well within the 0.5 sec, when implemented properly.
© 2000–2026
Timus Online Judge Team
. All rights reserved.
