oj.uz

Submission #897706

# Submission time Handle Problem Language Result Execution time Memory
897706 2024-01-03T15:13:44 Z Alcabel Cat in a tree (BOI17_catinatree) C++17
100 / 100
 161 ms 40064 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 2e5;
vector<int> g[maxn];
int h[maxn];
set<pair<int, int>> ans[maxn];

void dfs(int v, int p, int d) {
    for (const int& u : g[v]) {
        if (u != p) {
            h[u] = h[v] + 1;
            dfs(u, v, d);
            if (!ans[v].empty() && !ans[u].empty() && ans[v].begin()->first + ans[u].begin()->first - 2 * h[v] < d) {
                // at least 1 to delete
                pair<int, int> mV = *ans[v].begin(), mU = *ans[u].begin();
                ans[v].erase(ans[v].begin());
                ans[u].erase(ans[u].begin());
                tuple<int, int, int> oneH = {-1, -1, -1};
                if (ans[v].empty() || ans[v].begin()->first + mU.first - 2 * h[v] >= d) {
                    oneH = max(oneH, make_tuple(mU.first, (!ans[v].empty() ? ans[v].begin()->first : -1), u));
                }
                if (ans[u].empty() || ans[u].begin()->first + mV.first - 2 * h[v] >= d) {
                    oneH = max(oneH, make_tuple(mV.first, (!ans[u].empty() ? ans[u].begin()->first : -1), v));
                }
                if (get<0>(oneH) != -1) {
                    if (get<2>(oneH) == v) {
                        ans[v].emplace(mV);
                    } else {
                        ans[u].emplace(mU);
                    }
                }
            }
            if ((int)ans[v].size() < (int)ans[u].size()) {
                ans[v].swap(ans[u]);
            }
            while (!ans[u].empty()) {
                ans[v].emplace(*ans[u].begin());
                ans[u].erase(ans[u].begin());
            }
        }
    }
    if (ans[v].empty() || ans[v].begin()->first >= h[v] + d) {
        ans[v].emplace(h[v], v);
    }
}

void solve() {
    int n, d;
    cin >> n >> d;
    for (int i = 1; i < n; ++i) {
        int p;
        cin >> p;
        g[p].emplace_back(i);
        g[i].emplace_back(p);
    }
    dfs(0, -1, d);
    cout << ans[0].size() << '\n';
    /*for (const pair<int, int>& v : ans[0]) {
        cout << v.second + 1 << ' ';
    }
    cout << '\n';*/
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
        cerr << "-----------\n";
        cout << "-----------\n";
    }
#else
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
#endif

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15328 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15248 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 4 ms 15332 KB Output is correct
10 Correct 3 ms 15196 KB Output is correct
11 Correct 3 ms 15196 KB Output is correct
12 Correct 3 ms 15196 KB Output is correct
13 Correct 3 ms 15196 KB Output is correct
14 Correct 3 ms 15196 KB Output is correct
15 Correct 3 ms 15300 KB Output is correct
16 Correct 3 ms 15196 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 3 ms 15328 KB Output is correct
19 Correct 3 ms 15192 KB Output is correct
20 Correct 4 ms 15196 KB Output is correct
21 Correct 3 ms 15448 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 4 ms 15452 KB Output is correct
24 Correct 4 ms 15196 KB Output is correct
25 Correct 4 ms 15196 KB Output is correct
26 Correct 4 ms 15196 KB Output is correct
27 Correct 3 ms 15196 KB Output is correct
28 Correct 3 ms 15196 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 3 ms 15208 KB Output is correct
31 Correct 3 ms 15196 KB Output is correct
32 Correct 3 ms 15196 KB Output is correct
33 Correct 3 ms 15196 KB Output is correct
34 Correct 4 ms 15196 KB Output is correct
35 Correct 4 ms 15196 KB Output is correct
36 Correct 4 ms 15196 KB Output is correct
37 Correct 4 ms 15196 KB Output is correct
38 Correct 4 ms 15196 KB Output is correct
39 Correct 4 ms 15232 KB Output is correct
40 Correct 4 ms 15452 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15196 KB Output is correct
2 Correct 3 ms 15196 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15328 KB Output is correct
5 Correct 3 ms 15196 KB Output is correct
6 Correct 3 ms 15196 KB Output is correct
7 Correct 3 ms 15248 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 4 ms 15332 KB Output is correct
10 Correct 3 ms 15196 KB Output is correct
11 Correct 3 ms 15196 KB Output is correct
12 Correct 3 ms 15196 KB Output is correct
13 Correct 3 ms 15196 KB Output is correct
14 Correct 3 ms 15196 KB Output is correct
15 Correct 3 ms 15300 KB Output is correct
16 Correct 3 ms 15196 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 3 ms 15328 KB Output is correct
19 Correct 3 ms 15192 KB Output is correct
20 Correct 4 ms 15196 KB Output is correct
21 Correct 3 ms 15448 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 4 ms 15452 KB Output is correct
24 Correct 4 ms 15196 KB Output is correct
25 Correct 4 ms 15196 KB Output is correct
26 Correct 4 ms 15196 KB Output is correct
27 Correct 3 ms 15196 KB Output is correct
28 Correct 3 ms 15196 KB Output is correct
29 Correct 4 ms 15196 KB Output is correct
30 Correct 3 ms 15208 KB Output is correct
31 Correct 3 ms 15196 KB Output is correct
32 Correct 3 ms 15196 KB Output is correct
33 Correct 3 ms 15196 KB Output is correct
34 Correct 4 ms 15196 KB Output is correct
35 Correct 4 ms 15196 KB Output is correct
36 Correct 4 ms 15196 KB Output is correct
37 Correct 4 ms 15196 KB Output is correct
38 Correct 4 ms 15196 KB Output is correct
39 Correct 4 ms 15232 KB Output is correct
40 Correct 4 ms 15452 KB Output is correct
41 Correct 47 ms 24784 KB Output is correct
42 Correct 87 ms 23636 KB Output is correct
43 Correct 28 ms 19032 KB Output is correct
44 Correct 36 ms 18920 KB Output is correct
45 Correct 27 ms 19032 KB Output is correct
46 Correct 161 ms 28468 KB Output is correct
47 Correct 91 ms 22864 KB Output is correct
48 Correct 78 ms 22868 KB Output is correct
49 Correct 67 ms 22868 KB Output is correct
50 Correct 31 ms 19388 KB Output is correct
51 Correct 25 ms 19364 KB Output is correct
52 Correct 23 ms 19292 KB Output is correct
53 Correct 72 ms 23412 KB Output is correct
54 Correct 77 ms 23376 KB Output is correct
55 Correct 62 ms 23388 KB Output is correct
56 Correct 3 ms 15452 KB Output is correct
57 Correct 8 ms 19476 KB Output is correct
58 Correct 31 ms 34392 KB Output is correct
59 Correct 66 ms 40064 KB Output is correct
60 Correct 45 ms 24352 KB Output is correct
61 Correct 47 ms 22472 KB Output is correct