oj.uz

답안 #885164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885164 2023-12-09T06:17:06 Z nima_aryan Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 417 ms 46596 KB 
/**
 *    author:  NimaAryan
 *    created: 2023-12-09 09:11:54  
**/
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#endif

using i64 = long long;

struct Tag {
  i64 add = 0;

  void apply(Tag v) {
    add += v.add;
  }
};
struct Info {
  i64 min_dep = 0;
  i64 max_dep = 0;
 
  /* max(dep[x] - 2 * dep[y]) */
  i64 limp = 0;
  i64 rimp = 0;

  i64 diam = 0;

  void apply(Tag v) {
    min_dep += v.add;
    max_dep += v.add;
    limp -= v.add;
    rimp -= v.add;
  }
};
Info operator+(Info a, Info b) {
  Info res;
  res.min_dep = min(a.min_dep, b.min_dep);
  res.max_dep = max(a.max_dep, b.max_dep);
  res.limp = max({a.limp, b.limp, a.max_dep - 2LL * b.min_dep});
  res.rimp = max({a.rimp, b.rimp, b.max_dep - 2LL * a.min_dep});
  res.diam = max({a.diam, b.diam, a.max_dep + b.rimp, b.max_dep + a.limp});
  return res;
}

class LazySegmentTree {
 public:
  vector<Info> info;
  vector<Tag> tag;
  int n;

  LazySegmentTree(int n) : n(n) {
    info.assign(4 << __lg(n), Info());
    tag.assign(4 << __lg(n), Tag());
  }

  void pull(int p) {
    info[p] = info[2 * p] + info[2 * p + 1];
  }
  void apply(int p, const Tag& v) {
    info[p].apply(v);
    tag[p].apply(v);
  }
  void push(int p) {
    apply(2 * p, tag[p]);
    apply(2 * p + 1, tag[p]);
    tag[p] = Tag();
  }
  void range_apply(int p, int l, int r, int lx, int rx,
                  const Tag& v) {
    if (l >= rx || r <= lx) {
      return;
    }
    if (l >= lx && r <= rx) {
      apply(p, v);
      return;
    }
    int m = (l + r) / 2;
    push(p);
    range_apply(2 * p, l, m, lx, rx, v);
    range_apply(2 * p + 1, m, r, lx, rx, v);
    pull(p);
  }
  void range_apply(int lx, int rx, const Tag& v) {
    range_apply(1, 0, n, lx, rx, v);
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int n, q;
  cin >> n >> q;
  i64 w;
  cin >> w;

  vector<vector<pair<int, i64>>> t(n);
  vector<i64> c(n - 1);
  for (int i = 0; i < n - 1; ++i) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    cin >> c[i];
    t[a].emplace_back(b, i);
    t[b].emplace_back(a, i);
  }

  LazySegmentTree seg(2 * n - 1);
  vector<int> tin(n - 1), tout(n - 1);
  int num = 0;
  auto dfs = [&](auto self, int x, int p) -> void {
    num++;
    for (auto [y, i] : t[x]) {
      if (i != p) {
        tin[i] = num;
        self(self, y, i);
        tout[i] = num;
        seg.range_apply(tin[i], tout[i], Tag{c[i]});
        num++;
      }
    }
  };
  dfs(dfs, 0, -1);

  i64 last = 0;
  while (q--) {
    int d;
    cin >> d;
    i64 e;
    cin >> e;
    d = (d + last) % (n - 1);
    e = (e + last) % w;
    seg.range_apply(tin[d], tout[d], Tag{-c[d]});
    c[d] = e;
    seg.range_apply(tin[d], tout[d], Tag{+c[d]});
    cout << (last = seg.info[1].diam) << "\n";
  }

  return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 6 ms 696 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 9 ms 2396 KB Output is correct
24 Correct 10 ms 2512 KB Output is correct
25 Correct 10 ms 2652 KB Output is correct
26 Correct 13 ms 2956 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 9 ms 604 KB Output is correct
5 Correct 43 ms 1364 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 14 ms 796 KB Output is correct
11 Correct 66 ms 1924 KB Output is correct
12 Correct 4 ms 2652 KB Output is correct
13 Correct 5 ms 2392 KB Output is correct
14 Correct 5 ms 2464 KB Output is correct
15 Correct 21 ms 2712 KB Output is correct
16 Correct 93 ms 4176 KB Output is correct
17 Correct 73 ms 34752 KB Output is correct
18 Correct 70 ms 34904 KB Output is correct
19 Correct 73 ms 34764 KB Output is correct
20 Correct 93 ms 35012 KB Output is correct
21 Correct 203 ms 36544 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 10 ms 860 KB Output is correct
3 Correct 50 ms 1400 KB Output is correct
4 Correct 95 ms 2128 KB Output is correct
5 Correct 10 ms 4444 KB Output is correct
6 Correct 20 ms 4700 KB Output is correct
7 Correct 72 ms 5392 KB Output is correct
8 Correct 130 ms 5972 KB Output is correct
9 Correct 43 ms 18268 KB Output is correct
10 Correct 53 ms 18400 KB Output is correct
11 Correct 113 ms 19016 KB Output is correct
12 Correct 185 ms 19712 KB Output is correct
13 Correct 80 ms 35896 KB Output is correct
14 Correct 96 ms 36168 KB Output is correct
15 Correct 161 ms 36692 KB Output is correct
16 Correct 242 ms 37536 KB Output is correct
17 Correct 213 ms 37460 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 39992 KB Output is correct
2 Correct 263 ms 39760 KB Output is correct
3 Correct 267 ms 39860 KB Output is correct
4 Correct 254 ms 39764 KB Output is correct
5 Correct 257 ms 39640 KB Output is correct
6 Correct 270 ms 39544 KB Output is correct
7 Correct 309 ms 42384 KB Output is correct
8 Correct 342 ms 42424 KB Output is correct
9 Correct 296 ms 42396 KB Output is correct
10 Correct 325 ms 42428 KB Output is correct
11 Correct 359 ms 42188 KB Output is correct
12 Correct 288 ms 41536 KB Output is correct
13 Correct 401 ms 46420 KB Output is correct
14 Correct 393 ms 46416 KB Output is correct
15 Correct 390 ms 46256 KB Output is correct
16 Correct 375 ms 46420 KB Output is correct
17 Correct 382 ms 46056 KB Output is correct
18 Correct 328 ms 42696 KB Output is correct
19 Correct 390 ms 46244 KB Output is correct
20 Correct 365 ms 46168 KB Output is correct
21 Correct 417 ms 46596 KB Output is correct
22 Correct 382 ms 46440 KB Output is correct
23 Correct 383 ms 45668 KB Output is correct
24 Correct 316 ms 42724 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 6 ms 696 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 9 ms 2396 KB Output is correct
24 Correct 10 ms 2512 KB Output is correct
25 Correct 10 ms 2652 KB Output is correct
26 Correct 13 ms 2956 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 9 ms 604 KB Output is correct
31 Correct 43 ms 1364 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 14 ms 796 KB Output is correct
37 Correct 66 ms 1924 KB Output is correct
38 Correct 4 ms 2652 KB Output is correct
39 Correct 5 ms 2392 KB Output is correct
40 Correct 5 ms 2464 KB Output is correct
41 Correct 21 ms 2712 KB Output is correct
42 Correct 93 ms 4176 KB Output is correct
43 Correct 73 ms 34752 KB Output is correct
44 Correct 70 ms 34904 KB Output is correct
45 Correct 73 ms 34764 KB Output is correct
46 Correct 93 ms 35012 KB Output is correct
47 Correct 203 ms 36544 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 10 ms 860 KB Output is correct
50 Correct 50 ms 1400 KB Output is correct
51 Correct 95 ms 2128 KB Output is correct
52 Correct 10 ms 4444 KB Output is correct
53 Correct 20 ms 4700 KB Output is correct
54 Correct 72 ms 5392 KB Output is correct
55 Correct 130 ms 5972 KB Output is correct
56 Correct 43 ms 18268 KB Output is correct
57 Correct 53 ms 18400 KB Output is correct
58 Correct 113 ms 19016 KB Output is correct
59 Correct 185 ms 19712 KB Output is correct
60 Correct 80 ms 35896 KB Output is correct
61 Correct 96 ms 36168 KB Output is correct
62 Correct 161 ms 36692 KB Output is correct
63 Correct 242 ms 37536 KB Output is correct
64 Correct 213 ms 37460 KB Output is correct
65 Correct 276 ms 39992 KB Output is correct
66 Correct 263 ms 39760 KB Output is correct
67 Correct 267 ms 39860 KB Output is correct
68 Correct 254 ms 39764 KB Output is correct
69 Correct 257 ms 39640 KB Output is correct
70 Correct 270 ms 39544 KB Output is correct
71 Correct 309 ms 42384 KB Output is correct
72 Correct 342 ms 42424 KB Output is correct
73 Correct 296 ms 42396 KB Output is correct
74 Correct 325 ms 42428 KB Output is correct
75 Correct 359 ms 42188 KB Output is correct
76 Correct 288 ms 41536 KB Output is correct
77 Correct 401 ms 46420 KB Output is correct
78 Correct 393 ms 46416 KB Output is correct
79 Correct 390 ms 46256 KB Output is correct
80 Correct 375 ms 46420 KB Output is correct
81 Correct 382 ms 46056 KB Output is correct
82 Correct 328 ms 42696 KB Output is correct
83 Correct 390 ms 46244 KB Output is correct
84 Correct 365 ms 46168 KB Output is correct
85 Correct 417 ms 46596 KB Output is correct
86 Correct 382 ms 46440 KB Output is correct
87 Correct 383 ms 45668 KB Output is correct
88 Correct 316 ms 42724 KB Output is correct
89 Correct 267 ms 38736 KB Output is correct
90 Correct 276 ms 39248 KB Output is correct
91 Correct 284 ms 40500 KB Output is correct
92 Correct 302 ms 40528 KB Output is correct
93 Correct 353 ms 42844 KB Output is correct
94 Correct 329 ms 42064 KB Output is correct
95 Correct 381 ms 43976 KB Output is correct
96 Correct 353 ms 42624 KB Output is correct
97 Correct 392 ms 43600 KB Output is correct
98 Correct 364 ms 45392 KB Output is correct
99 Correct 367 ms 43312 KB Output is correct
100 Correct 372 ms 43236 KB Output is correct