Submission #399593

# Submission time Handle Problem Language Result Execution time Memory
399593 2021-05-06T08:20:03 Z iulia13 Cat in a tree (BOI17_catinatree) C++14
100 / 100
392 ms 244284 KB
#include <bits/stdc++.h>

using namespace std;
const int nmax = 2e5 + 5;
int n, D;
deque <int> dp[nmax];
vector <int> g[nmax];
int depth[nmax], deep[nmax], second[nmax], maxim[nmax];
void precalc(int nod)
{
    for (auto x : g[nod])
    {
        precalc(x);
        if (depth[nod] < depth[x] + 1)
        {
            deep[nod] = x;
            second[nod] = depth[nod];
            depth[nod] = depth[x] + 1;
        }
        else
        if (second[nod] < depth[x] + 1)
            second[nod] = depth[x] + 1;
    }
}
void dfs(int nod)
{
    for (auto x : g[nod])
        dfs(x);
    for (int i = 0; i <= second[nod]; i++)
        maxim[i] = 0;
    for (auto x : g[nod])
        for (int d = 1; d <= min(depth[x] + 1, min(second[nod], D / 2)); d++)
        {
            if (D - d - 1 <= depth[x])
                maxim[d] = max(maxim[d], dp[x][d - 1] - dp[x][D - d - 1]);
            else
                maxim[d] = max(maxim[d], dp[x][d - 1]);
        }
    int dp0 = 1;
    for (auto x : g[nod])
        if (depth[x] >= D - 1)
            dp0 += dp[x][D - 1];
    if (deep[nod])
        swap(dp[nod], dp[deep[nod]]);
    dp[nod].push_front(dp0);
    for (auto x : g[nod])
        if (x != deep[nod])
            for (int d = 1; d <= min(depth[x] + 1, D - 1); d++)
                dp[nod][d] += dp[x][d - 1];
    for (int d = 1; d <= min(D / 2, second[nod]); d++)
    {
        if (D - d <= depth[nod])
            dp[nod][d] = dp[nod][D - d] + maxim[d];
        else
            dp[nod][d] = maxim[d];
    }
    for (int d = second[nod]; 0 <= d; d--)
        if (d + 1 <= depth[nod])
            dp[nod][d] = max(dp[nod][d + 1], dp[nod][d]);
}
int main()
{
    cin >> n >> D;
    for (int i = 1; i < n; i++)
    {
        int x;
        cin >> x;
        g[x].push_back(i);
    }
    precalc(0);
    dfs(0);
    cout << dp[0][0];
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 91 ms 139704 KB Output is correct
2 Correct 88 ms 139600 KB Output is correct
3 Correct 89 ms 139620 KB Output is correct
4 Correct 88 ms 139584 KB Output is correct
5 Correct 89 ms 139560 KB Output is correct
6 Correct 89 ms 139672 KB Output is correct
7 Correct 88 ms 139556 KB Output is correct
8 Correct 91 ms 139604 KB Output is correct
9 Correct 89 ms 139588 KB Output is correct
10 Correct 88 ms 139548 KB Output is correct
11 Correct 89 ms 139644 KB Output is correct
12 Correct 91 ms 139588 KB Output is correct
13 Correct 89 ms 139576 KB Output is correct
14 Correct 92 ms 139664 KB Output is correct
15 Correct 90 ms 139576 KB Output is correct
16 Correct 89 ms 139588 KB Output is correct
17 Correct 88 ms 139532 KB Output is correct
18 Correct 89 ms 139596 KB Output is correct
19 Correct 89 ms 139588 KB Output is correct
20 Correct 90 ms 139544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 91 ms 139704 KB Output is correct
2 Correct 88 ms 139600 KB Output is correct
3 Correct 89 ms 139620 KB Output is correct
4 Correct 88 ms 139584 KB Output is correct
5 Correct 89 ms 139560 KB Output is correct
6 Correct 89 ms 139672 KB Output is correct
7 Correct 88 ms 139556 KB Output is correct
8 Correct 91 ms 139604 KB Output is correct
9 Correct 89 ms 139588 KB Output is correct
10 Correct 88 ms 139548 KB Output is correct
11 Correct 89 ms 139644 KB Output is correct
12 Correct 91 ms 139588 KB Output is correct
13 Correct 89 ms 139576 KB Output is correct
14 Correct 92 ms 139664 KB Output is correct
15 Correct 90 ms 139576 KB Output is correct
16 Correct 89 ms 139588 KB Output is correct
17 Correct 88 ms 139532 KB Output is correct
18 Correct 89 ms 139596 KB Output is correct
19 Correct 89 ms 139588 KB Output is correct
20 Correct 90 ms 139544 KB Output is correct
21 Correct 91 ms 140024 KB Output is correct
22 Correct 99 ms 139764 KB Output is correct
23 Correct 102 ms 139716 KB Output is correct
24 Correct 97 ms 139740 KB Output is correct
25 Correct 99 ms 139924 KB Output is correct
26 Correct 101 ms 139984 KB Output is correct
27 Correct 98 ms 139864 KB Output is correct
28 Correct 97 ms 139972 KB Output is correct
29 Correct 101 ms 139972 KB Output is correct
30 Correct 99 ms 140064 KB Output is correct
31 Correct 98 ms 140108 KB Output is correct
32 Correct 100 ms 140324 KB Output is correct
33 Correct 99 ms 140360 KB Output is correct
34 Correct 111 ms 140336 KB Output is correct
35 Correct 98 ms 140328 KB Output is correct
36 Correct 101 ms 140552 KB Output is correct
37 Correct 99 ms 140356 KB Output is correct
38 Correct 98 ms 140316 KB Output is correct
39 Correct 99 ms 140208 KB Output is correct
40 Correct 89 ms 139892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 91 ms 139704 KB Output is correct
2 Correct 88 ms 139600 KB Output is correct
3 Correct 89 ms 139620 KB Output is correct
4 Correct 88 ms 139584 KB Output is correct
5 Correct 89 ms 139560 KB Output is correct
6 Correct 89 ms 139672 KB Output is correct
7 Correct 88 ms 139556 KB Output is correct
8 Correct 91 ms 139604 KB Output is correct
9 Correct 89 ms 139588 KB Output is correct
10 Correct 88 ms 139548 KB Output is correct
11 Correct 89 ms 139644 KB Output is correct
12 Correct 91 ms 139588 KB Output is correct
13 Correct 89 ms 139576 KB Output is correct
14 Correct 92 ms 139664 KB Output is correct
15 Correct 90 ms 139576 KB Output is correct
16 Correct 89 ms 139588 KB Output is correct
17 Correct 88 ms 139532 KB Output is correct
18 Correct 89 ms 139596 KB Output is correct
19 Correct 89 ms 139588 KB Output is correct
20 Correct 90 ms 139544 KB Output is correct
21 Correct 91 ms 140024 KB Output is correct
22 Correct 99 ms 139764 KB Output is correct
23 Correct 102 ms 139716 KB Output is correct
24 Correct 97 ms 139740 KB Output is correct
25 Correct 99 ms 139924 KB Output is correct
26 Correct 101 ms 139984 KB Output is correct
27 Correct 98 ms 139864 KB Output is correct
28 Correct 97 ms 139972 KB Output is correct
29 Correct 101 ms 139972 KB Output is correct
30 Correct 99 ms 140064 KB Output is correct
31 Correct 98 ms 140108 KB Output is correct
32 Correct 100 ms 140324 KB Output is correct
33 Correct 99 ms 140360 KB Output is correct
34 Correct 111 ms 140336 KB Output is correct
35 Correct 98 ms 140328 KB Output is correct
36 Correct 101 ms 140552 KB Output is correct
37 Correct 99 ms 140356 KB Output is correct
38 Correct 98 ms 140316 KB Output is correct
39 Correct 99 ms 140208 KB Output is correct
40 Correct 89 ms 139892 KB Output is correct
41 Correct 252 ms 185440 KB Output is correct
42 Correct 220 ms 168772 KB Output is correct
43 Correct 221 ms 168944 KB Output is correct
44 Correct 218 ms 168772 KB Output is correct
45 Correct 220 ms 168772 KB Output is correct
46 Correct 392 ms 198052 KB Output is correct
47 Correct 385 ms 198016 KB Output is correct
48 Correct 389 ms 198264 KB Output is correct
49 Correct 390 ms 198096 KB Output is correct
50 Correct 196 ms 191896 KB Output is correct
51 Correct 189 ms 191724 KB Output is correct
52 Correct 191 ms 191812 KB Output is correct
53 Correct 298 ms 244180 KB Output is correct
54 Correct 292 ms 244284 KB Output is correct
55 Correct 292 ms 244280 KB Output is correct
56 Correct 101 ms 140624 KB Output is correct
57 Correct 108 ms 145008 KB Output is correct
58 Correct 159 ms 166468 KB Output is correct
59 Correct 298 ms 216132 KB Output is correct
60 Correct 249 ms 180580 KB Output is correct
61 Correct 268 ms 179780 KB Output is correct