ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

## Discussion of Problem 1137. Bus Routes

AC!Your task is to find the Euler Path.My algo is O(V+E).At first I am worried about the menory,but 430-300k AC.
Posted by Yu YuanMing 8 Jul 2004 21:45
Re: AC!Your task is to find the Euler Path.My algo is O(V+E).At first I am worried about the menory,but 430-300k AC.
Posted by Saturn 9 Jul 2004 15:36
My program run in 0.03s but used 595K
http://acm.timus.ru/status.aspx?space=1&pos=637711
Re: AC!Your task is to find the Euler Path.My algo is O(V+E).At first I am worried about the menory,but 430-300k AC.
Posted by [NU GYM] I am get tester... 28 Dec 2005 17:20
Why did your program work so long?
My algo was O(V+E) too. And I got AC with 0.001s
Re: AC!Your task is to find the Euler Path.My algo is O(V+E).At first I am worried about the menory,but 430-300k AC.
Posted by wangyin 12 Aug 2006 19:51
I got ac in 0.015s,590k

Just use eularian tour.
Re: AC!Your task is to find the Euler Path.My algo is O(V+E).At first I am worried about the menory,but 430-300k AC.
Posted by Denis Koshman 29 Jul 2008 15:31
I can be solved without Euler paths. Just DFS over bus routes, walking away for a side-cycle at each of its nodes if that side-route wasn't yet traversed.