oj.uz

Submission #354210

# Submission time Handle Problem Language Result Execution time Memory
354210 2021-01-21T14:42:34 Z spatarel Cat in a tree (BOI17_catinatree) C++17
51 / 100
 13 ms 9324 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>

const int MAX_N = 1500; // 200000

int N, D;
std::vector<int> children[MAX_N];

int maxN[MAX_N][1 + MAX_N];

void dfs(int u) {
  for (int v : children[u]) {
    dfs(v);
  }
  maxN[u][0] = 1;
  for (int v : children[u]) {
    maxN[u][0] += maxN[v][D - 1];
  }
  for (int d = 1; d < D; d++) {
    if (d * 2 >= D) { // d >= D / 2
      maxN[u][d] = 0;
      for (int v : children[u]) {
        maxN[u][d] += maxN[v][d - 1];
      }
    } else {
      maxN[u][d] = 0;
      int maxAdd = 0;
      for (int v : children[u]) {
        maxN[u][d] += maxN[v][D - d - 1];
        maxAdd = std::max(maxAdd, maxN[v][d - 1] - maxN[v][D - d - 1]);
      }
      maxN[u][d] += maxAdd;
    }
  }
  for (int d = D - 1; d >= 1; d--) {
    maxN[u][d - 1] = std::max(maxN[u][d - 1], maxN[u][d]);
  }
  /*
  printf("maxN[%d] = {", u);
  for (int d = 0; d < D; d++) {
    printf("%d, ", maxN[u][d]);
  }
  printf("}\n");//*/
}

int main() {
  scanf("%d%d", &N, &D);
  for (int i = 1; i < N; i++) {
    int xi;
    scanf("%d", &xi);
    children[xi].push_back(i);
  }
  dfs(0);
  int answer = maxN[0][0];
  printf("%d\n", answer);
  return 0;
}

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   scanf("%d%d", &N, &D);
      |   ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |     scanf("%d", &xi);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 13 ms 9324 KB Output is correct
22 Correct 1 ms 2412 KB Output is correct
23 Correct 1 ms 2412 KB Output is correct
24 Correct 2 ms 2412 KB Output is correct
25 Correct 3 ms 4332 KB Output is correct
26 Correct 3 ms 4332 KB Output is correct
27 Correct 3 ms 4460 KB Output is correct
28 Correct 4 ms 6508 KB Output is correct
29 Correct 4 ms 6380 KB Output is correct
30 Correct 4 ms 6508 KB Output is correct
31 Correct 4 ms 6636 KB Output is correct
32 Correct 3 ms 6252 KB Output is correct
33 Correct 3 ms 6252 KB Output is correct
34 Correct 3 ms 5996 KB Output is correct
35 Correct 4 ms 5996 KB Output is correct
36 Correct 4 ms 6380 KB Output is correct
37 Correct 3 ms 6380 KB Output is correct
38 Correct 4 ms 6636 KB Output is correct
39 Correct 5 ms 6764 KB Output is correct
40 Correct 4 ms 6508 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 13 ms 9324 KB Output is correct
22 Correct 1 ms 2412 KB Output is correct
23 Correct 1 ms 2412 KB Output is correct
24 Correct 2 ms 2412 KB Output is correct
25 Correct 3 ms 4332 KB Output is correct
26 Correct 3 ms 4332 KB Output is correct
27 Correct 3 ms 4460 KB Output is correct
28 Correct 4 ms 6508 KB Output is correct
29 Correct 4 ms 6380 KB Output is correct
30 Correct 4 ms 6508 KB Output is correct
31 Correct 4 ms 6636 KB Output is correct
32 Correct 3 ms 6252 KB Output is correct
33 Correct 3 ms 6252 KB Output is correct
34 Correct 3 ms 5996 KB Output is correct
35 Correct 4 ms 5996 KB Output is correct
36 Correct 4 ms 6380 KB Output is correct
37 Correct 3 ms 6380 KB Output is correct
38 Correct 4 ms 6636 KB Output is correct
39 Correct 5 ms 6764 KB Output is correct
40 Correct 4 ms 6508 KB Output is correct
41 Runtime error 2 ms 620 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -