Submission #1838469

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N,K;
ll a[100005];
ll ans=0;

vector<int> G[100005];
ll height[100005];

void solve(int pos){
  height[pos]=0;
  for(int to:G[pos]){
    solve(to);
    height[pos]=max(height[pos],height[to]+1);
  }
  
  if(height[pos]+1==K && a[pos]!=0){
    ans++;
    a[pos]=0;
  }
  if(a[pos]==0){
    height[pos]=-1;
  }
}

int main(){
  cin>>N>>K;
  for(int i=0;i<N;i++){
    cin>>a[i];
    a[i]--;
  }
  if(a[0]>0)ans++;
  a[0]=0;

  for(int i=1;i<N;i++){
    G[ a[i] ].push_back(i);
  }
  solve(0);
  cout<< ans <<endl;
  return 0;
}

Submission Info

Judge Result