oj.uz

Submission #932568

# Submission time Handle Problem Language Result Execution time Memory
932568 2024-02-23T15:57:21 Z LOLOLO Cat in a tree (BOI17_catinatree) C++17
100 / 100
 270 ms 250816 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 2e5 + 10;
deque <int> dq[N];
int d;
vector <int> ed[N];
 
void merge(deque <int> &a, deque <int> &b) {
    for (int i = 0; i < sz(a); i++) {
        int x = 0, y = 0;
        if (d - i < sz(b) && d >= i)
            x = a[i] + b[max(d - i, i)];    

        if (d - i < sz(a) && d >= i) 
            y = b[i] + a[max(d - i, i)];

        b[i] = max({b[i], x, y});     
    }

    for (int i = 0; i < sz(a); i++)
        b[i] = max(b[i], a[i]);
 
    for (int i = sz(a) - 2; i >= 0; i--)
        b[i] = max(b[i], b[i + 1]);
}
 
void dfs(int u, int v) {
    dq[u].push_back(1);
    for (auto x : ed[u]) {
        if (x == v)
            continue;

        dfs(x, u);
        dq[x].push_front(dq[x][0]);
        if (sz(dq[u]) < sz(dq[x])) {
            swap(dq[u], dq[x]);
        }
 
        merge(dq[x], dq[u]);
    }
}
 
ll solve() {
    int n;
    cin >> n >> d;
    for (int i = 1; i < n; i++) {
        int x;
        cin >> x;
        ed[x].pb(i);
        ed[i].pb(x);
    }
 
    dfs(0, 0);
 
    return dq[0][0];
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        //solve();
        cout << solve() << '\n';
    }
 
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 139600 KB Output is correct
2 Correct 69 ms 139564 KB Output is correct
3 Correct 68 ms 139624 KB Output is correct
4 Correct 71 ms 139596 KB Output is correct
5 Correct 70 ms 139600 KB Output is correct
6 Correct 68 ms 139780 KB Output is correct
7 Correct 72 ms 139600 KB Output is correct
8 Correct 69 ms 139608 KB Output is correct
9 Correct 68 ms 139604 KB Output is correct
10 Correct 70 ms 139672 KB Output is correct
11 Correct 69 ms 139784 KB Output is correct
12 Correct 69 ms 139600 KB Output is correct
13 Correct 70 ms 139820 KB Output is correct
14 Correct 69 ms 139604 KB Output is correct
15 Correct 68 ms 139600 KB Output is correct
16 Correct 68 ms 139656 KB Output is correct
17 Correct 70 ms 139576 KB Output is correct
18 Correct 68 ms 139604 KB Output is correct
19 Correct 70 ms 139600 KB Output is correct
20 Correct 71 ms 139536 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 139600 KB Output is correct
2 Correct 69 ms 139564 KB Output is correct
3 Correct 68 ms 139624 KB Output is correct
4 Correct 71 ms 139596 KB Output is correct
5 Correct 70 ms 139600 KB Output is correct
6 Correct 68 ms 139780 KB Output is correct
7 Correct 72 ms 139600 KB Output is correct
8 Correct 69 ms 139608 KB Output is correct
9 Correct 68 ms 139604 KB Output is correct
10 Correct 70 ms 139672 KB Output is correct
11 Correct 69 ms 139784 KB Output is correct
12 Correct 69 ms 139600 KB Output is correct
13 Correct 70 ms 139820 KB Output is correct
14 Correct 69 ms 139604 KB Output is correct
15 Correct 68 ms 139600 KB Output is correct
16 Correct 68 ms 139656 KB Output is correct
17 Correct 70 ms 139576 KB Output is correct
18 Correct 68 ms 139604 KB Output is correct
19 Correct 70 ms 139600 KB Output is correct
20 Correct 71 ms 139536 KB Output is correct
21 Correct 78 ms 139744 KB Output is correct
22 Correct 82 ms 139860 KB Output is correct
23 Correct 77 ms 139860 KB Output is correct
24 Correct 75 ms 139920 KB Output is correct
25 Correct 76 ms 139856 KB Output is correct
26 Correct 77 ms 140060 KB Output is correct
27 Correct 76 ms 139928 KB Output is correct
28 Correct 76 ms 140224 KB Output is correct
29 Correct 80 ms 140204 KB Output is correct
30 Correct 78 ms 140112 KB Output is correct
31 Correct 77 ms 140116 KB Output is correct
32 Correct 79 ms 140364 KB Output is correct
33 Correct 77 ms 140392 KB Output is correct
34 Correct 81 ms 140372 KB Output is correct
35 Correct 76 ms 140260 KB Output is correct
36 Correct 81 ms 140572 KB Output is correct
37 Correct 80 ms 140368 KB Output is correct
38 Correct 77 ms 140336 KB Output is correct
39 Correct 76 ms 140292 KB Output is correct
40 Correct 81 ms 139788 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 139600 KB Output is correct
2 Correct 69 ms 139564 KB Output is correct
3 Correct 68 ms 139624 KB Output is correct
4 Correct 71 ms 139596 KB Output is correct
5 Correct 70 ms 139600 KB Output is correct
6 Correct 68 ms 139780 KB Output is correct
7 Correct 72 ms 139600 KB Output is correct
8 Correct 69 ms 139608 KB Output is correct
9 Correct 68 ms 139604 KB Output is correct
10 Correct 70 ms 139672 KB Output is correct
11 Correct 69 ms 139784 KB Output is correct
12 Correct 69 ms 139600 KB Output is correct
13 Correct 70 ms 139820 KB Output is correct
14 Correct 69 ms 139604 KB Output is correct
15 Correct 68 ms 139600 KB Output is correct
16 Correct 68 ms 139656 KB Output is correct
17 Correct 70 ms 139576 KB Output is correct
18 Correct 68 ms 139604 KB Output is correct
19 Correct 70 ms 139600 KB Output is correct
20 Correct 71 ms 139536 KB Output is correct
21 Correct 78 ms 139744 KB Output is correct
22 Correct 82 ms 139860 KB Output is correct
23 Correct 77 ms 139860 KB Output is correct
24 Correct 75 ms 139920 KB Output is correct
25 Correct 76 ms 139856 KB Output is correct
26 Correct 77 ms 140060 KB Output is correct
27 Correct 76 ms 139928 KB Output is correct
28 Correct 76 ms 140224 KB Output is correct
29 Correct 80 ms 140204 KB Output is correct
30 Correct 78 ms 140112 KB Output is correct
31 Correct 77 ms 140116 KB Output is correct
32 Correct 79 ms 140364 KB Output is correct
33 Correct 77 ms 140392 KB Output is correct
34 Correct 81 ms 140372 KB Output is correct
35 Correct 76 ms 140260 KB Output is correct
36 Correct 81 ms 140572 KB Output is correct
37 Correct 80 ms 140368 KB Output is correct
38 Correct 77 ms 140336 KB Output is correct
39 Correct 76 ms 140292 KB Output is correct
40 Correct 81 ms 139788 KB Output is correct
41 Correct 190 ms 185572 KB Output is correct
42 Correct 159 ms 169300 KB Output is correct
43 Correct 160 ms 169296 KB Output is correct
44 Correct 163 ms 169352 KB Output is correct
45 Correct 159 ms 169296 KB Output is correct
46 Correct 264 ms 199160 KB Output is correct
47 Correct 270 ms 198892 KB Output is correct
48 Correct 269 ms 199132 KB Output is correct
49 Correct 268 ms 199148 KB Output is correct
50 Correct 149 ms 194896 KB Output is correct
51 Correct 153 ms 194888 KB Output is correct
52 Correct 150 ms 194900 KB Output is correct
53 Correct 249 ms 250816 KB Output is correct
54 Correct 244 ms 250752 KB Output is correct
55 Correct 236 ms 250556 KB Output is correct
56 Correct 78 ms 140628 KB Output is correct
57 Correct 85 ms 143424 KB Output is correct
58 Correct 109 ms 158804 KB Output is correct
59 Correct 222 ms 210348 KB Output is correct
60 Correct 168 ms 180244 KB Output is correct
61 Correct 195 ms 179788 KB Output is correct