Submission #1868012

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int MAXN = 1e5 + 10;
class Edges{
public:
	int next , to;
};
Edges edge[MAXN * 2];
int first[MAXN];
int n , k , x;
int ans = 0 , te = 0;
void add(int s , int t){
	++ te;
	edge[te].next = first[s];
	edge[te].to = t;
	first[s] = te;
}

int set(int pos , int fa){
	int maxn = 1;
	for(int e = first[pos] ; e ; e = edge[e].next){
		int to = edge[e].to;
		if(to == fa) continue;
		maxn = max(maxn , set(to , pos) + 1);
	}
	if(maxn == k && fa != 1){
		ans ++;
		return 0;
	}
	else
		return maxn;
}
int main(){
	cin >> n >> k >> x;
	if(x != 1) ans ++;
	for(int i = 2 ; i <= n ; ++ i){
		cin >> x;
		add(x , i);
		add(i , x);
	}
	set(1 , 1);
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result