oj.uz

Submission #631058

# Submission time Handle Problem Language Result Execution time Memory
631058 2022-08-17T15:56:29 Z Dorost Cat in a tree (BOI17_catinatree) C++17
100 / 100
 567 ms 172952 KB 
/* In the name of GOD */
 
#include <bits/stdc++.h>

#define S second
#define F first
using namespace std;
const int N = 200000, K = 205;
vector <int> g[N];
int h[N];
bool is[N];
int dp[N][K];
int s[K];
int n, d;
int t = 0;

void dfs(int v, int p = -1) {
    if (h[v] < d)
        is[v] = false;
    for (int u : g[v]) 
        if (u != p) {
            h[u] = h[v] + 1;
            dfs(u, v); 
        }
}

void dfs2(int v, int p = -1) {
    for (int u : g[v]) 
        if (u != p) {
            dfs2(u, v); 
        }
    for (int i = 0; i < K; i++)
        s[i] = 0;
    for (int u : g[v]) 
        if (u != p)  
            for (int i = 0; i < K; i++)
                s[i] += dp[u][i];
    for (int i = K - 1; i >= 1; i--) {
        if (i != K - 1)  
            dp[v][i] = dp[v][i + 1]; 
        for (int u : g[v]) 
            if (u != p) {
                int h = i - 1;
                dp[v][i] = max(dp[v][i], s[max(d - h - 2, h)] - dp[u][max(d - h - 2, h)] + dp[u][h]);
            }
    }   
    dp[v][0] = max(dp[v][1], 1 + dp[v][d]);
}

int32_t main() {
    cin >> n >> d;
    if (d <= 1) {
        cout << n << '\n';
        return 0;
    }   
    for (int i = 1; i < n; i++) {
        int p;
        cin >> p;
        g[p].push_back(i);
        g[i].push_back(p);
    }   
    if (d < K) {
        dfs2(0);
        cout << dp[0][0] << '\n';
        return 0;
    }   
    int ans = 0;
    vector <pair <int, int>> v;
    dfs(0);
    for (int i = 0; i < n; i++)
        is[i] = true;
    for (int i = 0; i < n; i++) {
        v.push_back(make_pair(h[i], i));
    }   
    sort(v.begin(), v.end());
    while (!v.empty()) {
        pair <int, int> p = v.back();
        v.pop_back();
        if (is[p.S]) {
            t++;
            ans++;
            h[p.S] = 0;
            dfs(p.S);
        }
    }   
    cout << ans << '\n';
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5000 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5004 KB Output is correct
15 Correct 3 ms 4980 KB Output is correct
16 Correct 4 ms 4888 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5004 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 4 ms 5332 KB Output is correct
24 Correct 4 ms 5332 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 5 ms 5844 KB Output is correct
27 Correct 5 ms 5804 KB Output is correct
28 Correct 6 ms 6164 KB Output is correct
29 Correct 6 ms 6160 KB Output is correct
30 Correct 6 ms 6228 KB Output is correct
31 Correct 6 ms 6156 KB Output is correct
32 Correct 6 ms 6228 KB Output is correct
33 Correct 6 ms 6156 KB Output is correct
34 Correct 5 ms 6100 KB Output is correct
35 Correct 8 ms 6224 KB Output is correct
36 Correct 6 ms 6164 KB Output is correct
37 Correct 6 ms 6228 KB Output is correct
38 Correct 6 ms 6228 KB Output is correct
39 Correct 6 ms 6284 KB Output is correct
40 Correct 6 ms 6356 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 5000 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 5004 KB Output is correct
15 Correct 3 ms 4980 KB Output is correct
16 Correct 4 ms 4888 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5004 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 5076 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 4 ms 5332 KB Output is correct
24 Correct 4 ms 5332 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 5 ms 5844 KB Output is correct
27 Correct 5 ms 5804 KB Output is correct
28 Correct 6 ms 6164 KB Output is correct
29 Correct 6 ms 6160 KB Output is correct
30 Correct 6 ms 6228 KB Output is correct
31 Correct 6 ms 6156 KB Output is correct
32 Correct 6 ms 6228 KB Output is correct
33 Correct 6 ms 6156 KB Output is correct
34 Correct 5 ms 6100 KB Output is correct
35 Correct 8 ms 6224 KB Output is correct
36 Correct 6 ms 6164 KB Output is correct
37 Correct 6 ms 6228 KB Output is correct
38 Correct 6 ms 6228 KB Output is correct
39 Correct 6 ms 6284 KB Output is correct
40 Correct 6 ms 6356 KB Output is correct
41 Correct 493 ms 163908 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 256 ms 88560 KB Output is correct
44 Correct 256 ms 88540 KB Output is correct
45 Correct 263 ms 88668 KB Output is correct
46 Correct 513 ms 172056 KB Output is correct
47 Correct 515 ms 172176 KB Output is correct
48 Correct 567 ms 172172 KB Output is correct
49 Correct 517 ms 172096 KB Output is correct
50 Correct 243 ms 89036 KB Output is correct
51 Correct 239 ms 88904 KB Output is correct
52 Correct 251 ms 88976 KB Output is correct
53 Correct 490 ms 172952 KB Output is correct
54 Correct 477 ms 172888 KB Output is correct
55 Correct 479 ms 172920 KB Output is correct
56 Correct 8 ms 7056 KB Output is correct
57 Correct 14 ms 7512 KB Output is correct
58 Correct 64 ms 15440 KB Output is correct
59 Correct 220 ms 20888 KB Output is correct
60 Correct 471 ms 167860 KB Output is correct
61 Correct 434 ms 163496 KB Output is correct