oj.uz

답안 #355476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
355476 2021-01-22T14:23:35 Z spatarel Cat in a tree (BOI17_catinatree) C++17
100 / 100
 384 ms 244844 KB 
#include <stdio.h>
#include <algorithm>
#include <deque>
#include <vector>

const int MAX_N = 200000;

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

std::deque<int> maxN[MAX_N];
int depth[MAX_N];

void dfs(int u) {
  depth[u] = 1;
  int deepestChild = -1;
  int secondDepth = 0;
  for (int v : children[u]) {
    dfs(v);
    if (depth[u] <= 1 + depth[v]) {
      secondDepth = depth[u];
      depth[u] = 1 + depth[v];
      deepestChild = v;
    } else if (secondDepth < 1 + depth[v]) {
      secondDepth = 1 + depth[v];
    }
  }
  if (secondDepth >= D / 2) {
    maxN[u] = std::deque<int>(1 + D);
    maxN[u][0] = 1;
    for (int v : children[u]) {
      if (depth[v] > D - 1) {
        maxN[u][0] += maxN[v][D - 1];
      }
    }
    std::vector<int> maxAdd(1 + D);
    for (int v : children[u]) {
      for (int d = 0; d < D && d < depth[v]; d++) {
        maxN[u][d + 1] += maxN[v][d];
      }
      for (int d = 0; d < D - d - 2 && d < depth[v]; d++) {
        maxAdd[d + 1] = std::max(maxAdd[d + 1],
            maxN[v][d] - (D - d - 2 < depth[v] ? maxN[v][D - d - 2] : 0));
      }
    }
    for (int d = 0; d < D - d - 2; d++) {
      maxN[u][d + 1] = maxAdd[d + 1] + maxN[u][D - d - 1];
    }
    for (int d = D - 1; d >= 1; d--) {
      maxN[u][d - 1] = std::max(maxN[u][d - 1], maxN[u][d]);
    }
  } else {
    //printf("u = %d\n", u);
    //fflush(stdout);
    std::vector<int> maxAdd(secondDepth);
    //printf("second depth = %d\n", secondDepth);
    //fflush(stdout);
    for (int v : children[u]) {
      for (int d = 0; d < D - d - 2 && d < depth[v] && d + 1 < secondDepth; d++) {
        maxAdd[d + 1] = std::max(maxAdd[d + 1],
            maxN[v][d] - (D - d - 2 < depth[v] ? maxN[v][D - d - 2] : 0));
      }
    }
    //printf("tata\n");
    //fflush(stdout);
    int maxNU0 = 1;
    for (int v : children[u]) {
      if (depth[v] > D - 1) {
        maxNU0 += maxN[v][D - 1];
      }
    }
    if (deepestChild != -1) {
      std::swap(maxN[u], maxN[deepestChild]);
    }
    //printf("mama\n");
    //fflush(stdout);
    maxN[u].push_front(maxNU0);
    //printf("maxN[u][0] = %d\n", maxN[u][0]);
    //fflush(stdout);
    for (int v : children[u]) {
      if (v != deepestChild) {
        for (int d = 0; d < D && d < depth[v]; d++) {
          maxN[u][d + 1] += maxN[v][d];
        }
      }
    }
    for (int d = 0; d + 1 < secondDepth; d++) {
      maxN[u][d + 1] = maxAdd[d + 1] + (D - d - 1 < depth[u] ? maxN[u][D - d - 1] : 0);
    }
    for (int d = secondDepth; 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 < depth[u]; d++) {
    printf("%d, ", maxN[u][d]);
  }
  printf("}\n");
  fflush(stdout);//*/
}

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:104:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  104 |   scanf("%d%d", &N, &D);
      |   ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:107:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  107 |     scanf("%d", &xi);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 139628 KB Output is correct
2 Correct 111 ms 139628 KB Output is correct
3 Correct 109 ms 139628 KB Output is correct
4 Correct 119 ms 139628 KB Output is correct
5 Correct 122 ms 139752 KB Output is correct
6 Correct 111 ms 139712 KB Output is correct
7 Correct 108 ms 139644 KB Output is correct
8 Correct 118 ms 139628 KB Output is correct
9 Correct 112 ms 139628 KB Output is correct
10 Correct 111 ms 139628 KB Output is correct
11 Correct 109 ms 139628 KB Output is correct
12 Correct 109 ms 139628 KB Output is correct
13 Correct 108 ms 139628 KB Output is correct
14 Correct 108 ms 139628 KB Output is correct
15 Correct 107 ms 139756 KB Output is correct
16 Correct 108 ms 139628 KB Output is correct
17 Correct 109 ms 139628 KB Output is correct
18 Correct 108 ms 139756 KB Output is correct
19 Correct 109 ms 139628 KB Output is correct
20 Correct 108 ms 139648 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 139628 KB Output is correct
2 Correct 111 ms 139628 KB Output is correct
3 Correct 109 ms 139628 KB Output is correct
4 Correct 119 ms 139628 KB Output is correct
5 Correct 122 ms 139752 KB Output is correct
6 Correct 111 ms 139712 KB Output is correct
7 Correct 108 ms 139644 KB Output is correct
8 Correct 118 ms 139628 KB Output is correct
9 Correct 112 ms 139628 KB Output is correct
10 Correct 111 ms 139628 KB Output is correct
11 Correct 109 ms 139628 KB Output is correct
12 Correct 109 ms 139628 KB Output is correct
13 Correct 108 ms 139628 KB Output is correct
14 Correct 108 ms 139628 KB Output is correct
15 Correct 107 ms 139756 KB Output is correct
16 Correct 108 ms 139628 KB Output is correct
17 Correct 109 ms 139628 KB Output is correct
18 Correct 108 ms 139756 KB Output is correct
19 Correct 109 ms 139628 KB Output is correct
20 Correct 108 ms 139648 KB Output is correct
21 Correct 109 ms 140012 KB Output is correct
22 Correct 110 ms 139628 KB Output is correct
23 Correct 116 ms 139756 KB Output is correct
24 Correct 116 ms 139756 KB Output is correct
25 Correct 108 ms 139628 KB Output is correct
26 Correct 118 ms 139884 KB Output is correct
27 Correct 118 ms 139884 KB Output is correct
28 Correct 122 ms 140028 KB Output is correct
29 Correct 133 ms 140188 KB Output is correct
30 Correct 118 ms 140012 KB Output is correct
31 Correct 117 ms 140140 KB Output is correct
32 Correct 125 ms 140396 KB Output is correct
33 Correct 117 ms 140396 KB Output is correct
34 Correct 118 ms 140396 KB Output is correct
35 Correct 118 ms 140396 KB Output is correct
36 Correct 116 ms 140396 KB Output is correct
37 Correct 118 ms 140396 KB Output is correct
38 Correct 117 ms 140396 KB Output is correct
39 Correct 130 ms 140396 KB Output is correct
40 Correct 108 ms 140140 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 139628 KB Output is correct
2 Correct 111 ms 139628 KB Output is correct
3 Correct 109 ms 139628 KB Output is correct
4 Correct 119 ms 139628 KB Output is correct
5 Correct 122 ms 139752 KB Output is correct
6 Correct 111 ms 139712 KB Output is correct
7 Correct 108 ms 139644 KB Output is correct
8 Correct 118 ms 139628 KB Output is correct
9 Correct 112 ms 139628 KB Output is correct
10 Correct 111 ms 139628 KB Output is correct
11 Correct 109 ms 139628 KB Output is correct
12 Correct 109 ms 139628 KB Output is correct
13 Correct 108 ms 139628 KB Output is correct
14 Correct 108 ms 139628 KB Output is correct
15 Correct 107 ms 139756 KB Output is correct
16 Correct 108 ms 139628 KB Output is correct
17 Correct 109 ms 139628 KB Output is correct
18 Correct 108 ms 139756 KB Output is correct
19 Correct 109 ms 139628 KB Output is correct
20 Correct 108 ms 139648 KB Output is correct
21 Correct 109 ms 140012 KB Output is correct
22 Correct 110 ms 139628 KB Output is correct
23 Correct 116 ms 139756 KB Output is correct
24 Correct 116 ms 139756 KB Output is correct
25 Correct 108 ms 139628 KB Output is correct
26 Correct 118 ms 139884 KB Output is correct
27 Correct 118 ms 139884 KB Output is correct
28 Correct 122 ms 140028 KB Output is correct
29 Correct 133 ms 140188 KB Output is correct
30 Correct 118 ms 140012 KB Output is correct
31 Correct 117 ms 140140 KB Output is correct
32 Correct 125 ms 140396 KB Output is correct
33 Correct 117 ms 140396 KB Output is correct
34 Correct 118 ms 140396 KB Output is correct
35 Correct 118 ms 140396 KB Output is correct
36 Correct 116 ms 140396 KB Output is correct
37 Correct 118 ms 140396 KB Output is correct
38 Correct 117 ms 140396 KB Output is correct
39 Correct 130 ms 140396 KB Output is correct
40 Correct 108 ms 140140 KB Output is correct
41 Correct 264 ms 188392 KB Output is correct
42 Correct 198 ms 142188 KB Output is correct
43 Correct 249 ms 168044 KB Output is correct
44 Correct 238 ms 167916 KB Output is correct
45 Correct 236 ms 168172 KB Output is correct
46 Correct 382 ms 195948 KB Output is correct
47 Correct 372 ms 195948 KB Output is correct
48 Correct 373 ms 195948 KB Output is correct
49 Correct 384 ms 195968 KB Output is correct
50 Correct 205 ms 192108 KB Output is correct
51 Correct 206 ms 192108 KB Output is correct
52 Correct 210 ms 192140 KB Output is correct
53 Correct 307 ms 244844 KB Output is correct
54 Correct 305 ms 244764 KB Output is correct
55 Correct 305 ms 244844 KB Output is correct
56 Correct 117 ms 140780 KB Output is correct
57 Correct 125 ms 146156 KB Output is correct
58 Correct 174 ms 171724 KB Output is correct
59 Correct 291 ms 221932 KB Output is correct
60 Correct 243 ms 179560 KB Output is correct
61 Correct 377 ms 178432 KB Output is correct