Discussion @ 1198. Jobbery @ Timus Online Judge

GaLL O(N^3) works! [6] // Problem 1198. Jobbery 18 Feb 2006 12:56

Certainly there exist O(N^2) algo, but I had fun solving this problem by O(N^3) in 0.546 sec.

Seishau Dongi Re: O(N^3) works! [1] // Problem 1198. Jobbery 19 Feb 2006 22:30

Please, give me an email or icq num so we can communicate. I want to ask you a few questions.

GaLL[Tyumen SU] mail // Problem 1198. Jobbery 20 Feb 2006 13:24

My e-mail is gallnrs@yandex.ru

Гладких Максим Re: O(N^3) works! [1] // Problem 1198. Jobbery 25 Apr 2006 19:15

That only means that there are tests with large ammounts of edges.

GaLL [Tyumen SU] Re: O(N^3) works! // Problem 1198. Jobbery 30 Apr 2006 20:43

Running time of my algo doesn't depend on quantity of edges (except time of reading), only on N. It's like Floyd algorithm.

dimozzz Re: O(N^3) works! [1] // Problem 1198. Jobbery 15 Feb 2007 21:42

My program solve it for O(n ^ 2). But the time more than 1.1 sec.

Edited by author 15.02.2007 21:45

Denis Koshman Re: O(N^3) works! // Problem 1198. Jobbery 14 Aug 2008 15:36

Same thing here. O(N+M) works in 1.2 sec. Optimizing scanf to gets+strtok makes it 0.9 sec.

Discussion of Problem 1198. Jobbery