http://codeforces.com/problemset/problem/902/B
题意:给你一颗树进行染色,根节点为1。每个节点要求染成颜色xi,对于一个节点进行染色操作,那么它的所有后代都被染成这个颜色。
题解:对于节点看它是否与与其父节点同色,若同色就不需要重新染色,若不同就需要进行一次染色操作。
代码:
#include<bits/stdc++.h>
#define debug cout<<"aaa"<<endl
#define d(a) cout<<a<<endl
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define LL long long
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define MIN_INT (-2147483647-1)
#define MAX_INT 2147483647
#define MAX_LL 9223372036854775807i64
#define MIN_LL (-9223372036854775807i64-1)
using namespace std;
const int N = 10000 + 5;
const int M = N * N + 5;
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
int main(){
int n,ans=1;
int col[N],fa[N];
cin>>n;
for(int i=2;i<=n;i++){
cin>>fa[i];
}
for(int i=1;i<=n;i++){
cin>>col[i];
}
for(int i=2;i<=n;i++){
if(col[i]!=col[fa[i]]){
ans++;
}
}
cout<<ans<<endl;
return 0;
}