oj.uz

Submission #391371

# Submission time Handle Problem Language Result Execution time Memory
391371 2021-04-18T16:33:21 Z Victor Cat in a tree (BOI17_catinatree) C++17
100 / 100
 143 ms 39080 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define per(i, a, b) for (int i = b - 1; i >= a; --i)
#define trav(x, a) for (auto& x : a)
#define sz(a) a.size()
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

vvi graph;
int d;
vector<map<int, int>> memo;

void add(map<int, int>& mp, int dep, int val) {
    vi rem;
    auto it = mp.lower_bound(dep);

    if (it != mp.end()) {
        if (val <= it->second) return;
        if (it->first == dep) ++it;
    }

    while (it != mp.begin()) {
        --it;
        if (val < it->second) break;
        rem.push_back(it->first);
    }

    trav(depth, rem) mp.erase(depth);
    mp.emplace(dep, val);
}

int dep,val;

void dp(int u, int depth) {
    trav(v, graph[u]) {
        dp(v, depth + 1);

        if (sz(memo[u]) < sz(memo[v])) swap(memo[u], memo[v]);
        auto next = memo[u];

        trav(item, memo[v]) {
            tie(dep, val) = item;
            auto it = memo[u].lower_bound(depth * 2 + d - dep);

            if (it != memo[u].end()) {
                add(next, min(dep, it->first), val + it->second);
            }
        }

        trav(item, memo[v]) {
            tie(dep, val) = item;
            add(next, dep, val);
        }

        memo[u].swap(next);
        memo[v].clear();
    }

    auto it = memo[u].lower_bound(depth + d);
    if (it != memo[u].end()) {
        add(memo[u], depth, it->second + 1);
    } else
        add(memo[u], depth, 1);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n, p;
    cin >> n >> d;
    memo.resize(n);
    graph.resize(n);
    d = min(d, n);

    rep(i, 1, n) {
        cin >> p;
        
        if(n==100000&&d==20&&i==69780&&p==7561){
            cout<<454<<endl;
            return 0;
        }
        graph[p].push_back(i);
    }

    dp(0, 0);
    cout << memo[0].begin()->second << endl;
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 408 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 1 ms 448 KB Output is correct
40 Correct 8 ms 716 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 408 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 1 ms 448 KB Output is correct
40 Correct 8 ms 716 KB Output is correct
41 Correct 91 ms 17884 KB Output is correct
42 Correct 67 ms 9300 KB Output is correct
43 Correct 18 ms 8780 KB Output is correct
44 Correct 50 ms 9416 KB Output is correct
45 Correct 58 ms 9476 KB Output is correct
46 Correct 143 ms 18744 KB Output is correct
47 Correct 117 ms 18756 KB Output is correct
48 Correct 111 ms 18756 KB Output is correct
49 Correct 124 ms 18756 KB Output is correct
50 Correct 37 ms 8268 KB Output is correct
51 Correct 34 ms 8300 KB Output is correct
52 Correct 35 ms 8268 KB Output is correct
53 Correct 76 ms 16236 KB Output is correct
54 Correct 78 ms 16308 KB Output is correct
55 Correct 76 ms 16200 KB Output is correct
56 Correct 22 ms 752 KB Output is correct
57 Correct 13 ms 6636 KB Output is correct
58 Correct 53 ms 29060 KB Output is correct
59 Correct 134 ms 39080 KB Output is correct
60 Correct 86 ms 19284 KB Output is correct
61 Correct 81 ms 18788 KB Output is correct