Discussion @ 1280. Topological Sorting @ Timus Online Judge

Andrew Yu 0.79sec AC.My algo is O((m+n)lgm).But why it is so slow? [3] // Problem 1280. Topological Sorting 23 Jul 2004 18:22

Dilyan hm... [2] // Problem 1280. Topological Sorting 9 May 2005 05:28

for n = 10000 and m = 100000 you get approximately 2.10^6. the only way to get 0.79 is if the constant is big enough.
mine is O(m + n) and I get 0.079

RedRick <<TSOGU>> Re: hm... [1] // Problem 1280. Topological Sorting 16 Sep 2009 22:19

my algo O(m+n) too, 0.046 s

adamant Re: hm... // Problem 1280. Topological Sorting 21 Dec 2013 14:51

O(m+n^2) algo gets AC with 0.046 :D

Discussion of Problem 1280. Topological Sorting