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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;

using Graph = vector<vector<int>>;

class Tree {
 public:
  Tree(const auto& G) : depth(G.size()), child(G.size()) {build(G);}
  int solve(auto K) {
    function<int(int, int)> dfs = [&](int cur, int limit) {
      auto res = 0;
      if(depth[cur] < limit) {
        for(auto nex: child[cur]) res += dfs(nex, limit);
      } else if(depth[cur] == limit) {
        if(child[cur].size() < 2) {
          for(auto nex: child[cur]) res += dfs(nex, limit);
        } else {
          res = 1;
          for(auto nex: child[cur]) res += dfs(nex, depth[cur] + K - 1);
        }
      } else {
        res = 1;
        for(auto nex: child[cur]) res += dfs(nex, depth[cur] + K - 1);
      }
      return res;
    };
    return dfs(0, K);
  }
 private:
  void build(const auto& G) {
    function<void(int, int)> dfs = [&](int cur, int pre) {
      for(auto nex: G[cur]) if(nex != pre) {
        child[cur].emplace_back(nex);
        depth[nex] = depth[cur] + 1;
        dfs(nex, cur);
      }
    };
    depth[0] = 0;
    dfs(0, 0);
  }
  vector<int> depth;
  vector<vector<int>> child;
};

int main() {
  int N, K;
  cin >> N >> K;
  vector<int> A(N);
  for(auto& i: A) cin >> i;

  int ans = 0;
  if(A[0] != 1) ++ans;
  Graph G(N);
  for(auto i=1; i<N; ++i) {
    auto u=i, v=A[i]-1;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  cout << ans + Tree(G).solve(K) << endl;
}