oj.uz

답안 #799712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799712 2023-07-31T20:48:36 Z tch1cherin Cat in a tree (BOI17_catinatree) C++17
100 / 100
 234 ms 186872 KB 
#include <bits/stdc++.h>
using namespace std;

struct segment_tree {
  int lx, rx, value = 0;
  segment_tree* left = nullptr;
  segment_tree* right = nullptr;

  segment_tree(int _lx, int _rx) : lx(_lx), rx(_rx) {}

  void extend_left() {
    if (!left) left = new segment_tree(lx, (lx + rx) / 2);
  }

  void extend_right() {
    if (!right) right = new segment_tree((lx + rx) / 2, rx);
  }

  void modify(int i, int v) {
    if (rx - lx == 1) {
      value = max(value, v);
    } else {
      int mid = (lx + rx) / 2;
      if (i < mid) {
        extend_left();
        left->modify(i, v);
      } else {
        extend_right();
        right->modify(i, v);
      }
      value = max(!left ? 0 : left->value, !right ? 0 : right->value);
    }
  }

  int get(int i) {
    if (rx - lx == 1) {
      return value;
    } else {
      int mid = (lx + rx) / 2;
      if (i < mid) {
        return !left ? 0 : left->get(i);
      } else {
        return !right ? 0 : right->get(i);
      }
    }
  }

  int query(int l) {
    if (rx <= l) {
      return 0;
    } else if (lx >= l) {
      return value;
    } else {
      return max(!left ? 0 : left->query(l), !right ? 0 : right->query(l));
    }
  }
};

const int MAX_N = 2e5 + 5;
vector<int> G[MAX_N];
segment_tree* dp[MAX_N];
int max_depth[MAX_N];
int N, D;

int DFS(int u, int d = 0) {
  max_depth[u] = d;
  dp[u] = new segment_tree(0, 2 << __lg(N));
  int ans = 1;
  for (int v : G[u]) {
    DFS(v, d + 1);
    ans += dp[v]->query(d + D);
    if (max_depth[u] < max_depth[v]) {
      swap(max_depth[u], max_depth[v]);
      swap(dp[u], dp[v]);
    }
    vector<int> vals;
    for (int i = d + 1; i <= max_depth[v]; i++) {
      vals.push_back(dp[u]->query(max(i, 2 * d + D - i)));
    }
    for (int i = d + 1; i <= max_depth[v]; i++) {
      dp[u]->modify(i, dp[u]->get(i) + dp[v]->query(max(i, 2 * d + D - i)));
    }
    for (int i = d + 1, j = 0; i <= max_depth[v]; i++) {
      dp[u]->modify(i, dp[v]->get(i) + vals[j++]);
    }
  }
  dp[u]->modify(d, ans);
  return dp[u]->query(0);
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cin >> N >> D;
  if (D == 1) {
    cout << N << "\n";
    exit(0);
  }
  for (int i = 1; i < N; i++) {
    int p;
    cin >> p;
    G[p].push_back(i);
  }
  cout << DFS(0) << "\n";
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5020 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5028 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4920 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 5020 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 5020 KB Output is correct
17 Correct 2 ms 5020 KB Output is correct
18 Correct 2 ms 5020 KB Output is correct
19 Correct 2 ms 5016 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5020 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5028 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4920 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 5020 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 5020 KB Output is correct
17 Correct 2 ms 5020 KB Output is correct
18 Correct 2 ms 5020 KB Output is correct
19 Correct 2 ms 5016 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5588 KB Output is correct
22 Correct 2 ms 5020 KB Output is correct
23 Correct 3 ms 5152 KB Output is correct
24 Correct 3 ms 5144 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5276 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 3 ms 5536 KB Output is correct
29 Correct 3 ms 5588 KB Output is correct
30 Correct 4 ms 5536 KB Output is correct
31 Correct 5 ms 5588 KB Output is correct
32 Correct 3 ms 5844 KB Output is correct
33 Correct 4 ms 5796 KB Output is correct
34 Correct 5 ms 5788 KB Output is correct
35 Correct 3 ms 5716 KB Output is correct
36 Correct 5 ms 5780 KB Output is correct
37 Correct 4 ms 5792 KB Output is correct
38 Correct 3 ms 5844 KB Output is correct
39 Correct 4 ms 5716 KB Output is correct
40 Correct 3 ms 5588 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5020 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 5028 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4920 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 5020 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 5020 KB Output is correct
17 Correct 2 ms 5020 KB Output is correct
18 Correct 2 ms 5020 KB Output is correct
19 Correct 2 ms 5016 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 3 ms 5588 KB Output is correct
22 Correct 2 ms 5020 KB Output is correct
23 Correct 3 ms 5152 KB Output is correct
24 Correct 3 ms 5144 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 5276 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 3 ms 5536 KB Output is correct
29 Correct 3 ms 5588 KB Output is correct
30 Correct 4 ms 5536 KB Output is correct
31 Correct 5 ms 5588 KB Output is correct
32 Correct 3 ms 5844 KB Output is correct
33 Correct 4 ms 5796 KB Output is correct
34 Correct 5 ms 5788 KB Output is correct
35 Correct 3 ms 5716 KB Output is correct
36 Correct 5 ms 5780 KB Output is correct
37 Correct 4 ms 5792 KB Output is correct
38 Correct 3 ms 5844 KB Output is correct
39 Correct 4 ms 5716 KB Output is correct
40 Correct 3 ms 5588 KB Output is correct
41 Correct 162 ms 93372 KB Output is correct
42 Correct 3 ms 5000 KB Output is correct
43 Correct 102 ms 57472 KB Output is correct
44 Correct 103 ms 57340 KB Output is correct
45 Correct 96 ms 57408 KB Output is correct
46 Correct 221 ms 114684 KB Output is correct
47 Correct 210 ms 114964 KB Output is correct
48 Correct 211 ms 114748 KB Output is correct
49 Correct 203 ms 114796 KB Output is correct
50 Correct 112 ms 90924 KB Output is correct
51 Correct 116 ms 90916 KB Output is correct
52 Correct 109 ms 90868 KB Output is correct
53 Correct 234 ms 186872 KB Output is correct
54 Correct 234 ms 186744 KB Output is correct
55 Correct 226 ms 186764 KB Output is correct
56 Correct 4 ms 6184 KB Output is correct
57 Correct 13 ms 13740 KB Output is correct
58 Correct 60 ms 49000 KB Output is correct
59 Correct 191 ms 135356 KB Output is correct
60 Correct 166 ms 88232 KB Output is correct
61 Correct 173 ms 86732 KB Output is correct