oj.uz

Submission #869468

# Submission time Handle Problem Language Result Execution time Memory
869468 2023-11-04T12:01:40 Z wakandaaa Cat in a tree (BOI17_catinatree) C++17
100 / 100
 48 ms 21844 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 2e5 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, d;
vector<int> adj[N];

namespace greedy {

int h[N], f[N];

void dfs(int u, int p) {
    h[u] = oo;
    for (int v : adj[u]) if (v != p) {
        dfs(v, u);
        if (h[u] + h[v] + 1 >= d) {
            f[u] += f[v];
            mini(h[u], h[v] + 1);
        }
        else {
            f[u] += f[v] - 1;
            maxi(h[u], h[v] + 1);
        }
    }
    if (h[u] >= d) {
        f[u] += 1;
        h[u] = 0;
    }
}

void solve() {
    dfs(1, 0);

    cout << f[1];
}

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> d;
    for (int i = 2; i <= n; ++i) {
        int p;
        cin >> p;
        ++p;
        adj[i].push_back(p);
        adj[p].push_back(i);
    }

    greedy::solve();

    return 0;
}

/*

*/

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6544 KB Output is correct
5 Correct 3 ms 6536 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6488 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6544 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6532 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6488 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6488 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6540 KB Output is correct
38 Correct 2 ms 6548 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6544 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6488 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6544 KB Output is correct
5 Correct 3 ms 6536 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6488 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6544 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6532 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6488 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6488 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6540 KB Output is correct
38 Correct 2 ms 6548 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6544 KB Output is correct
41 Correct 28 ms 13784 KB Output is correct
42 Correct 18 ms 10332 KB Output is correct
43 Correct 19 ms 10328 KB Output is correct
44 Correct 18 ms 10332 KB Output is correct
45 Correct 18 ms 10328 KB Output is correct
46 Correct 48 ms 14164 KB Output is correct
47 Correct 41 ms 14172 KB Output is correct
48 Correct 40 ms 14236 KB Output is correct
49 Correct 40 ms 14164 KB Output is correct
50 Correct 13 ms 10584 KB Output is correct
51 Correct 12 ms 10596 KB Output is correct
52 Correct 12 ms 10588 KB Output is correct
53 Correct 27 ms 14672 KB Output is correct
54 Correct 32 ms 14684 KB Output is correct
55 Correct 28 ms 14676 KB Output is correct
56 Correct 2 ms 6492 KB Output is correct
57 Correct 5 ms 8792 KB Output is correct
58 Correct 20 ms 17304 KB Output is correct
59 Correct 45 ms 21844 KB Output is correct
60 Correct 29 ms 13776 KB Output is correct
61 Correct 33 ms 13660 KB Output is correct