Submission #1813589

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <algorithm>
#define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++ i)
#define per(i, a, b) for (int i = (a), _ = (b); i >= _; -- i)
#define For(i, a, b) for (int i = (a), _ = (b); i < _; ++ i)
#define fore(e, u, v) for (int p = e(u), v = e[p].y; p; v = e[p = e[p].nxt].y)
#define ri rd<int>
using namespace std;
const int maxN = 1e5 + 7;

template<class T> inline T rd() {
	bool f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = 0;
	T x = 0; for (; isdigit(c); c = getchar()) x = x * 10 + c - 48; return f ? x : -x;
}

int n, m;
int fa[maxN];
int ans = 0;
int depth[maxN];

struct vec {
	static const int maxE = maxN;
	int g[maxN], te;
	struct edge {int y, nxt;} e[maxE];
	inline void push(int x, int y) {e[++te] = (edge){y, g[x]}; g[x] = te;}
	inline void link(int x, int y) {push(x, y), push(y, x);}
	inline int& operator () (int x) {return g[x];}
	inline edge& operator [] (int x) {return e[x];}
}e;

void dfs(int x) {
	depth[x] = 1;
	fore (e, x, y) {
		dfs(y);
		depth[x] = max(depth[x], depth[y] + 1);
	}
	if (x != 1 && fa[x] != 1 && depth[x] == m - 1) {
		ans ++;
		depth[x] = 0;
	}
}

int main() {

	n = ri(), m = ri() + 1;
	rep (i, 1, n) fa[i] = ri();

	ans = (fa[1] != 1); fa[1] = 1;
	rep (i, 2, n) e.push(fa[i], i);
	dfs(1);
	printf("%d\n", ans);

	return 0;
}

Submission Info

Judge Result