oj.uz

Submission #798286

# Submission time Handle Problem Language Result Execution time Memory
798286 2023-07-30T14:50:40 Z tch1cherin Cat in a tree (BOI17_catinatree) C++17
51 / 100
 30 ms 9408 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 1505;
vector<int> G[MAX_N];
int dp[MAX_N][MAX_N] = {};
int N, D;

void DFS(int u) {
  dp[u][0] = 1;
  for (int v : G[u]) {
    DFS(v);
    dp[u][0] += dp[v][D - 1];
  }
  int deg = (int)G[u].size();
  for (int d = 1; d <= N; d++) {
    if (d * 2 < D) {
      vector<int> pref(deg + 1), suff(deg + 1);
      for (int i = 0; i < deg; i++) {
        pref[i + 1] = pref[i] + dp[G[u][i]][D - d - 1];
      }
      for (int i = deg; i > 0; i--) {
        suff[i - 1] = suff[i] + dp[G[u][i - 1]][D - d - 1];
      }
      for (int i = 0; i < deg; i++) {
        dp[u][d] = max(dp[u][d], pref[i] + suff[i + 1] + dp[G[u][i]][d - 1]);
      }
    } else {
      for (int v : G[u]) {
        dp[u][d] += dp[v][d - 1];
      }
    }
  }
  for (int d = N; d > 0; d--) {
    dp[u][d - 1] = max(dp[u][d - 1], dp[u][d]);
  }
}

int main() {
  cin >> N >> D;
  D = min(D, N);
  for (int i = 1; i < N; i++) {
    int p;
    cin >> p;
    G[p].push_back(i);
  }
  DFS(0);
  if (D == 1) {
    cout << N << "\n";
    exit(0);
  }
  cout << dp[0][0] << "\n";
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 372 KB Output is correct
20 Correct 0 ms 340 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 372 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 30 ms 9408 KB Output is correct
22 Correct 2 ms 3284 KB Output is correct
23 Correct 2 ms 3284 KB Output is correct
24 Correct 2 ms 3284 KB Output is correct
25 Correct 6 ms 6228 KB Output is correct
26 Correct 6 ms 6228 KB Output is correct
27 Correct 6 ms 6232 KB Output is correct
28 Correct 11 ms 9172 KB Output is correct
29 Correct 11 ms 9144 KB Output is correct
30 Correct 12 ms 9192 KB Output is correct
31 Correct 12 ms 9172 KB Output is correct
32 Correct 11 ms 8916 KB Output is correct
33 Correct 11 ms 8916 KB Output is correct
34 Correct 10 ms 8532 KB Output is correct
35 Correct 10 ms 8524 KB Output is correct
36 Correct 11 ms 9156 KB Output is correct
37 Correct 12 ms 9084 KB Output is correct
38 Correct 11 ms 9220 KB Output is correct
39 Correct 12 ms 9172 KB Output is correct
40 Correct 10 ms 9300 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 372 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 30 ms 9408 KB Output is correct
22 Correct 2 ms 3284 KB Output is correct
23 Correct 2 ms 3284 KB Output is correct
24 Correct 2 ms 3284 KB Output is correct
25 Correct 6 ms 6228 KB Output is correct
26 Correct 6 ms 6228 KB Output is correct
27 Correct 6 ms 6232 KB Output is correct
28 Correct 11 ms 9172 KB Output is correct
29 Correct 11 ms 9144 KB Output is correct
30 Correct 12 ms 9192 KB Output is correct
31 Correct 12 ms 9172 KB Output is correct
32 Correct 11 ms 8916 KB Output is correct
33 Correct 11 ms 8916 KB Output is correct
34 Correct 10 ms 8532 KB Output is correct
35 Correct 10 ms 8524 KB Output is correct
36 Correct 11 ms 9156 KB Output is correct
37 Correct 12 ms 9084 KB Output is correct
38 Correct 11 ms 9220 KB Output is correct
39 Correct 12 ms 9172 KB Output is correct
40 Correct 10 ms 9300 KB Output is correct
41 Runtime error 1 ms 596 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -