oj.uz

Submission #730300

# Submission time Handle Problem Language Result Execution time Memory
730300 2023-04-25T15:27:22 Z MilosMilutinovic Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 369548 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, int 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 0;
    }
    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<unordered_map<int, int>> tin(n);
  vector<unordered_map<int, int>> tout(n);
  vector<vector<int>> ids(n);
  vector<unordered_map<int, int>> sub(n);
  function<void(int, int, int, int)> Dfs = [&](int v, int pv, int cp, int sp) {
    tin[cp][v] = ++T;
    sub[cp][v] = 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[cp][v] = T;    
  };
  vector<segtree> st(n, segtree(1)); 
  vector<int> len(n);
  vector<vector<int>> ch(n);
  function<void(int)> Decompose = [&](int v) {
    DfsSz(v, v);
    v = Cen(v, v, sz[v]);
    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);
      }
    }  
  };
  Decompose(0);
  for (int i = 0; i < n - 1; i++) {
    for (int cp : ids[i]) {
      if (tin[cp][u[i]] > tin[cp][v[i]]) {
        swap(u[i], v[i]);
      }
      st[cp].modify(1, 0, len[cp], tin[cp][v[i]], tout[cp][v[i]], 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[i][j], tout[i][j]));      
    }
    all.insert(Calc(i));
  }
  long long last = 0;
  while (q--) {
    int d, 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[cp][u[d]] > tin[cp][v[d]]) {
        swap(u[d], v[d]);  
      }
      my[cp].erase(my[cp].find(st[cp].query(1, 0, len[cp], tin[cp][sub[cp][v[d]]], tout[cp][sub[cp][v[d]]])));
      st[cp].modify(1, 0, len[cp], tin[cp][v[d]], tout[cp][v[d]], e - w[d]);
      my[cp].insert(st[cp].query(1, 0, len[cp], tin[cp][sub[cp][v[d]]], tout[cp][sub[cp][v[d]]]));
      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, 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 0 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 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 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 0 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 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 26 ms 2288 KB Output is correct
20 Correct 29 ms 2424 KB Output is correct
21 Correct 37 ms 2620 KB Output is correct
22 Correct 42 ms 2948 KB Output is correct
23 Correct 73 ms 11028 KB Output is correct
24 Correct 130 ms 13204 KB Output is correct
25 Correct 113 ms 14496 KB Output is correct
26 Correct 146 ms 16276 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 16 ms 356 KB Output is correct
5 Correct 65 ms 640 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 4 ms 968 KB Output is correct
10 Correct 21 ms 1256 KB Output is correct
11 Correct 98 ms 1412 KB Output is correct
12 Correct 12 ms 6664 KB Output is correct
13 Correct 14 ms 6612 KB Output is correct
14 Correct 19 ms 6612 KB Output is correct
15 Correct 42 ms 6740 KB Output is correct
16 Correct 148 ms 7100 KB Output is correct
17 Correct 298 ms 128452 KB Output is correct
18 Correct 382 ms 128392 KB Output is correct
19 Correct 314 ms 128484 KB Output is correct
20 Correct 366 ms 128632 KB Output is correct
21 Correct 688 ms 129008 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2644 KB Output is correct
2 Correct 44 ms 2724 KB Output is correct
3 Correct 201 ms 2884 KB Output is correct
4 Correct 366 ms 3140 KB Output is correct
5 Correct 118 ms 30604 KB Output is correct
6 Correct 202 ms 30668 KB Output is correct
7 Correct 607 ms 30952 KB Output is correct
8 Correct 988 ms 31540 KB Output is correct
9 Correct 752 ms 175100 KB Output is correct
10 Correct 902 ms 175124 KB Output is correct
11 Correct 1484 ms 175468 KB Output is correct
12 Correct 2092 ms 175680 KB Output is correct
13 Correct 1602 ms 368508 KB Output is correct
14 Correct 1795 ms 368664 KB Output is correct
15 Correct 2487 ms 368996 KB Output is correct
16 Correct 3382 ms 369264 KB Output is correct
17 Execution timed out 5031 ms 369548 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5076 ms 301848 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 26 ms 2288 KB Output is correct
20 Correct 29 ms 2424 KB Output is correct
21 Correct 37 ms 2620 KB Output is correct
22 Correct 42 ms 2948 KB Output is correct
23 Correct 73 ms 11028 KB Output is correct
24 Correct 130 ms 13204 KB Output is correct
25 Correct 113 ms 14496 KB Output is correct
26 Correct 146 ms 16276 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 16 ms 356 KB Output is correct
31 Correct 65 ms 640 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 2 ms 852 KB Output is correct
35 Correct 4 ms 968 KB Output is correct
36 Correct 21 ms 1256 KB Output is correct
37 Correct 98 ms 1412 KB Output is correct
38 Correct 12 ms 6664 KB Output is correct
39 Correct 14 ms 6612 KB Output is correct
40 Correct 19 ms 6612 KB Output is correct
41 Correct 42 ms 6740 KB Output is correct
42 Correct 148 ms 7100 KB Output is correct
43 Correct 298 ms 128452 KB Output is correct
44 Correct 382 ms 128392 KB Output is correct
45 Correct 314 ms 128484 KB Output is correct
46 Correct 366 ms 128632 KB Output is correct
47 Correct 688 ms 129008 KB Output is correct
48 Correct 10 ms 2644 KB Output is correct
49 Correct 44 ms 2724 KB Output is correct
50 Correct 201 ms 2884 KB Output is correct
51 Correct 366 ms 3140 KB Output is correct
52 Correct 118 ms 30604 KB Output is correct
53 Correct 202 ms 30668 KB Output is correct
54 Correct 607 ms 30952 KB Output is correct
55 Correct 988 ms 31540 KB Output is correct
56 Correct 752 ms 175100 KB Output is correct
57 Correct 902 ms 175124 KB Output is correct
58 Correct 1484 ms 175468 KB Output is correct
59 Correct 2092 ms 175680 KB Output is correct
60 Correct 1602 ms 368508 KB Output is correct
61 Correct 1795 ms 368664 KB Output is correct
62 Correct 2487 ms 368996 KB Output is correct
63 Correct 3382 ms 369264 KB Output is correct
64 Execution timed out 5031 ms 369548 KB Time limit exceeded
65 Halted 0 ms 0 KB -