제출 #355400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
355400		spatarel	Cat in a tree (BOI17_catinatree)	C++17	컴파일 에러	0 ms	0 KiB

catinatree

#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] - maxN[v][D - d - 2]);
      }
    }
    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 {
    std::vector<int> maxAdd(secondDepth);
    for (int v : children[u]) {
      for (int d = 0; d < D - d - 2 && d < depth[v]; d++) {
        maxAdd[d + 1] = std::max(maxAdd[d + 1],
            maxN[v][d] - maxN[v][D - d - 2]); // FIXME
      }
    }
    std::swap(maxN[u], caxN[deepestChild]);
    maxN[u].push_front(0);
    maxN[u][0] = 1;
    for (int v : children[u]) {
      if (depth[v] > D - 1) {
        maxN[u][0] += maxN[v][D - 1];
      }
    }
    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] + maxN[u][D - d - 1]; // FIXME
    }
    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++) {
    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;
}

컴파일 시 표준 에러 (stderr) 메시지

catinatree.cpp: In function 'void dfs(int)':
catinatree.cpp:60:24: error: 'caxN' was not declared in this scope; did you mean 'maxN'?
   60 |     std::swap(maxN[u], caxN[deepestChild]);
      |                        ^~~~
      |                        maxN
catinatree.cpp:60:29: error: 'deepestChild' was not declared in this scope
   60 |     std::swap(maxN[u], caxN[deepestChild]);
      |                             ^~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:91:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   91 |   scanf("%d%d", &N, &D);
      |   ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:94:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   94 |     scanf("%d", &xi);
      |     ~~~~~^~~~~~~~~~~