Submission #866202

---

Source Code Expand

// In the name of God

#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <deque>
#include <assert.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <math.h>
#include <bitset>
#include <iomanip>

using namespace std;

#define rep(i, n) for (int i = 0, _n = (int)(n); i < _n; ++i)
const int N = (int) 1e6 + 6, mod = 0;

int h[N], res, k, n, d[N];
vector<int> adj[N];

void dfs(int v) {
    for (int u : adj[v]) {
        d[u] = d[v] + 1;
        dfs(u);
//        cout << " hi " << v << " - > " << u << endl;
        h[v] = max(h[u] + 1, h[v]);
    }
//    cout << v << ' ' << d[v] << ' ' << h[v] << ' ' << k << endl;

    if (v != 0 && d[v] > 1 && (h[v] % k) == k - 1) {
        res++;
        h[v] = 0;
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x; --x;
        if (i > 0) {
            adj[x].push_back(i);
            if (k == 1) res += (x != 0);
        } else {
            res += (x != 0);
        }
    }
    if (k == 1) {
        cout << res << '\n';
        return 0;
    }
    dfs(0);
    cout << res << '\n';
}

Submission Info

Judge Result