oj.uz

Submission #870321

# Submission time Handle Problem Language Result Execution time Memory
870321 2023-11-07T12:45:32 Z sleepntsheep Cat in a tree (BOI17_catinatree) C++17
51 / 100
 29 ms 7700 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <cassert>

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 200860

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) { p += 100;for (; p ; p-=p&-p) t[p] += k; }
int qry(int p) { p += 100; int z = 0; for (; p < (N<<1); p+=p&-p) z += t[p]; return z; }

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

void dfs(int u, int p, int dep)
{
    l[u] = dep;
    int base = 0;

    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;
    }

    vector<int> depmap;
    for (auto j = h[u]; j; j = g[j].second)
        if (g[j].first != p) 
            upd(dp[g[j].first][1], 1), depmap.emplace_back(dp[g[j].first][1]);
    sort(ALL(depmap));

    {
        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;
        int delta = dp[v][1] - dep;
        assert(delta <= d);
        int safe = (d+1)/2, sel;
        int subdep = dp[v][1];
        if (delta >= safe)
        {
            sel = base + qry(dep + safe);
            auto it = lower_bound(ALL(depmap), dep+safe);
            subdep = *it;
        }
        else
        {
            upd(dp[g[j].first][1], -1);
            sel = base + 1 + qry(dep + (d - delta));
            upd(dp[g[j].first][1], 1);
        }
        if (dp[u][0] < sel) dp[u][0] = sel, dp[u][1] = subdep;
        else if (dp[u][0] == sel && subdep > dp[u][1]) dp[u][1] = subdep;
    }

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

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

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 500 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 356 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 500 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 356 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Incorrect 29 ms 7700 KB Output isn't correct
42 Halted 0 ms 0 KB -