Обсуждение @ 1137. Автобусные маршруты @ Timus Online Judge

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.

Послано Yu YuanMing 8 июл 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.

Послано Saturn 9 июл 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.

Послано [NU GYM] I am get tester... 28 дек 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.

Послано wangyin 12 авг 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.

Послано Denis Koshman 29 июл 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.

Обсуждение задачи 1137. Автобусные маршруты