Submission #1355332

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int N,K;
vector<int> G[100001];
int ans = 0;
bool used[100001];

int dfs(int v,int prev) {
  int depth = 0;

  for(int i = 0; i < G[v].size(); i++) {
    int u = G[v][i];
    if(u != prev) {
      depth = max(depth,dfs(u,v));
    }
  }

  if(depth == K - 1 && prev != 0) {
    ans++;
    return 0;
  }
  return depth + 1;

}
    
int main() {
  cin >> N >> K;

  for(int i = 0; i < N; i++) {
    int a;
    cin >> a;
    if(i > 0) {
    a--;
    G[a].push_back(i);
    }
    else {
      if(i != a-1) ans++;
    }
  }

  dfs(0,0);

  cout << ans <<endl;
}

Submission Info

Judge Result