oj.uz

Submission #870364

# Submission time Handle Problem Language Result Execution time Memory
870364 2023-11-07T13:34:42 Z sleepntsheep Cat in a tree (BOI17_catinatree) C++17
51 / 100
 44 ms 35280 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 (1<<20)

int n, d, h[N], t[N];
vector<int> g[N];
array<int, 2> dp[N];

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; p+=p&-p) z += t[p]; return z; }

void dfs(int u, int p, int dep)
{
    int base = 0, safe = (d+1)/2, sel;

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

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

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

    for (auto v : g[u]) if (v != p)
    {
        int delta = dp[v][1] - dep;
        upd(dp[v][1], -1);
        sel = base + 1 + qry(dep + max(safe, d - delta));
        upd(dp[v][1], 1);
        dp[u] = max(dp[u], {sel, dp[v][1]});
    }

    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
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 6 ms 26968 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 6 ms 27144 KB Output is correct
7 Correct 5 ms 26972 KB Output is correct
8 Correct 5 ms 26972 KB Output is correct
9 Correct 5 ms 26968 KB Output is correct
10 Correct 5 ms 26972 KB Output is correct
11 Correct 5 ms 26972 KB Output is correct
12 Correct 5 ms 26972 KB Output is correct
13 Correct 5 ms 26972 KB Output is correct
14 Correct 5 ms 26972 KB Output is correct
15 Correct 6 ms 27140 KB Output is correct
16 Correct 5 ms 26972 KB Output is correct
17 Correct 5 ms 27144 KB Output is correct
18 Correct 5 ms 26968 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 5 ms 26972 KB Output is correct
21 Correct 6 ms 27228 KB Output is correct
22 Correct 6 ms 27104 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 7 ms 27328 KB Output is correct
25 Correct 6 ms 26972 KB Output is correct
26 Correct 6 ms 26968 KB Output is correct
27 Correct 6 ms 27060 KB Output is correct
28 Correct 6 ms 26972 KB Output is correct
29 Correct 6 ms 27204 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 27100 KB Output is correct
32 Correct 6 ms 26972 KB Output is correct
33 Correct 6 ms 27220 KB Output is correct
34 Correct 6 ms 26972 KB Output is correct
35 Correct 6 ms 27072 KB Output is correct
36 Correct 6 ms 26972 KB Output is correct
37 Correct 6 ms 27104 KB Output is correct
38 Correct 6 ms 27240 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27312 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 5 ms 26972 KB Output is correct
3 Correct 6 ms 27072 KB Output is correct
4 Correct 6 ms 26968 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 6 ms 27144 KB Output is correct
7 Correct 5 ms 26972 KB Output is correct
8 Correct 5 ms 26972 KB Output is correct
9 Correct 5 ms 26968 KB Output is correct
10 Correct 5 ms 26972 KB Output is correct
11 Correct 5 ms 26972 KB Output is correct
12 Correct 5 ms 26972 KB Output is correct
13 Correct 5 ms 26972 KB Output is correct
14 Correct 5 ms 26972 KB Output is correct
15 Correct 6 ms 27140 KB Output is correct
16 Correct 5 ms 26972 KB Output is correct
17 Correct 5 ms 27144 KB Output is correct
18 Correct 5 ms 26968 KB Output is correct
19 Correct 5 ms 26972 KB Output is correct
20 Correct 5 ms 26972 KB Output is correct
21 Correct 6 ms 27228 KB Output is correct
22 Correct 6 ms 27104 KB Output is correct
23 Correct 6 ms 26972 KB Output is correct
24 Correct 7 ms 27328 KB Output is correct
25 Correct 6 ms 26972 KB Output is correct
26 Correct 6 ms 26968 KB Output is correct
27 Correct 6 ms 27060 KB Output is correct
28 Correct 6 ms 26972 KB Output is correct
29 Correct 6 ms 27204 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 6 ms 27100 KB Output is correct
32 Correct 6 ms 26972 KB Output is correct
33 Correct 6 ms 27220 KB Output is correct
34 Correct 6 ms 26972 KB Output is correct
35 Correct 6 ms 27072 KB Output is correct
36 Correct 6 ms 26972 KB Output is correct
37 Correct 6 ms 27104 KB Output is correct
38 Correct 6 ms 27240 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27312 KB Output is correct
41 Correct 44 ms 35280 KB Output is correct
42 Correct 28 ms 32612 KB Output is correct
43 Incorrect 32 ms 32856 KB Output isn't correct
44 Halted 0 ms 0 KB -