Submission #867888

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vii;
typedef vector<ll> vll;

#define X first
#define Y second
#define rep(i,n) for(ll i=0; i<(n); i++)
#define repp(i,ed,b) for(ll i=ed; i<=(b); i++)
#define repp2(i,b,ed) for(ll i=b; i>=(ed); i--)
#define fill(ed,val) memset(ed, (val), sizeof(ed))
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define uni(c) c.resize(distance(c.begin(), unique(all(c))))
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define IO(input_file_name) ifstream cin(input_file_name);ofstream cout("output.txt")
#define sc(n) scanf("%lld",&n)

ll mod= 1e9 + 7, mod1=1e9+9;
const ll N=100005;
ll in=0;
ll an=0;
ll n,k;
ll par[N];
vii ed[N];
ll solve(ll in, ll h){
    
    ll tmp=0;
    for(auto x:ed[in]){
        tmp=max(tmp,1+solve(x,h+1));
    }
    if(tmp==k-1 && par[in]!=1){an++,tmp=-1;}
    return tmp;
}

int main()
{   
    io;
    
    
    cin>>n>>k;
    rep(i,n){
        ll x;
        cin>>x;
        if(i==0){in=x;continue;}
        ed[x].pb(i+1);
        par[i+1]=x;
    }
    
    par[1]=1;
    if(in!=1)an++;
    
    solve(1,0);
    cout<<an;
    return 0;
}

Submission Info

Judge Result