oj.uz

Submission #870591

# Submission time Handle Problem Language Result Execution time Memory
870591 2023-11-08T12:43:06 Z sleepntsheep Cat in a tree (BOI17_catinatree) C++17
100 / 100
 104 ms 55636 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, 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)
    {
        upd(dp[v][1], -1);
        if (dp[v][1] < dep + (d+1)/2)
            dp[u] = max(dp[u], {base + 1 + qry(dep + max((d+1)/2, d - (dp[v][1] - dep))), dp[v][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});
        }
        upd(dp[v][1], 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 6 ms 26972 KB Output is correct
3 Correct 7 ms 27088 KB Output is correct
4 Correct 5 ms 26972 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 5 ms 26968 KB Output is correct
7 Correct 5 ms 26972 KB Output is correct
8 Correct 6 ms 26972 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 5 ms 26972 KB Output is correct
11 Correct 6 ms 27088 KB Output is correct
12 Correct 5 ms 26968 KB Output is correct
13 Correct 5 ms 26972 KB Output is correct
14 Correct 6 ms 27148 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 27140 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 6 ms 26972 KB Output is correct
3 Correct 7 ms 27088 KB Output is correct
4 Correct 5 ms 26972 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 5 ms 26968 KB Output is correct
7 Correct 5 ms 26972 KB Output is correct
8 Correct 6 ms 26972 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 5 ms 26972 KB Output is correct
11 Correct 6 ms 27088 KB Output is correct
12 Correct 5 ms 26968 KB Output is correct
13 Correct 5 ms 26972 KB Output is correct
14 Correct 6 ms 27148 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 27140 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 27484 KB Output is correct
22 Correct 5 ms 27224 KB Output is correct
23 Correct 5 ms 26968 KB Output is correct
24 Correct 6 ms 26972 KB Output is correct
25 Correct 6 ms 26972 KB Output is correct
26 Correct 6 ms 26972 KB Output is correct
27 Correct 6 ms 27076 KB Output is correct
28 Correct 6 ms 26972 KB Output is correct
29 Correct 6 ms 27088 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 7 ms 26968 KB Output is correct
32 Correct 6 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 7 ms 26972 KB Output is correct
35 Correct 6 ms 26968 KB Output is correct
36 Correct 6 ms 26972 KB Output is correct
37 Correct 6 ms 27228 KB Output is correct
38 Correct 6 ms 27228 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27484 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 26972 KB Output is correct
2 Correct 6 ms 26972 KB Output is correct
3 Correct 7 ms 27088 KB Output is correct
4 Correct 5 ms 26972 KB Output is correct
5 Correct 5 ms 26972 KB Output is correct
6 Correct 5 ms 26968 KB Output is correct
7 Correct 5 ms 26972 KB Output is correct
8 Correct 6 ms 26972 KB Output is correct
9 Correct 5 ms 26972 KB Output is correct
10 Correct 5 ms 26972 KB Output is correct
11 Correct 6 ms 27088 KB Output is correct
12 Correct 5 ms 26968 KB Output is correct
13 Correct 5 ms 26972 KB Output is correct
14 Correct 6 ms 27148 KB Output is correct
15 Correct 5 ms 26972 KB Output is correct
16 Correct 5 ms 26968 KB Output is correct
17 Correct 5 ms 27140 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 27484 KB Output is correct
22 Correct 5 ms 27224 KB Output is correct
23 Correct 5 ms 26968 KB Output is correct
24 Correct 6 ms 26972 KB Output is correct
25 Correct 6 ms 26972 KB Output is correct
26 Correct 6 ms 26972 KB Output is correct
27 Correct 6 ms 27076 KB Output is correct
28 Correct 6 ms 26972 KB Output is correct
29 Correct 6 ms 27088 KB Output is correct
30 Correct 6 ms 26972 KB Output is correct
31 Correct 7 ms 26968 KB Output is correct
32 Correct 6 ms 26972 KB Output is correct
33 Correct 6 ms 26972 KB Output is correct
34 Correct 7 ms 26972 KB Output is correct
35 Correct 6 ms 26968 KB Output is correct
36 Correct 6 ms 26972 KB Output is correct
37 Correct 6 ms 27228 KB Output is correct
38 Correct 6 ms 27228 KB Output is correct
39 Correct 6 ms 27228 KB Output is correct
40 Correct 6 ms 27484 KB Output is correct
41 Correct 54 ms 36988 KB Output is correct
42 Correct 35 ms 33372 KB Output is correct
43 Correct 36 ms 33124 KB Output is correct
44 Correct 37 ms 33124 KB Output is correct
45 Correct 36 ms 33120 KB Output is correct
46 Correct 65 ms 36956 KB Output is correct
47 Correct 78 ms 36900 KB Output is correct
48 Correct 104 ms 36856 KB Output is correct
49 Correct 70 ms 36952 KB Output is correct
50 Correct 24 ms 33372 KB Output is correct
51 Correct 25 ms 33372 KB Output is correct
52 Correct 24 ms 33240 KB Output is correct
53 Correct 54 ms 37336 KB Output is correct
54 Correct 49 ms 37200 KB Output is correct
55 Correct 54 ms 37256 KB Output is correct
56 Correct 6 ms 27224 KB Output is correct
57 Correct 13 ms 31836 KB Output is correct
58 Correct 41 ms 50004 KB Output is correct
59 Correct 84 ms 55636 KB Output is correct
60 Correct 52 ms 37068 KB Output is correct
61 Correct 61 ms 36480 KB Output is correct