Submission #1249345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249345		chikien2009	Cat in a tree (BOI17_catinatree)	C++20	100 / 100	33 ms	12104 KiB

catinatree

#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, d, a, f[200000];
vector<int> g[200000];

inline int DFS(int node, int par)
{
    int cur = 1e9, temp;
    f[node] = 0;
    for (auto &i : g[node])
    {
        temp = DFS(i, node);
        temp++;
        if (d <= temp + cur)
        {
            f[node] += f[i];
            cur = min(cur, temp);
        }
        else
        {
            f[node] += f[i] - 1;
            cur = max(cur, temp);
        }
    }
    f[node] += (d <= cur);
    cur = (d <= cur ? 0 : cur);
    return cur;
}

int main()
{
    setup();

    cin >> n >> d;
    for (int i = 1; i < n; ++i)
    {
        cin >> a;
        g[a].push_back(i);
    }
    DFS(0, 0);
    cout << f[0];
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 40 / 40
• Subtask 3: 49 / 49