oj.uz

Submission #391338

# Submission time Handle Problem Language Result Execution time Memory
391338 2021-04-18T15:21:43 Z Victor Cat in a tree (BOI17_catinatree) C++17
51 / 100
 80 ms 18368 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;

vi graph[200001];
int d, x;
map<int, int> memo[200001];

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

void dp(int u, int depth) {
    map<int, int>& curr = memo[u];
    curr.emplace(depth, 1);

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

        map<int, int>& prev = memo[v];
        if (sz(curr) < sz(prev)) swap(curr, prev);
        auto next = curr;

        trav(item, prev) {
            int dep, val;
            tie(dep, val) = item;

            auto it = curr.lower_bound(depth * 2 + d - dep);

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

        trav(item, prev) {
            int dep, val;
            tie(dep, val) = item;
            add(next, dep, val);
        }

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

}

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

    int n, p;
    cin >> n >> d;
    d = min(d, n);

    rep(i, 1, n) {
        cin >> p;
        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 10 ms 14284 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14336 KB Output is correct
5 Correct 10 ms 14284 KB Output is correct
6 Correct 10 ms 14480 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 9 ms 14380 KB Output is correct
9 Correct 9 ms 14352 KB Output is correct
10 Correct 10 ms 14412 KB Output is correct
11 Correct 9 ms 14404 KB Output is correct
12 Correct 10 ms 14412 KB Output is correct
13 Correct 9 ms 14412 KB Output is correct
14 Correct 11 ms 14356 KB Output is correct
15 Correct 9 ms 14408 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 9 ms 14400 KB Output is correct
18 Correct 9 ms 14404 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14392 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14336 KB Output is correct
5 Correct 10 ms 14284 KB Output is correct
6 Correct 10 ms 14480 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 9 ms 14380 KB Output is correct
9 Correct 9 ms 14352 KB Output is correct
10 Correct 10 ms 14412 KB Output is correct
11 Correct 9 ms 14404 KB Output is correct
12 Correct 10 ms 14412 KB Output is correct
13 Correct 9 ms 14412 KB Output is correct
14 Correct 11 ms 14356 KB Output is correct
15 Correct 9 ms 14408 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 9 ms 14400 KB Output is correct
18 Correct 9 ms 14404 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14392 KB Output is correct
21 Correct 10 ms 14740 KB Output is correct
22 Correct 10 ms 14408 KB Output is correct
23 Correct 9 ms 14412 KB Output is correct
24 Correct 10 ms 14316 KB Output is correct
25 Correct 10 ms 14408 KB Output is correct
26 Correct 10 ms 14408 KB Output is correct
27 Correct 10 ms 14412 KB Output is correct
28 Correct 10 ms 14412 KB Output is correct
29 Correct 10 ms 14412 KB Output is correct
30 Correct 10 ms 14412 KB Output is correct
31 Correct 10 ms 14412 KB Output is correct
32 Correct 10 ms 14408 KB Output is correct
33 Correct 10 ms 14416 KB Output is correct
34 Correct 10 ms 14412 KB Output is correct
35 Correct 10 ms 14412 KB Output is correct
36 Correct 10 ms 14412 KB Output is correct
37 Correct 11 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 10 ms 14540 KB Output is correct
40 Correct 18 ms 14796 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14284 KB Output is correct
2 Correct 9 ms 14284 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14336 KB Output is correct
5 Correct 10 ms 14284 KB Output is correct
6 Correct 10 ms 14480 KB Output is correct
7 Correct 9 ms 14408 KB Output is correct
8 Correct 9 ms 14380 KB Output is correct
9 Correct 9 ms 14352 KB Output is correct
10 Correct 10 ms 14412 KB Output is correct
11 Correct 9 ms 14404 KB Output is correct
12 Correct 10 ms 14412 KB Output is correct
13 Correct 9 ms 14412 KB Output is correct
14 Correct 11 ms 14356 KB Output is correct
15 Correct 9 ms 14408 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 9 ms 14400 KB Output is correct
18 Correct 9 ms 14404 KB Output is correct
19 Correct 9 ms 14412 KB Output is correct
20 Correct 10 ms 14392 KB Output is correct
21 Correct 10 ms 14740 KB Output is correct
22 Correct 10 ms 14408 KB Output is correct
23 Correct 9 ms 14412 KB Output is correct
24 Correct 10 ms 14316 KB Output is correct
25 Correct 10 ms 14408 KB Output is correct
26 Correct 10 ms 14408 KB Output is correct
27 Correct 10 ms 14412 KB Output is correct
28 Correct 10 ms 14412 KB Output is correct
29 Correct 10 ms 14412 KB Output is correct
30 Correct 10 ms 14412 KB Output is correct
31 Correct 10 ms 14412 KB Output is correct
32 Correct 10 ms 14408 KB Output is correct
33 Correct 10 ms 14416 KB Output is correct
34 Correct 10 ms 14412 KB Output is correct
35 Correct 10 ms 14412 KB Output is correct
36 Correct 10 ms 14412 KB Output is correct
37 Correct 11 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 10 ms 14540 KB Output is correct
40 Correct 18 ms 14796 KB Output is correct
41 Correct 80 ms 18368 KB Output is correct
42 Correct 76 ms 16184 KB Output is correct
43 Incorrect 54 ms 16196 KB Output isn't correct
44 Halted 0 ms 0 KB -