oj.uz

Submission #360053

# Submission time Handle Problem Language Result Execution time Memory
360053 2021-01-27T12:28:17 Z Pety Cat in a tree (BOI17_catinatree) C++14
100 / 100
 462 ms 244536 KB 
#include <bits/stdc++.h>

using namespace std;

int n, d, child[200002], second[200002], height[200002], Max[200002];
vector<int>G[200002];
deque<int>dp[200002];

void calc (int nod) {
  for (int it : G[nod]) {
    calc(it);
    if (height[nod] < height[it] + 1) {
      child[nod] = it;
      second[nod] = height[nod];
      height[nod] = height[it] + 1;
    }
    else if (second[nod] < height[it] + 1)
      second[nod] = height[it] + 1;
  }
}

void dfs1 (int nod) {
  for (auto it : G[nod])
    dfs1(it);
  for (int i = 0; i <= second[nod]; i++)
    Max[i] = 0;
  for (auto it : G[nod])
    for (int j = 1; j <= min(height[it] + 1, min(second[nod], d / 2)); j++)
      Max[j] = max(Max[j], dp[it][j - 1] - ((d - j - 1 <= height[it]) ? dp[it][d - j - 1] : 0));
  int dp0 = 1;
  for (auto it : G[nod])
    if (height[it] >= d - 1)
      dp0 += dp[it][d - 1];
  if (child[nod])
    swap(dp[nod], dp[child[nod]]);
  dp[nod].push_front(dp0);
  for (auto it : G[nod])
    if (it != child[nod])
      for (int j = 1; j <= min(height[it] + 1, d - 1); j++)
        dp[nod][j] += dp[it][j - 1];
  for (int j = 1; j <= min(d / 2, second[nod]); j++)
    dp[nod][j] = ((d - j <= height[nod]) ? dp[nod][d - j] : 0) + Max[j];
  for (int j = second[nod]; j >= 0; j--)
    if (j + 1 <= height[nod])
      dp[nod][j] = max(dp[nod][j + 1], dp[nod][j]);
}




int main()
{
  cin >> n >> d;
  int x;
  for (int i = 2; i <= n; i++) {
    cin >> x;
    x++;
    G[x].push_back(i);
  }
  calc(1);
  dfs1(1);
  cout << dp[1][0];
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 139892 KB Output is correct
2 Correct 111 ms 139756 KB Output is correct
3 Correct 110 ms 139720 KB Output is correct
4 Correct 111 ms 139628 KB Output is correct
5 Correct 110 ms 139628 KB Output is correct
6 Correct 120 ms 139628 KB Output is correct
7 Correct 113 ms 139756 KB Output is correct
8 Correct 111 ms 139628 KB Output is correct
9 Correct 111 ms 139756 KB Output is correct
10 Correct 115 ms 139632 KB Output is correct
11 Correct 114 ms 139700 KB Output is correct
12 Correct 116 ms 139720 KB Output is correct
13 Correct 132 ms 139776 KB Output is correct
14 Correct 110 ms 139740 KB Output is correct
15 Correct 110 ms 139728 KB Output is correct
16 Correct 156 ms 139744 KB Output is correct
17 Correct 159 ms 139636 KB Output is correct
18 Correct 116 ms 139720 KB Output is correct
19 Correct 111 ms 139664 KB Output is correct
20 Correct 118 ms 139628 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 139892 KB Output is correct
2 Correct 111 ms 139756 KB Output is correct
3 Correct 110 ms 139720 KB Output is correct
4 Correct 111 ms 139628 KB Output is correct
5 Correct 110 ms 139628 KB Output is correct
6 Correct 120 ms 139628 KB Output is correct
7 Correct 113 ms 139756 KB Output is correct
8 Correct 111 ms 139628 KB Output is correct
9 Correct 111 ms 139756 KB Output is correct
10 Correct 115 ms 139632 KB Output is correct
11 Correct 114 ms 139700 KB Output is correct
12 Correct 116 ms 139720 KB Output is correct
13 Correct 132 ms 139776 KB Output is correct
14 Correct 110 ms 139740 KB Output is correct
15 Correct 110 ms 139728 KB Output is correct
16 Correct 156 ms 139744 KB Output is correct
17 Correct 159 ms 139636 KB Output is correct
18 Correct 116 ms 139720 KB Output is correct
19 Correct 111 ms 139664 KB Output is correct
20 Correct 118 ms 139628 KB Output is correct
21 Correct 116 ms 140012 KB Output is correct
22 Correct 177 ms 140012 KB Output is correct
23 Correct 125 ms 139884 KB Output is correct
24 Correct 125 ms 139884 KB Output is correct
25 Correct 122 ms 140012 KB Output is correct
26 Correct 120 ms 140012 KB Output is correct
27 Correct 119 ms 140140 KB Output is correct
28 Correct 135 ms 140140 KB Output is correct
29 Correct 145 ms 140140 KB Output is correct
30 Correct 118 ms 140140 KB Output is correct
31 Correct 119 ms 140140 KB Output is correct
32 Correct 120 ms 140524 KB Output is correct
33 Correct 123 ms 140396 KB Output is correct
34 Correct 118 ms 140396 KB Output is correct
35 Correct 120 ms 140396 KB Output is correct
36 Correct 120 ms 140484 KB Output is correct
37 Correct 127 ms 140396 KB Output is correct
38 Correct 119 ms 140524 KB Output is correct
39 Correct 120 ms 140268 KB Output is correct
40 Correct 110 ms 140012 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 139892 KB Output is correct
2 Correct 111 ms 139756 KB Output is correct
3 Correct 110 ms 139720 KB Output is correct
4 Correct 111 ms 139628 KB Output is correct
5 Correct 110 ms 139628 KB Output is correct
6 Correct 120 ms 139628 KB Output is correct
7 Correct 113 ms 139756 KB Output is correct
8 Correct 111 ms 139628 KB Output is correct
9 Correct 111 ms 139756 KB Output is correct
10 Correct 115 ms 139632 KB Output is correct
11 Correct 114 ms 139700 KB Output is correct
12 Correct 116 ms 139720 KB Output is correct
13 Correct 132 ms 139776 KB Output is correct
14 Correct 110 ms 139740 KB Output is correct
15 Correct 110 ms 139728 KB Output is correct
16 Correct 156 ms 139744 KB Output is correct
17 Correct 159 ms 139636 KB Output is correct
18 Correct 116 ms 139720 KB Output is correct
19 Correct 111 ms 139664 KB Output is correct
20 Correct 118 ms 139628 KB Output is correct
21 Correct 116 ms 140012 KB Output is correct
22 Correct 177 ms 140012 KB Output is correct
23 Correct 125 ms 139884 KB Output is correct
24 Correct 125 ms 139884 KB Output is correct
25 Correct 122 ms 140012 KB Output is correct
26 Correct 120 ms 140012 KB Output is correct
27 Correct 119 ms 140140 KB Output is correct
28 Correct 135 ms 140140 KB Output is correct
29 Correct 145 ms 140140 KB Output is correct
30 Correct 118 ms 140140 KB Output is correct
31 Correct 119 ms 140140 KB Output is correct
32 Correct 120 ms 140524 KB Output is correct
33 Correct 123 ms 140396 KB Output is correct
34 Correct 118 ms 140396 KB Output is correct
35 Correct 120 ms 140396 KB Output is correct
36 Correct 120 ms 140484 KB Output is correct
37 Correct 127 ms 140396 KB Output is correct
38 Correct 119 ms 140524 KB Output is correct
39 Correct 120 ms 140268 KB Output is correct
40 Correct 110 ms 140012 KB Output is correct
41 Correct 290 ms 185448 KB Output is correct
42 Correct 262 ms 168804 KB Output is correct
43 Correct 272 ms 169196 KB Output is correct
44 Correct 265 ms 168812 KB Output is correct
45 Correct 260 ms 168812 KB Output is correct
46 Correct 461 ms 198240 KB Output is correct
47 Correct 462 ms 198196 KB Output is correct
48 Correct 456 ms 198124 KB Output is correct
49 Correct 454 ms 198252 KB Output is correct
50 Correct 223 ms 191852 KB Output is correct
51 Correct 229 ms 191852 KB Output is correct
52 Correct 226 ms 191852 KB Output is correct
53 Correct 361 ms 244332 KB Output is correct
54 Correct 345 ms 244332 KB Output is correct
55 Correct 348 ms 244536 KB Output is correct
56 Correct 117 ms 140652 KB Output is correct
57 Correct 134 ms 144748 KB Output is correct
58 Correct 190 ms 165160 KB Output is correct
59 Correct 360 ms 214576 KB Output is correct
60 Correct 288 ms 180584 KB Output is correct
61 Correct 331 ms 179832 KB Output is correct