oj.uz

Submission #354193

# Submission time Handle Problem Language Result Execution time Memory
354193 2021-01-21T14:29:07 Z spatarel Cat in a tree (BOI17_catinatree) C++17
0 / 100
 0 ms 364 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 >= 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]);
      }
    }
  }
  for (int d = D - 1; d >= 1; d--) {
    maxN[u][d - 1] = std::max(maxN[u][d - 1], maxN[u][d]);
  }
}

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

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -