제출 #870260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
870260		sleepntsheep	Cat in a tree (BOI17_catinatree)	C++17	0 / 100	1052 ms	2396 KiB

catinatree

#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using i64 = long long;
#define N 200005

int n, d, l[N], h[N], alloc = 1, dp[N][2], t[N];
pair<int, int> g[N<<1];

void upd(int p, int k) { for (; p ; p-=p&-p) t[p] += k; }
int qry(int p) { int z = 0; for (; p < N; p+=p&-p) z += t[p]; return z; }

void add_edge(int u, int v)
{
    int p = alloc++;
    g[p] = {v, h[u]};
    h[u] = p;
}

void dfs(int u, int p, int dep)
{
    l[u] = dep;
    int base = 0, lowest = 1e9;
    for (auto j = h[u]; j; j = g[j].second)
    {
        int v = g[j].first;
        if (v == p) continue;
        dfs(v, u, dep+1);
        base += dp[v][0] - 1;
        upd(dp[v][1], 1);
        lowest = min(lowest, dp[v][1]);
    }
    dp[u][0] = base, dp[u][1] = lowest;

    {
        int sel = base + 1 + qry(d + dep);
        if (dp[u][0] < sel)
        {
            dp[u][0] = sel;
            dp[u][1] = dep;
        }
        else if (dp[u][0] == sel && dep > dp[u][1])
        {
            dp[u][1] = dep;
        }
    }

    for (auto j = h[u]; j; j = g[j].second)
    {
        int v = g[j].first;
        if (v == p) continue;
        upd(dp[v][1], -1);
        int sel = base + 1 + qry(d - (dp[v][1] - dep) + dep);
        upd(dp[v][1], 1);
        if (dp[u][0] < sel)
        {
            dp[u][0] = sel;
            dp[u][1] = dp[v][1];
        }
        else if (dp[u][0] == sel && dp[v][1] > dp[u][1])
        {
            dp[u][1] = dp[v][1];
        }
    }

    for (auto j = h[u]; j; j = g[j].second)
    {
        int v = g[j].first;
        if (v == p) continue;
        upd(dp[v][1], -1);
    }
}

int main()
{
    ShinLena;
    cin >> n >> d;
    for (int i = 1, v; i < n; ++i) cin >> v, add_edge(i, v), add_edge(v, i);
    dfs(0, 0, 1);
    for (int i = 0; i < n; ++i)
    {
    //    cerr << dp[i][0] << ' '<< dp[i][1]<<endl;
    }
    cout << dp[0][0];

    return 0;
}

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