Submission #1514226

---

Source Code Expand

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

constexpr int INF = 1e9;

using graph = vector<vector<int>>;

int N, K;

void dfs(int v, graph const& g, vector<int>& d, int depth, int& res) {
    res += depth > K;
    if(depth > K) {
        depth = 1;
    }
    d[v] = depth;
    for(auto to : g[v]) {
        dfs(to, g, d, depth + 1, res);
    }
}

int main() {
    cin >> N >> K;
    graph g(N);
    int res = 0;
    int s_to;
    for(int i = 0; i < N; ++i) {
        int a;
        cin >> a;
        a--;
        if(i == 0) {
            res += a != 0;
            s_to = a;
        } else {
            g[a].push_back(i);
        }
    }
    vector<int> d(N);
    dfs(0, g, d, 0, res);
    cout << res << endl;
}

Submission Info

Judge Result