#include<bits/stdc++.h>
using namespace std;
#define sp <<' '<<
#define se second
#define fi first
#define pb push_back
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define DEBUG(x) cout<<#x sp x<<endl
#define mid (l+r)/2
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int MAXN=2e5+5;
int n,k;
vi a;
int p[MAXN], dep[MAXN];
vi adj[MAXN];
int say[MAXN][3];
pii say2[MAXN][3];
pii ans;
void dfs(int nd,int ata,int h){
say[h][a[nd]]++;
//cout<<"here" sp h sp a[nd] sp say[h][a[nd]]<<endl;
dep[nd]=h;
for(auto kom:adj[nd]){
if(kom==ata) continue;
dfs(kom,nd,h+1);
}
}
void dfs2(int nd,int ata,int h){
pii res1,res2;
res1=res2={0,0};
int bir,iki;
bir=iki=0;
for(auto kom:adj[nd]){
if(kom==ata) continue;
dfs2(kom,nd,h+1);
if(a[kom]==1) bir++;
else iki++;
res1.fi+=say2[kom][1].fi;
res1.se+=say2[kom][1].se;
res2.fi+=say2[kom][2].fi;
res2.se+=say2[kom][2].se;
}
int deg=min(say[h+1][1]-bir,iki);
//DEBUG(deg);
res1.fi+=deg;
res1.se+=deg;
deg=min(say[h+1][2]-iki,bir);
res2.fi+=deg;
res2.se+=deg;
say2[nd][1]=res1;
say2[nd][2]=res2;
say2[nd][a[nd]].fi++;
if(ans.fi<say2[nd][a[nd]].fi) ans=say2[nd][a[nd]];
else if(ans.fi==say2[nd][a[nd]].fi and ans.se>say2[nd][a[nd]].se) ans=say2[nd][a[nd]];
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n>>k;
a.resize(n+1);
FORE(i,1,n+1){
cin>>a[i];
a[i]++;
}
FORE(i,2,n+1){
cin>>p[i];
p[i]++;
adj[p[i]].pb(i);
}
dfs(1,-1,0);
dfs2(1,-1,0);
cout<<ans.fi sp ans.se<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |