# 洛谷P2921 [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.

## 输入输出样例

4
1
3
2
3


1
2
2
3


## 说明

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.

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#define MAXN 100010
using namespace std;
int n,c=1,top=1,d=1,colournum=1;
bool beque[MAXN];
struct node{
int next,to;
}a[MAXN];
int date=0,w=1;char c=0;
while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
while(c>='0'&&c<='9'){date=date*10+c-'0';c=getchar();}
return date*w;
}
void add(int x,int y){
a[c].to=y;
}
void work(int x){
int t,s;
beque[x]=true;
deep[x]=low[x]=d++;
cstack[top++]=x;
t=a[i].to;
if(!deep[t]){
work(t);
low[x]=min(low[x],low[t]);
}
else if(beque[t])
low[x]=min(low[x],deep[t]);
}
if(low[x]==deep[x]){
beque[x]=false;
colour[x]=colournum++;
do{
beque[cstack[top-1]]=false;
colour[cstack[top-1]]=colournum-1;
}while(cstack[--top]!=x);
}
}
int dfs(int x){
if(!x||f[x])return f[x];
return f[x]=dfs(stepto[x])+num[x];
}
int main(){
int y;
memset(num,0,sizeof(num));
memset(deep,0,sizeof(deep));
for(int i=1;i<=n;i++){
}
for(int i=1;i<=n;i++)if(!deep[i])work(i);
for(int i=1;i<=n;i++)num[colour[i]]++;
for(int i=1;i<=n;i++){
} 