Submission #1513494

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int INF = 1145141919;

vector<int> g[100010];
int N, K;
int ans = 0;

int dfs(int cur, vector<int>& used) {
	int res = 0;
	for (int nex : g[cur]) {
		res = max(res, dfs(nex, used) + 1);
	}
	if (res == K - 1) {
		if (!used[cur]) {
			ans++;
			used[cur] = true;
		}
		res = 0;
	}
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	cin >> N >> K;
	vector<int> a(N);
	for (int i = 0; i < N; i++) {
		cin >> a[i];
		a[i]--;
	}

	vector<int> used(N, false);
	used[0] = true;
	for (int i = 1; i < N; i++) {
		g[a[i]].push_back(i);
		if (a[i] == 0) used[i] = true;
	}
	dfs(0, used);

	ans += (a[0] != 0);
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result