oj.uz

Submission #867006

# Submission time Handle Problem Language Result Execution time Memory
867006 2023-10-27T15:05:25 Z NeroZein Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 402 ms 48940 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 3e5 + 5;

int n; 
long long dis[N];
long long weight[N]; 
int cnt, in[N], out[N]; 
vector<pair<int, int>> g[N]; 

struct node {
  long long mx = 0, mn = 0, mxmn = 0, mnmx = 0, ans = 0, lazy = 0;
}seg[N * 4];

node merge(node& lx, node& rx) {
  node ret;
  ret.mx = max(lx.mx, rx.mx);
  ret.mn = min(lx.mn, rx.mn);
  ret.mxmn = max({lx.mxmn, rx.mxmn, lx.mx - 2LL * rx.mn});
  ret.mnmx = max({lx.mnmx, rx.mnmx, - 2LL * lx.mn + rx.mx}); 
  ret.ans = max({lx.ans, rx.ans, lx.mx + rx.mnmx, lx.mxmn + rx.mx});
  return ret;
}

void push(int nd, int l, int r) {
  if (!seg[nd].lazy) {
    return;
  }
  seg[nd].mx += seg[nd].lazy;
  seg[nd].mn += seg[nd].lazy;
  seg[nd].mxmn -= seg[nd].lazy;
  seg[nd].mnmx -= seg[nd].lazy; 
  if (l != r) {
    int mid = (l + r) / 2;
    int rs = nd + ((mid - l + 1) * 2);
    seg[nd + 1].lazy += seg[nd].lazy;
    seg[rs].lazy += seg[nd].lazy; 
  }
  seg[nd].lazy = 0;
}

void upd(int nd, int l, int r, int s, int e, long long v) {
  push(nd, l, r); 
  if (l >= s && r <= e) {    
    seg[nd].lazy = v;
    push(nd, l, r);
    return;
  }
  int mid = (l + r) / 2;
  int rs = nd + ((mid - l + 1) * 2);
  if (mid >= e) {
    upd(nd + 1, l, mid, s, e, v);
    push(rs, mid + 1, r); 
  } else {
    if (mid < s) {
      push(nd + 1, l, mid);
      upd(rs, mid + 1, r, s, e, v); 
    } else {
      upd(nd + 1, l, mid, s, e, v);
      upd(rs, mid + 1, r, s, e, v); 
    }
  }
  seg[nd] = merge(seg[nd + 1], seg[rs]); 
}

void dfs(int v, int pe) {
  cnt++; 
  for (auto [u, i] : g[v]) {
    if (i == pe) {
      continue;
    }
    dis[u] = dis[v] + weight[i]; 
    in[i] = cnt; 
    dfs(u, i); 
    out[i] = cnt - 1;
    upd(0, 0, 2 * n - 2, in[i], out[i], weight[i]); 
    cnt++; 
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int q;
  long long lim;
  cin >> n >> q >> lim;
  for(int i = 0; i < n - 1; ++i) {
    int u, v;
    long long w;
    cin >> u >> v >> w;
    weight[i] = w; 
    g[u].emplace_back(v, i);
    g[v].emplace_back(u, i); 
  }
  dfs(1, n); 
  long long last = 0;
  while (q--) {
    long long d, c;
    cin >> d >> c;
    d = (d + last) % (n - 1);
    c = (c + last) % lim;
    upd(0, 0, 2 * n - 2, in[d], out[d], -weight[d]);
    weight[d] = c; 
    upd(0, 0, 2 * n - 2, in[d], out[d], +weight[d]);
    last = max(seg[0].mx, seg[0].ans);
    cout << last << '\n';  
  } 
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10684 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10764 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10684 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10764 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 6 ms 10844 KB Output is correct
20 Correct 8 ms 10996 KB Output is correct
21 Correct 7 ms 10840 KB Output is correct
22 Correct 8 ms 10840 KB Output is correct
23 Correct 10 ms 11864 KB Output is correct
24 Correct 10 ms 11868 KB Output is correct
25 Correct 11 ms 11780 KB Output is correct
26 Correct 14 ms 12120 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 9 ms 10744 KB Output is correct
5 Correct 37 ms 11092 KB Output is correct
6 Correct 2 ms 10584 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 3 ms 10844 KB Output is correct
10 Correct 13 ms 10844 KB Output is correct
11 Correct 57 ms 11160 KB Output is correct
12 Correct 4 ms 11864 KB Output is correct
13 Correct 5 ms 11868 KB Output is correct
14 Correct 6 ms 11864 KB Output is correct
15 Correct 18 ms 11864 KB Output is correct
16 Correct 73 ms 12376 KB Output is correct
17 Correct 75 ms 36256 KB Output is correct
18 Correct 63 ms 36040 KB Output is correct
19 Correct 65 ms 36036 KB Output is correct
20 Correct 84 ms 36384 KB Output is correct
21 Correct 166 ms 36852 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10840 KB Output is correct
2 Correct 11 ms 10844 KB Output is correct
3 Correct 45 ms 11100 KB Output is correct
4 Correct 92 ms 11304 KB Output is correct
5 Correct 14 ms 13148 KB Output is correct
6 Correct 23 ms 13124 KB Output is correct
7 Correct 64 ms 13216 KB Output is correct
8 Correct 120 ms 13656 KB Output is correct
9 Correct 38 ms 24352 KB Output is correct
10 Correct 51 ms 24404 KB Output is correct
11 Correct 114 ms 24576 KB Output is correct
12 Correct 179 ms 24912 KB Output is correct
13 Correct 77 ms 36152 KB Output is correct
14 Correct 91 ms 36180 KB Output is correct
15 Correct 152 ms 36432 KB Output is correct
16 Correct 230 ms 36692 KB Output is correct
17 Correct 199 ms 36660 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 41736 KB Output is correct
2 Correct 239 ms 41624 KB Output is correct
3 Correct 267 ms 41708 KB Output is correct
4 Correct 243 ms 41712 KB Output is correct
5 Correct 248 ms 41552 KB Output is correct
6 Correct 225 ms 41780 KB Output is correct
7 Correct 322 ms 44488 KB Output is correct
8 Correct 292 ms 44440 KB Output is correct
9 Correct 316 ms 44444 KB Output is correct
10 Correct 313 ms 44792 KB Output is correct
11 Correct 302 ms 44280 KB Output is correct
12 Correct 262 ms 43724 KB Output is correct
13 Correct 383 ms 48612 KB Output is correct
14 Correct 364 ms 48940 KB Output is correct
15 Correct 374 ms 48724 KB Output is correct
16 Correct 371 ms 48740 KB Output is correct
17 Correct 348 ms 48140 KB Output is correct
18 Correct 297 ms 45572 KB Output is correct
19 Correct 354 ms 48696 KB Output is correct
20 Correct 402 ms 48728 KB Output is correct
21 Correct 359 ms 48724 KB Output is correct
22 Correct 359 ms 48756 KB Output is correct
23 Correct 365 ms 48200 KB Output is correct
24 Correct 328 ms 45260 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10684 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10584 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10764 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 6 ms 10844 KB Output is correct
20 Correct 8 ms 10996 KB Output is correct
21 Correct 7 ms 10840 KB Output is correct
22 Correct 8 ms 10840 KB Output is correct
23 Correct 10 ms 11864 KB Output is correct
24 Correct 10 ms 11868 KB Output is correct
25 Correct 11 ms 11780 KB Output is correct
26 Correct 14 ms 12120 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 9 ms 10744 KB Output is correct
31 Correct 37 ms 11092 KB Output is correct
32 Correct 2 ms 10584 KB Output is correct
33 Correct 2 ms 10844 KB Output is correct
34 Correct 2 ms 10844 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 13 ms 10844 KB Output is correct
37 Correct 57 ms 11160 KB Output is correct
38 Correct 4 ms 11864 KB Output is correct
39 Correct 5 ms 11868 KB Output is correct
40 Correct 6 ms 11864 KB Output is correct
41 Correct 18 ms 11864 KB Output is correct
42 Correct 73 ms 12376 KB Output is correct
43 Correct 75 ms 36256 KB Output is correct
44 Correct 63 ms 36040 KB Output is correct
45 Correct 65 ms 36036 KB Output is correct
46 Correct 84 ms 36384 KB Output is correct
47 Correct 166 ms 36852 KB Output is correct
48 Correct 3 ms 10840 KB Output is correct
49 Correct 11 ms 10844 KB Output is correct
50 Correct 45 ms 11100 KB Output is correct
51 Correct 92 ms 11304 KB Output is correct
52 Correct 14 ms 13148 KB Output is correct
53 Correct 23 ms 13124 KB Output is correct
54 Correct 64 ms 13216 KB Output is correct
55 Correct 120 ms 13656 KB Output is correct
56 Correct 38 ms 24352 KB Output is correct
57 Correct 51 ms 24404 KB Output is correct
58 Correct 114 ms 24576 KB Output is correct
59 Correct 179 ms 24912 KB Output is correct
60 Correct 77 ms 36152 KB Output is correct
61 Correct 91 ms 36180 KB Output is correct
62 Correct 152 ms 36432 KB Output is correct
63 Correct 230 ms 36692 KB Output is correct
64 Correct 199 ms 36660 KB Output is correct
65 Correct 301 ms 41736 KB Output is correct
66 Correct 239 ms 41624 KB Output is correct
67 Correct 267 ms 41708 KB Output is correct
68 Correct 243 ms 41712 KB Output is correct
69 Correct 248 ms 41552 KB Output is correct
70 Correct 225 ms 41780 KB Output is correct
71 Correct 322 ms 44488 KB Output is correct
72 Correct 292 ms 44440 KB Output is correct
73 Correct 316 ms 44444 KB Output is correct
74 Correct 313 ms 44792 KB Output is correct
75 Correct 302 ms 44280 KB Output is correct
76 Correct 262 ms 43724 KB Output is correct
77 Correct 383 ms 48612 KB Output is correct
78 Correct 364 ms 48940 KB Output is correct
79 Correct 374 ms 48724 KB Output is correct
80 Correct 371 ms 48740 KB Output is correct
81 Correct 348 ms 48140 KB Output is correct
82 Correct 297 ms 45572 KB Output is correct
83 Correct 354 ms 48696 KB Output is correct
84 Correct 402 ms 48728 KB Output is correct
85 Correct 359 ms 48724 KB Output is correct
86 Correct 359 ms 48756 KB Output is correct
87 Correct 365 ms 48200 KB Output is correct
88 Correct 328 ms 45260 KB Output is correct
89 Correct 279 ms 40528 KB Output is correct
90 Correct 263 ms 40916 KB Output is correct
91 Correct 268 ms 42396 KB Output is correct
92 Correct 280 ms 42524 KB Output is correct
93 Correct 312 ms 45160 KB Output is correct
94 Correct 321 ms 43860 KB Output is correct
95 Correct 347 ms 45644 KB Output is correct
96 Correct 382 ms 44432 KB Output is correct
97 Correct 355 ms 45648 KB Output is correct
98 Correct 358 ms 47952 KB Output is correct
99 Correct 340 ms 45240 KB Output is correct
100 Correct 341 ms 45392 KB Output is correct