2815: [ZJOI2012]灾难 - BZOJ

  1 const
  2     maxn=66000;
  3     maxm=1000000;
  4 var
  5     d,ans,first,dep:array[0..maxn]of longint;
  6     last,next:array[0..maxm]of longint;
  7     f:array[0..maxn,0..100]of longint;
  8     n,tot:longint;
  9  
 10 procedure insert(x,y:longint);
 11 begin
 12     inc(d[y]);
 13     inc(tot);
 14     last[tot]:=y;
 15     next[tot]:=first[x];
 16     first[x]:=tot;
 17 end;
 18  
 19 var
 20     q:array[0..maxn]of longint;
 21     l,r:longint;
 22  
 23 procedure init;
 24 var
 25     i,x:longint;
 26 begin
 27     read(n);
 28     for i:=1 to n do
 29       begin
 30         read(x);
 31         while x<>0 do
 32           begin
 33             insert(i,x);
 34             read(x);
 35           end;
 36       end;
 37     l:=1;
 38     for i:=1 to n do
 39       if d[i]=0 then
 40       begin
 41         inc(r);
 42         q[r]:=i;
 43       end;
 44 end;
 45  
 46 procedure new(x:longint);
 47 var
 48     i:longint;
 49 begin
 50     i:=0;
 51     while f[x,i]<>0 do
 52       begin
 53         f[x,i+1]:=f[f[x,i],i];
 54         inc(i);
 55       end;
 56 end;
 57  
 58 procedure swap(var x,y:longint);
 59 var
 60     t:longint;
 61 begin
 62     t:=x;x:=y;y:=t;
 63 end;
 64  
 65 function lca(x,y:longint):longint;
 66 var
 67     k:longint;
 68 begin
 69     if dep[x]<dep[y] then swap(x,y);
 70     while dep[x]>dep[y] do
 71       x:=f[x,trunc(ln(dep[x]-dep[y])/ln(2))];
 72     if x=y then exit(x);
 73     while f[x,0]<>f[y,0] do
 74       begin
 75         k:=0;
 76         while f[x,k+1]<>f[y,k+1] do
 77           inc(k);
 78         x:=f[x,k];
 79         y:=f[y,k];
 80       end;
 81     exit(f[x,0]);
 82 end;
 83  
 84 procedure work;
 85 var
 86     i,j,now,t:longint;
 87 begin
 88     while l<=r do
 89       begin
 90         now:=r;
 91         for i:=l to r do
 92           begin
 93             j:=first[q[i]];
 94             while j<>0 do
 95               begin
 96                 dec(d[last[j]]);
 97                 if d[last[j]]=0 then
 98                 begin
 99                   inc(now);
100                   q[now]:=last[j];
101                 end;
102                 j:=next[j];
103               end;
104           end;
105         l:=r+1;
106         r:=now;
107       end;
108     for i:=n downto 1 do
109       begin
110         j:=first[q[i]];
111         t:=last[j];
112         j:=next[j];
113         while j<>0 do
114           begin
115             t:=lca(t,last[j]);
116             j:=next[j];
117           end;
118         f[q[i],0]:=t;
119         dep[q[i]]:=dep[t]+1;
120         new(q[i]);
121       end;
122     for i:=1 to n do
123       inc(ans[f[q[i],0]],ans[q[i]]+1);
124     for i:=1 to n do
125       writeln(ans[i]);
126 end;
127  
128 begin
129     init;
130     work;
131 end.