Same here... got stuck in Test-16 .

My Program says "YES" and i got accepted

Thank. This test help me to get AC

Thank you very much,but now I've WA#33.

Thank you!!!

Thanks a loooooooooooooooot!

Thanks a lot!

Verify correctness = see if there's such a pair in the first list, that goes in reverse order on the second list. For test 2 it's pairs (3 5), (5 2), (4 2), for test 1 there's no such pairs.

May be you need a more tricky algo? It's unable to have WA with this problem (quite simple algo)

I see no problem in the title. It's a very simple straight forward TOP_SORT problem. And I have seen some critical cases in other threads which cases would appear 'critical' if and only if any process other than simple top_sort is approached.

1. Some time ago ML for it was 1MB. Try to solve within this limitation.
2. Average difficulty of a problem on Timus is ~1300, so 192 means that it is very simple problem (~15% of average difficulty), how did you get it is overestimation?

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

No, I don't, idea is simple, but I have a problem: I get MLE of #15, and I can't fix it. I'we tried all ways of graph representation, but I always get MLE #15. Can someone please help me? Here is part of my code that uses the memory, the working part is eliminated:

type
  TEdge=record
          i,j:integer
        end;
var
  g:array[1..100001] of TEdge;
  st,deg:array[0..1001] of integer;
  sol:array[1..1000] of integer;
  n,m,i,k:integer;
procedure sort(l,r:integer);
var
  i,j:integer;
  k,t:TEdge;
begin
  i:=l;
  j:=r;
  k:=g[(i+j) div 2];
  while i<=j do
    begin
      while (g[i].i<k.i) or ((g[i].i=k.i) and (g[i].j<k.j)) do inc(i);
      while (k.i<g[j].i) or ((k.i=g[j].i) and (k.j<g[j].j)) do dec(j);
      if i<=j then
        begin
          t:=g[i];
          g[i]:=g[j];
          g[j]:=t;
          inc(i);
          dec(j)
        end
    end;
  if i<r then sort(i,r);
  if l<j then sort(l,j)
end;
begin
  assign(input,'');
  reset(input);
  readln(n,m);
  for i:=1 to n+1 do
    begin
      deg[i]:=0
    end;
  for k:=1 to m do
    begin
      readln(g[k].i,g[k].j);
      inc(deg[g[k].j])
    end;
  g[m+1].j:=0;
  g[m+1].i:=0;
  for i:=1 to n do
    read(sol[i]);
  sort(1,m);
  close(input);
// working part goes here, cut because of fourth rule.....
end.

It is not topological sorting task :)

May be you use mas[i][j], where is i = 1001, j = 1001 or something like that

M = 0