oj.uz

Submission #730305

# Submission time Handle Problem Language Result Execution time Memory
730305 2023-04-25T15:48:50 Z MilosMilutinovic Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 4639 ms 201428 KB 
/**
 *    author:  wxhtzdy
 *    created: 25.04.2023 16:05:28
**/
#include <bits/stdc++.h>

using namespace std;

struct segtree {
  vector<long long> mx;
  vector<long long> lzy;
  segtree(int n) {
    mx.resize(4 * n);
    lzy.resize(4 * n);
    fill(mx.begin(), mx.end(), 0);
    fill(lzy.begin(), lzy.end(), 0);
  }
  void push(int v) {
    if (2 * v + 1 < mx.size()) {
      mx[2 * v] += lzy[v];
      mx[2 * v + 1] += lzy[v];
      lzy[2 * v] += lzy[v];
      lzy[2 * v + 1] += lzy[v];
    }
    lzy[v] = 0;
  }
  void modify(int v, int l, int r, int ql, int qr, long long x) {
    if (l > qr || r < ql || l > r) {
      return;
    }
    if (ql <= l && r <= qr) {
      lzy[v] += x;
      mx[v] += x;
      push(v);
      return;
    }
    push(v);
    int mid = l + r >> 1;
    modify(2 * v, l, mid, ql, qr, x);
    modify(2 * v + 1, mid + 1, r, ql, qr, x);
    mx[v] = max(mx[2 * v], mx[2 * v + 1]);
  }
  long long query(int v, int l, int r, int ql, int qr) {
    if (l > qr || r < ql || l > r) {
      return 0LL;
    }
    if (ql <= l && r <= qr) {
      return mx[v];
    }
    push(v);
    int mid = l + r >> 1;
    long long L = query(2 * v, l, mid, ql, qr);
    long long R = query(2 * v + 1, mid + 1, r, ql, qr);
    mx[v] = max(mx[2 * v], mx[2 * v + 1]);
    return max(L, R); 
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, q;
  long long W;
  cin >> n >> q >> W;
  vector<vector<pair<int, int>>> g(n);
  vector<int> u(n), v(n);
  vector<long long> w(n);
  for (int i = 0; i < n - 1; i++) {
    cin >> u[i] >> v[i] >> w[i];
    --u[i]; --v[i];
    g[u[i]].emplace_back(v[i], i);
    g[v[i]].emplace_back(u[i], i);    
  }
  vector<bool> rem(n);
  vector<int> sz(n);
  function<void(int, int)> DfsSz = [&](int v, int pv) {
    sz[v] = 1;
    for (auto& p : g[v]) {
      int u = p.first;   
      if (u == pv || rem[u]) {
        continue;
      }
      DfsSz(u, v);
      sz[v] += sz[u];
    }
  };
  function<int(int, int, int)> Cen = [&](int v, int pv, int n) {
    for (auto& p : g[v]) {
      int u = p.first;
      if (u == pv || rem[u] || sz[u] * 2 < n) {
        continue;
      }
      return Cen(u, v, n);
    }
    return v;
  };
  int T;
  vector<vector<int>> tin(n);
  vector<vector<int>> tout(n);
  vector<vector<int>> ids(n);
  vector<vector<int>> sub(n);
  function<void(int, int, int, int)> Dfs = [&](int v, int pv, int cp, int sp) {
    tin[v].push_back(++T);
    sub[v].push_back(sp);
    for (auto& p : g[v]) {
      int u = p.first;
      int i = p.second;
      if (u == pv || rem[u]) {
        continue;
      }
      ids[i].push_back(cp);
      Dfs(u, v, cp, (v == cp ? u : sp));
    }
    tout[v].push_back(T);
  };
  vector<segtree> st(n, segtree(1)); 
  vector<int> len(n);
  vector<vector<int>> ch(n);
  vector<int> dep(n);
  function<void(int, int)> Decompose = [&](int v, int d) {
    DfsSz(v, v);
    v = Cen(v, v, sz[v]);
    dep[v] = d;
    T = -1;
    Dfs(v, v, v, v);
    len[v] = T;
    st[v] = segtree(T + 1);
    rem[v] = true;
    for (auto& p : g[v]) {
      int u = p.first;
      if (!rem[u]) {
        ch[v].push_back(u);
        Decompose(u, d + 1);
      }
    }  
  };
  Decompose(0, 0);
  for (int i = 0; i < n - 1; i++) {
    for (int cp : ids[i]) {
      if (tin[u[i]][dep[cp]] > tin[v[i]][dep[cp]]) {
        swap(u[i], v[i]);
      }
      st[cp].modify(1, 0, len[cp], tin[v[i]][dep[cp]], tout[v[i]][dep[cp]], w[i]);
    }
  }
  multiset<long long> all;
  vector<multiset<long long>> my(n);
  auto Calc = [&](int v) {
    long long s = 0;
    auto it = my[v].end();
    for (int rep = 0; rep < 2; rep++) {
      if (it == my[v].begin()) {
        break;
      }
      it = prev(it);
      s += *it;
    }
    return s;
  };
  for (int i = 0; i < n; i++) {
    my[i].insert(0);
    for (int j : ch[i]) {
      my[i].insert(st[i].query(1, 0, len[i], tin[j][dep[i]], tout[j][dep[i]]));      
    }
    all.insert(Calc(i));
  }
  long long last = 0;
  while (q--) {
    int d;
    long long e;
    cin >> d >> e;
    d = (d + last) % (n - 1);
    e = (e + last) % W;
    for (int cp : ids[d]) {
      all.erase(all.find(Calc(cp)));               
      if (tin[u[d]][dep[cp]] > tin[v[d]][dep[cp]]) {
        swap(u[d], v[d]);  
      }
      my[cp].erase(my[cp].find(st[cp].query(1, 0, len[cp], tin[sub[v[d]][dep[cp]]][dep[cp]], tout[sub[v[d]][dep[cp]]][dep[cp]])));
      st[cp].modify(1, 0, len[cp], tin[v[d]][dep[cp]], tout[v[d]][dep[cp]], e - w[d]);
      my[cp].insert(st[cp].query(1, 0, len[cp], tin[sub[v[d]][dep[cp]]][dep[cp]], tout[sub[v[d]][dep[cp]]][dep[cp]]));
      all.insert(Calc(cp));
    }
    w[d] = e;
    last = *prev(all.end());
    cout << last << '\n';
  } 
  return 0;
}

Compilation message

diameter.cpp: In member function 'void segtree::push(int)':
diameter.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     if (2 * v + 1 < mx.size()) {
      |         ~~~~~~~~~~^~~~~~~~~~~
diameter.cpp: In member function 'void segtree::modify(int, int, int, int, int, long long int)':
diameter.cpp:38:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |     int mid = l + r >> 1;
      |               ~~^~~
diameter.cpp: In member function 'long long int segtree::query(int, int, int, int, int)':
diameter.cpp:51:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |     int mid = l + r >> 1;
      |               ~~^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 22 ms 1364 KB Output is correct
20 Correct 24 ms 1364 KB Output is correct
21 Correct 30 ms 1544 KB Output is correct
22 Correct 29 ms 1696 KB Output is correct
23 Correct 51 ms 5852 KB Output is correct
24 Correct 73 ms 6860 KB Output is correct
25 Correct 81 ms 7456 KB Output is correct
26 Correct 69 ms 8292 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 64 ms 716 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 24 ms 724 KB Output is correct
11 Correct 91 ms 1116 KB Output is correct
12 Correct 9 ms 3924 KB Output is correct
13 Correct 10 ms 3948 KB Output is correct
14 Correct 12 ms 3924 KB Output is correct
15 Correct 38 ms 4072 KB Output is correct
16 Correct 135 ms 4472 KB Output is correct
17 Correct 215 ms 73052 KB Output is correct
18 Correct 207 ms 73072 KB Output is correct
19 Correct 217 ms 73060 KB Output is correct
20 Correct 253 ms 73156 KB Output is correct
21 Correct 510 ms 73736 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1492 KB Output is correct
2 Correct 40 ms 1556 KB Output is correct
3 Correct 156 ms 1836 KB Output is correct
4 Correct 300 ms 2148 KB Output is correct
5 Correct 76 ms 15312 KB Output is correct
6 Correct 117 ms 15488 KB Output is correct
7 Correct 374 ms 15824 KB Output is correct
8 Correct 666 ms 16028 KB Output is correct
9 Correct 317 ms 83488 KB Output is correct
10 Correct 422 ms 83624 KB Output is correct
11 Correct 824 ms 83996 KB Output is correct
12 Correct 1275 ms 84312 KB Output is correct
13 Correct 702 ms 173116 KB Output is correct
14 Correct 858 ms 173048 KB Output is correct
15 Correct 1303 ms 173260 KB Output is correct
16 Correct 1854 ms 173668 KB Output is correct
17 Correct 2920 ms 173816 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3195 ms 149028 KB Output is correct
2 Correct 3405 ms 156176 KB Output is correct
3 Correct 3375 ms 155388 KB Output is correct
4 Correct 3306 ms 155936 KB Output is correct
5 Correct 3181 ms 149700 KB Output is correct
6 Correct 2624 ms 121944 KB Output is correct
7 Correct 4402 ms 182016 KB Output is correct
8 Correct 4367 ms 181824 KB Output is correct
9 Correct 4326 ms 182076 KB Output is correct
10 Correct 4278 ms 181516 KB Output is correct
11 Correct 4244 ms 174380 KB Output is correct
12 Correct 3570 ms 137108 KB Output is correct
13 Correct 4360 ms 201196 KB Output is correct
14 Correct 4329 ms 201304 KB Output is correct
15 Correct 4226 ms 201300 KB Output is correct
16 Correct 4308 ms 200504 KB Output is correct
17 Correct 4091 ms 191196 KB Output is correct
18 Correct 3322 ms 144080 KB Output is correct
19 Correct 4436 ms 201348 KB Output is correct
20 Correct 4447 ms 201336 KB Output is correct
21 Correct 4341 ms 201428 KB Output is correct
22 Correct 4489 ms 200428 KB Output is correct
23 Correct 4046 ms 190996 KB Output is correct
24 Correct 3324 ms 144144 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 22 ms 1364 KB Output is correct
20 Correct 24 ms 1364 KB Output is correct
21 Correct 30 ms 1544 KB Output is correct
22 Correct 29 ms 1696 KB Output is correct
23 Correct 51 ms 5852 KB Output is correct
24 Correct 73 ms 6860 KB Output is correct
25 Correct 81 ms 7456 KB Output is correct
26 Correct 69 ms 8292 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 12 ms 340 KB Output is correct
31 Correct 64 ms 716 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 3 ms 596 KB Output is correct
36 Correct 24 ms 724 KB Output is correct
37 Correct 91 ms 1116 KB Output is correct
38 Correct 9 ms 3924 KB Output is correct
39 Correct 10 ms 3948 KB Output is correct
40 Correct 12 ms 3924 KB Output is correct
41 Correct 38 ms 4072 KB Output is correct
42 Correct 135 ms 4472 KB Output is correct
43 Correct 215 ms 73052 KB Output is correct
44 Correct 207 ms 73072 KB Output is correct
45 Correct 217 ms 73060 KB Output is correct
46 Correct 253 ms 73156 KB Output is correct
47 Correct 510 ms 73736 KB Output is correct
48 Correct 7 ms 1492 KB Output is correct
49 Correct 40 ms 1556 KB Output is correct
50 Correct 156 ms 1836 KB Output is correct
51 Correct 300 ms 2148 KB Output is correct
52 Correct 76 ms 15312 KB Output is correct
53 Correct 117 ms 15488 KB Output is correct
54 Correct 374 ms 15824 KB Output is correct
55 Correct 666 ms 16028 KB Output is correct
56 Correct 317 ms 83488 KB Output is correct
57 Correct 422 ms 83624 KB Output is correct
58 Correct 824 ms 83996 KB Output is correct
59 Correct 1275 ms 84312 KB Output is correct
60 Correct 702 ms 173116 KB Output is correct
61 Correct 858 ms 173048 KB Output is correct
62 Correct 1303 ms 173260 KB Output is correct
63 Correct 1854 ms 173668 KB Output is correct
64 Correct 2920 ms 173816 KB Output is correct
65 Correct 3195 ms 149028 KB Output is correct
66 Correct 3405 ms 156176 KB Output is correct
67 Correct 3375 ms 155388 KB Output is correct
68 Correct 3306 ms 155936 KB Output is correct
69 Correct 3181 ms 149700 KB Output is correct
70 Correct 2624 ms 121944 KB Output is correct
71 Correct 4402 ms 182016 KB Output is correct
72 Correct 4367 ms 181824 KB Output is correct
73 Correct 4326 ms 182076 KB Output is correct
74 Correct 4278 ms 181516 KB Output is correct
75 Correct 4244 ms 174380 KB Output is correct
76 Correct 3570 ms 137108 KB Output is correct
77 Correct 4360 ms 201196 KB Output is correct
78 Correct 4329 ms 201304 KB Output is correct
79 Correct 4226 ms 201300 KB Output is correct
80 Correct 4308 ms 200504 KB Output is correct
81 Correct 4091 ms 191196 KB Output is correct
82 Correct 3322 ms 144080 KB Output is correct
83 Correct 4436 ms 201348 KB Output is correct
84 Correct 4447 ms 201336 KB Output is correct
85 Correct 4341 ms 201428 KB Output is correct
86 Correct 4489 ms 200428 KB Output is correct
87 Correct 4046 ms 190996 KB Output is correct
88 Correct 3324 ms 144144 KB Output is correct
89 Correct 3412 ms 153604 KB Output is correct
90 Correct 3911 ms 163668 KB Output is correct
91 Correct 4380 ms 176548 KB Output is correct
92 Correct 4554 ms 180668 KB Output is correct
93 Correct 4583 ms 187752 KB Output is correct
94 Correct 4639 ms 190704 KB Output is correct
95 Correct 4357 ms 197828 KB Output is correct
96 Correct 4420 ms 196588 KB Output is correct
97 Correct 4387 ms 197600 KB Output is correct
98 Correct 4456 ms 200372 KB Output is correct
99 Correct 4435 ms 197392 KB Output is correct
100 Correct 4353 ms 197300 KB Output is correct