Submission #1696117

---

Source Code Expand

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;

const int maxn=100010;
int n,k;
vector<int> g[maxn];

void read(int& x){
	x=0; char c=getchar();
	while(c<'0' || c>'9') c=getchar();
	while(c>='0' && c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
}
int dep[maxn], ans, fa[maxn];
void dfs(int x){
	for(int i=0;i<g[x].size();i++){
		int v=g[x][i];
		dfs(v);
		dep[x]=max(dep[x], dep[v]+1);
	}
	if(fa[x]!=1 && dep[x]==k-1) dep[x]=0, ans++;
}

int main(){

	read(n), read(k);
	for(int i=1;i<=n;i++){
		read(fa[i]);
		if(i!=1) g[fa[i]].push_back(i);
	}
	if(fa[1]!=1) ans++; fa[1]=1;
	dfs(1);
	printf("%d",ans+(fa[1]!=1));
	return 0;
}

Submission Info

Judge Result