Problem:
Score : 800 points

Problem Statement

There are N towns in Snuke Kingdom, conveniently numbered 1 through N.
Town 1 is the capital.

Each town in the kingdom has a Teleporter, a facility that instantly transports a person to another place.
The destination of the Teleporter of town i is town a_i (1≤a_i≤N).
It is guaranteed that one can get to the capital from any town by using the Teleporters some number of times.

King Snuke loves the integer K.
The selfish king wants to change the destination of the Teleporters so that the following holds:

Starting from any town, one will be at the capital after using the Teleporters exactly K times in total.

Find the minimum number of the Teleporters whose destinations need to be changed in order to satisfy the king's desire.

Constraints

2≤N≤10^5

1≤a_i≤N

One can get to the capital from any town by using the Teleporters some number of times.

1≤K≤10^9

Input

The input is given from Standard Input in the following format:

N K
a_1 a_2 ... a_N

Output

Print the minimum number of the Teleporters whose destinations need to be changed in order to satisfy King Snuke's desire.

Sample Input 1

3 1
2 3 1

Sample Output 1

2

Change the destinations of the Teleporters to a = (1,1,1).

Sample Input 2

4 2
1 1 2 2

Sample Output 2

0

There is no need to change the destinations of the Teleporters, since the king's desire is already satisfied.

Sample Input 3

8 2
4 1 2 3 1 2 3 4

Sample Output 3

3

For example, change the destinations of the Teleporters to a = (1,1,2,1,1,2,2,4).

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>

#define M_PI       3.14159265358979323846   // pi

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;

#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)

using namespace std;

static const ll INF = 1e15;

template<typename T>
static inline void chmin(T & ref, const T  value) {
	if (ref > value) ref = value;
}

template<typename T>
static inline void chmax(T & ref, const T value) {
	if (ref < value) ref = value;
}

struct topoloricalSort_runnner {
	typedef vector<vector<int>> Graph;
	vector<int> input;

	bool topologicalSort(const Graph& graph, vector<int>& order) {
		int n = graph.size();
		//入次数
		input.assign(n, 0);
		rep(i, n) {
			for (auto dest : graph[i]) {
				input[dest]++;
			}
		}
		//rootを幅優先探索
		queue<int> q;
		rep(i, n) {
			if (input[i] == 0) {
				q.push(i);
			}
		}
		int multiple = 0;
		while (!q.empty()) {
			//順位が一位に決まらない
			if (q.size() >= 2) {
				multiple = 1;
			}
			auto id = q.front(); q.pop();
			order.push_back(id);
			for (auto next : graph[id]) {
				//すべての親を処理し終わったら処理する
				input[next]--;
				if (input[next] == 0) {
					q.push(next);
				}
			}
		}
		return multiple;
	}
};


int main() {
	ll n,k;
	cin >> n >> k;
	vector<ll> as(n);
	vector<vector<ll>> rev(n);
	rep(i, n) {
		cin >> as[i];
		as[i]--;
		rev[as[i]].push_back(i);
	}
	ll sum = 0;
	if (as[0] != 0) {
		sum++;
	}
	vector<ll> dist(n, -1);
	function<void(int, int)> dfs = [&](int current, int depth){
		if (dist[current] >= 0) return;
		if (depth > k) {
			sum++;
			depth = 1;
		}
		dist[current] = depth;
		for (auto p : rev[current]) {
			if (p == current) continue;
			dfs(p, depth + 1);
		}
	};
	dfs(0, 0);
	cout << sum << endl;
	return 0;
}