oj.uz

Submission #870592

# Submission time Handle Problem Language Result Execution time Memory
870592 2023-11-08T12:44:03 Z sleepntsheep Cat in a tree (BOI17_catinatree) C++17
0 / 100
 2 ms 6492 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <cassert>

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,tune=native")



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, t[N];
vector<int> g[N];
array<int, 2> dp[N];

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 dfs(int u, int p, int dep)
{
    int base = 0;

    for (auto v : g[u]) if (v != p) dfs(v, u, dep+1), base += dp[v][0] - 1;


    vector<int> dm;
    for (auto v : g[u]) if (v != p) upd(dp[v][1], 1), dm.push_back(dp[v][1]);
    sort(ALL(dm));

    dp[u] = {base + 1 + qry(d + dep), dep};

    for (auto v : g[u]) if (v != p)
    {
        if (dp[v][1] < dep + (d+1)/2)
        {
            upd(dp[v][1], -1);
            dp[u] = max(dp[u], {base + 1 + qry(dep + max((d+1)/2, d - (dp[v][1] - dep))), dp[v][1]});
            upd(dp[v][1], 1);
        }
        else
        {
            int D = *lower_bound(ALL(dm), dep + (d+1)/2);
            dp[u] = max(dp[u], {base + 1 + qry(dep + max((d+1)/2, d - (dp[v][1] - dep))), D});
        }
    }

    for (auto v : g[u]) if (v != p) upd(dp[v][1], -1);
}

int main()
{
    ShinLena;
    cin >> n >> d;
    for (int i = 1, v; i < n; ++i) cin >> v, g[i].push_back(v), g[v].push_back(i);
    dfs(0, 0, 1);
    cout << dp[0][0];

    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -