洛谷P2921/BZOJ1589[USACO08DEC]在农场万圣节Trick or Treat on the Farm

Every year in Wisconsin the cows celebrate the USA autumn holiday of Halloween by dressing up in costumes and collecting candy that Farmer John leaves in the N (1 <= N <= 100,000) stalls conveniently numbered 1..N.

Because the barn is not so large, FJ makes sure the cows extend their fun by specifying a traversal route the cows must follow. To implement this scheme for traveling back and forth through the barn, FJ has posted a 'next stall number' next_i (1 <= next_i <= N) on stall i that tells the cows which stall to visit next; the cows thus might travel the length of the barn many times in order to collect their candy.

FJ mandates that cow i should start collecting candy at stall i. A cow stops her candy collection if she arrives back at any stall she has already visited.

Calculate the number of unique stalls each cow visits before being forced to stop her candy collection.

POINTS: 100

Line 1: A single integer: N

Lines 2..N+1: Line i+1 contains a single integer: next_i

Lines 1..N: Line i contains a single integer that is the total number of unique stalls visited by cow i before she returns to a stall she has previously visited.

Four stalls.

Stall 1 directs the cow back to stall 1.

Stall 2 directs the cow to stall 3

Stall 3 directs the cow to stall 2

Stall 4 directs the cow to stall 3
Cow 1: Start at 1, next is 1. Total stalls visited: 1.

Cow 2: Start at 2, next is 3, next is 2. Total stalls visited: 2. Cow 3: Start at 3, next is 2, next is 3. Total stalls visited: 2. Cow 4: Start at 4, next is 3, next is 2, next is 3. Total stalls visited: 3.

var
n,l,time,top,x,p,q    :longint;
i                     :longint;
size                  :array[0..200010] of longint;
low,dfn,z,belong,last :array[0..100010] of longint;
ans                   :array[0..100010] of longint;
vis                   :Array[0..100010] of boolean;
other,pre             :array[0..200010] of longint;
function min(a,b:longint):longint;
begin
if a<b then exit(a) else exit(b);
end;

procedure connect(x,y:longint);
begin
inc(l);
pre[l]:=last[x];
last[x]:=l;
other[l]:=y;
end;

procedure dfs(x:longint);
var
cur:longint;
p,q:longint;
begin
inc(time);
dfn[x]:=time;
low[x]:=time;
vis[x]:=true;
inc(top);
z[top]:=x;
//
q:=last[x];
while (q<>0) do
begin
p:=other[q];
if dfn[p]=0 then
begin
dfs(p);
low[x]:=min(low[x],low[p]);
end else
if vis[p] then low[x]:=min(low[x],dfn[p]);
q:=pre[q];
end;
//
if (dfn[x]=low[x]) then
begin
cur:=-1;
while (cur<>x) do
begin
cur:=z[top];
dec(top);
vis[cur]:=false;
belong[cur]:=x;
inc(size[belong[cur]]);
end;
end;
end;

function find(x:longint):longint;
begin
if (ans[x]<>0) then exit(ans[x]);
ans[x]:=find(other[last[x]])+1;
exit(ans[x]);
end;
//

begin
for i:=1 to n do
begin
connect(i,x);
end;
for i:=1 to n do if dfn[i]=0 then dfs(i);
//
for i:=1 to n do
if (size[belong[i]]>1) then ans[i]:=size[belong[i]] else
if (other[last[i]]=i) then ans[i]:=1;
//
for i:=1 to n do
if (ans[i]=0) then ans[i]:=find(i);
//
for i:=1 to n do writeln(ans[i]);
end.

——by Eirlys