oj.uz

Submission #768260

# Submission time Handle Problem Language Result Execution time Memory
768260 2023-06-27T20:08:25 Z hazzle Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 2481 ms 168040 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("avx2")

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;

template <typename T>
using prq = priority_queue <T>;

template <typename T>
using pgq = priority_queue <T, vec <T>, greater <T>>;

template <typename T> bool umin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T> bool umax(T &a, T b) { return a < b ? a = b, 1 : 0; }

struct segt{
      int n;
      vec <ll> t, p;
      segt() {}
      segt(int n): n(n), t(4 * n), p(4 * n) {}

      void build(int tl, int tr, int v, vec <ll> &d){
            if (tl + 1 == tr) return void(t[v] = d[tl]);
            int tm = tl + tr >> 1;
            build(tl, tm, v * 2 + 1, d);
            build(tm, tr, v * 2 + 2, d);
            t[v] = max(t[v * 2 + 1], t[v * 2 + 2]);
      }
      void build(vec <ll> &d){
            if (n) build(0, n, 0, d);
      }
      void apply(int v, ll x){
            t[v] += x, p[v] += x;
      }
      void push(int v){
            if (p[v]){
                  for (int i: {v * 2 + 1, v * 2 + 2}){
                        apply(i, p[v]);
                  }
                  p[v] = 0;
            }
      }
      void upd(int l, int r, ll x, int tl, int tr, int v){
            if (l >= r) return;
            if (tl == l && tr == r) return void(apply(v, x));
            push(v);
            int tm = tl + tr >> 1;
            upd(l, min(tm, r), x, tl, tm, v * 2 + 1);
            upd(max(l, tm), r, x, tm, tr, v * 2 + 2);
            t[v] = max(t[v * 2 + 1], t[v * 2 + 2]);
      }
      void upd(int l, int r, ll x){
            if (n) upd(l, r, x, 0, n, 0);
      }
      ll get(int l, int r, int tl, int tr, int v){
            if (l >= r) return 0LL;
            if (tl == l && tr == r) return t[v];
            push(v);
            int tm = tl + tr >> 1;
            return max(get(l, min(tm, r), tl, tm, v * 2 + 1),
                       get(max(l, tm), r, tm, tr, v * 2 + 2));
      }
      ll get(int l, int r){
            if (!n) return 0LL;
            return get(l, r, 0, n, 0);
      }
};

const int N = 1e5 + 42;

vec <pii> g[N];
int us[N], ss[N];

void siz(int u, int p){
      ss[u] = 1;
      for (auto &[v, id]: g[u]) if (v != p && !us[v]){
            siz(v, u), ss[u] += ss[v];
      }
}

int _cen(int u, int p, int n){
      for (auto &[v, id]: g[u]) if (v != p && !us[v]){
            if (2 * ss[v] > n){
                  return _cen(v, u, n);
            }
      }
      return u;
}

int cen(int u){
      siz(u, u);
      return _cen(u, u, ss[u]);
}

ll w[N];
vec <array <int, 4>> ed[N];
multiset <ll, greater <ll>> val[N], s;
segt t[N];
vec <pii> sub[N];

ll get(int u, int i){
      return t[u].get(sub[u][i].fi, sub[u][i].se);
}

ll diam(int u){
      ll res = 0;
      auto it = val[u].begin();
      for (int i = 0; it != val[u].end() && i < 2; ++i, ++it){
            res += *it;
      }
      return res;
}

void upd(int u, int i, int l, int r, ll x){
      s.erase(s.find(diam(u)));
      val[u].erase(val[u].find(get(u, i)));
      t[u].upd(l, r, x);
      val[u].insert(get(u, i));
      s.insert(diam(u));
}

int fi[N], fo[N];
int tmr = 0;
void dfs(int u, int p, int c, int pt, ll h, vec <ll> &d){
      fi[u] = tmr++;
      d.push_back(h);
      for (auto &[v, id]: g[u]) if (v != p && !us[v]){
            dfs(v, u, c, pt, h + w[id], d);
            ed[id].push_back({c, pt, fi[v], fo[v]});
      }
      fo[u] = tmr;
}

void dec(int u){
      us[u] = 1;
      tmr = 0;
      vec <ll> d;
      for (auto &[v, id]: g[u]) if (!us[v]){
            dfs(v, u, u, sz(sub[u]), w[id], d);
            ed[id].push_back({u, sz(sub[u]), fi[v], fo[v]});
            sub[u].push_back({fi[v], fo[v]});
      }
      t[u] = segt(sz(d));
      t[u].build(d);
      for (int i = 0; i < sz(sub[u]); ++i){
            val[u].insert(get(u, i));
      }
      s.insert(diam(u));

      for (auto &[v, id]: g[u]) if (!us[v]){
            dec(cen(v));
      }
}

inline int solve(){
      int n, q; ll W;
      cin >> n >> q >> W;
      for (int i = 0; i < n - 1; ++i){
            int u, v;
            cin >> u >> v >> w[i], --u, --v;
            g[u].push_back({v, i});
            g[v].push_back({u, i});
      }
      dec(cen(0));
      ll ans = 0;
      while(q--){
            int d; ll e;
            cin >> d >> e;
            d = (d + ans) % (n - 1), e = (e + ans) % W;
            for (auto [c, su, l, r]: ed[d]){
                  upd(c, su, l, r, e - w[d]);
            }
            w[d] = e;
            cout << (ans = *s.begin()) << "\n";
      }
      return 0;
}

inline void precalc(){}

signed main(){
      ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
      int tst = 1; //cin >> tst;
      precalc();
      while(tst--) solve();
      return 0;
}

Compilation message

diameter.cpp: In member function 'void segt::build(int, int, int, std::vector<long long int>&)':
diameter.cpp:43:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |             int tm = tl + tr >> 1;
      |                      ~~~^~~~
diameter.cpp: In member function 'void segt::upd(int, int, ll, int, int, int)':
diameter.cpp:66:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |             int tm = tl + tr >> 1;
      |                      ~~~^~~~
diameter.cpp: In member function 'll segt::get(int, int, int, int, int)':
diameter.cpp:78:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |             int tm = tl + tr >> 1;
      |                      ~~~^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 17572 KB Output is correct
2 Correct 9 ms 17564 KB Output is correct
3 Correct 10 ms 17540 KB Output is correct
4 Correct 10 ms 17484 KB Output is correct
5 Correct 9 ms 17492 KB Output is correct
6 Correct 9 ms 17492 KB Output is correct
7 Correct 9 ms 17564 KB Output is correct
8 Correct 12 ms 17492 KB Output is correct
9 Correct 12 ms 17600 KB Output is correct
10 Correct 9 ms 17492 KB Output is correct
11 Correct 9 ms 17560 KB Output is correct
12 Correct 9 ms 17560 KB Output is correct
13 Correct 9 ms 17620 KB Output is correct
14 Correct 9 ms 17560 KB Output is correct
15 Correct 12 ms 17564 KB Output is correct
16 Correct 9 ms 17620 KB Output is correct
17 Correct 11 ms 17620 KB Output is correct
18 Correct 9 ms 17572 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 17572 KB Output is correct
2 Correct 9 ms 17564 KB Output is correct
3 Correct 10 ms 17540 KB Output is correct
4 Correct 10 ms 17484 KB Output is correct
5 Correct 9 ms 17492 KB Output is correct
6 Correct 9 ms 17492 KB Output is correct
7 Correct 9 ms 17564 KB Output is correct
8 Correct 12 ms 17492 KB Output is correct
9 Correct 12 ms 17600 KB Output is correct
10 Correct 9 ms 17492 KB Output is correct
11 Correct 9 ms 17560 KB Output is correct
12 Correct 9 ms 17560 KB Output is correct
13 Correct 9 ms 17620 KB Output is correct
14 Correct 9 ms 17560 KB Output is correct
15 Correct 12 ms 17564 KB Output is correct
16 Correct 9 ms 17620 KB Output is correct
17 Correct 11 ms 17620 KB Output is correct
18 Correct 9 ms 17572 KB Output is correct
19 Correct 24 ms 18276 KB Output is correct
20 Correct 24 ms 18296 KB Output is correct
21 Correct 26 ms 18428 KB Output is correct
22 Correct 26 ms 18600 KB Output is correct
23 Correct 38 ms 21140 KB Output is correct
24 Correct 62 ms 22100 KB Output is correct
25 Correct 46 ms 22748 KB Output is correct
26 Correct 44 ms 23592 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 17564 KB Output is correct
2 Correct 10 ms 17512 KB Output is correct
3 Correct 10 ms 17512 KB Output is correct
4 Correct 18 ms 17712 KB Output is correct
5 Correct 54 ms 18128 KB Output is correct
6 Correct 10 ms 17492 KB Output is correct
7 Correct 9 ms 17696 KB Output is correct
8 Correct 10 ms 17620 KB Output is correct
9 Correct 12 ms 17652 KB Output is correct
10 Correct 22 ms 17876 KB Output is correct
11 Correct 79 ms 18304 KB Output is correct
12 Correct 13 ms 18900 KB Output is correct
13 Correct 14 ms 18940 KB Output is correct
14 Correct 15 ms 18980 KB Output is correct
15 Correct 29 ms 19244 KB Output is correct
16 Correct 94 ms 19660 KB Output is correct
17 Correct 96 ms 44320 KB Output is correct
18 Correct 97 ms 44360 KB Output is correct
19 Correct 104 ms 44376 KB Output is correct
20 Correct 132 ms 44352 KB Output is correct
21 Correct 281 ms 44352 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18388 KB Output is correct
2 Correct 29 ms 18500 KB Output is correct
3 Correct 106 ms 19040 KB Output is correct
4 Correct 197 ms 19660 KB Output is correct
5 Correct 32 ms 28712 KB Output is correct
6 Correct 61 ms 28900 KB Output is correct
7 Correct 206 ms 29388 KB Output is correct
8 Correct 399 ms 30292 KB Output is correct
9 Correct 133 ms 81824 KB Output is correct
10 Correct 175 ms 81944 KB Output is correct
11 Correct 422 ms 82232 KB Output is correct
12 Correct 731 ms 83108 KB Output is correct
13 Correct 264 ms 152556 KB Output is correct
14 Correct 325 ms 152648 KB Output is correct
15 Correct 657 ms 152848 KB Output is correct
16 Correct 1058 ms 153592 KB Output is correct
17 Correct 2098 ms 153424 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1882 ms 124656 KB Output is correct
2 Correct 1932 ms 127732 KB Output is correct
3 Correct 1888 ms 126732 KB Output is correct
4 Correct 1922 ms 127524 KB Output is correct
5 Correct 1869 ms 121280 KB Output is correct
6 Correct 1545 ms 87616 KB Output is correct
7 Correct 2475 ms 153708 KB Output is correct
8 Correct 2481 ms 153820 KB Output is correct
9 Correct 2437 ms 154028 KB Output is correct
10 Correct 2452 ms 153224 KB Output is correct
11 Correct 2357 ms 145352 KB Output is correct
12 Correct 1980 ms 102576 KB Output is correct
13 Correct 2390 ms 164696 KB Output is correct
14 Correct 2336 ms 164780 KB Output is correct
15 Correct 2337 ms 164760 KB Output is correct
16 Correct 2378 ms 164232 KB Output is correct
17 Correct 2245 ms 155648 KB Output is correct
18 Correct 1821 ms 108144 KB Output is correct
19 Correct 2354 ms 164652 KB Output is correct
20 Correct 2369 ms 164632 KB Output is correct
21 Correct 2373 ms 164636 KB Output is correct
22 Correct 2359 ms 164180 KB Output is correct
23 Correct 2261 ms 155788 KB Output is correct
24 Correct 1866 ms 107668 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 17572 KB Output is correct
2 Correct 9 ms 17564 KB Output is correct
3 Correct 10 ms 17540 KB Output is correct
4 Correct 10 ms 17484 KB Output is correct
5 Correct 9 ms 17492 KB Output is correct
6 Correct 9 ms 17492 KB Output is correct
7 Correct 9 ms 17564 KB Output is correct
8 Correct 12 ms 17492 KB Output is correct
9 Correct 12 ms 17600 KB Output is correct
10 Correct 9 ms 17492 KB Output is correct
11 Correct 9 ms 17560 KB Output is correct
12 Correct 9 ms 17560 KB Output is correct
13 Correct 9 ms 17620 KB Output is correct
14 Correct 9 ms 17560 KB Output is correct
15 Correct 12 ms 17564 KB Output is correct
16 Correct 9 ms 17620 KB Output is correct
17 Correct 11 ms 17620 KB Output is correct
18 Correct 9 ms 17572 KB Output is correct
19 Correct 24 ms 18276 KB Output is correct
20 Correct 24 ms 18296 KB Output is correct
21 Correct 26 ms 18428 KB Output is correct
22 Correct 26 ms 18600 KB Output is correct
23 Correct 38 ms 21140 KB Output is correct
24 Correct 62 ms 22100 KB Output is correct
25 Correct 46 ms 22748 KB Output is correct
26 Correct 44 ms 23592 KB Output is correct
27 Correct 9 ms 17564 KB Output is correct
28 Correct 10 ms 17512 KB Output is correct
29 Correct 10 ms 17512 KB Output is correct
30 Correct 18 ms 17712 KB Output is correct
31 Correct 54 ms 18128 KB Output is correct
32 Correct 10 ms 17492 KB Output is correct
33 Correct 9 ms 17696 KB Output is correct
34 Correct 10 ms 17620 KB Output is correct
35 Correct 12 ms 17652 KB Output is correct
36 Correct 22 ms 17876 KB Output is correct
37 Correct 79 ms 18304 KB Output is correct
38 Correct 13 ms 18900 KB Output is correct
39 Correct 14 ms 18940 KB Output is correct
40 Correct 15 ms 18980 KB Output is correct
41 Correct 29 ms 19244 KB Output is correct
42 Correct 94 ms 19660 KB Output is correct
43 Correct 96 ms 44320 KB Output is correct
44 Correct 97 ms 44360 KB Output is correct
45 Correct 104 ms 44376 KB Output is correct
46 Correct 132 ms 44352 KB Output is correct
47 Correct 281 ms 44352 KB Output is correct
48 Correct 12 ms 18388 KB Output is correct
49 Correct 29 ms 18500 KB Output is correct
50 Correct 106 ms 19040 KB Output is correct
51 Correct 197 ms 19660 KB Output is correct
52 Correct 32 ms 28712 KB Output is correct
53 Correct 61 ms 28900 KB Output is correct
54 Correct 206 ms 29388 KB Output is correct
55 Correct 399 ms 30292 KB Output is correct
56 Correct 133 ms 81824 KB Output is correct
57 Correct 175 ms 81944 KB Output is correct
58 Correct 422 ms 82232 KB Output is correct
59 Correct 731 ms 83108 KB Output is correct
60 Correct 264 ms 152556 KB Output is correct
61 Correct 325 ms 152648 KB Output is correct
62 Correct 657 ms 152848 KB Output is correct
63 Correct 1058 ms 153592 KB Output is correct
64 Correct 2098 ms 153424 KB Output is correct
65 Correct 1882 ms 124656 KB Output is correct
66 Correct 1932 ms 127732 KB Output is correct
67 Correct 1888 ms 126732 KB Output is correct
68 Correct 1922 ms 127524 KB Output is correct
69 Correct 1869 ms 121280 KB Output is correct
70 Correct 1545 ms 87616 KB Output is correct
71 Correct 2475 ms 153708 KB Output is correct
72 Correct 2481 ms 153820 KB Output is correct
73 Correct 2437 ms 154028 KB Output is correct
74 Correct 2452 ms 153224 KB Output is correct
75 Correct 2357 ms 145352 KB Output is correct
76 Correct 1980 ms 102576 KB Output is correct
77 Correct 2390 ms 164696 KB Output is correct
78 Correct 2336 ms 164780 KB Output is correct
79 Correct 2337 ms 164760 KB Output is correct
80 Correct 2378 ms 164232 KB Output is correct
81 Correct 2245 ms 155648 KB Output is correct
82 Correct 1821 ms 108144 KB Output is correct
83 Correct 2354 ms 164652 KB Output is correct
84 Correct 2369 ms 164632 KB Output is correct
85 Correct 2373 ms 164636 KB Output is correct
86 Correct 2359 ms 164180 KB Output is correct
87 Correct 2261 ms 155788 KB Output is correct
88 Correct 1866 ms 107668 KB Output is correct
89 Correct 1838 ms 128720 KB Output is correct
90 Correct 2066 ms 140096 KB Output is correct
91 Correct 2373 ms 153120 KB Output is correct
92 Correct 2405 ms 156732 KB Output is correct
93 Correct 2449 ms 161384 KB Output is correct
94 Correct 2362 ms 164744 KB Output is correct
95 Correct 2321 ms 167892 KB Output is correct
96 Correct 2298 ms 167872 KB Output is correct
97 Correct 2292 ms 167828 KB Output is correct
98 Correct 2295 ms 167868 KB Output is correct
99 Correct 2312 ms 167744 KB Output is correct
100 Correct 2279 ms 168040 KB Output is correct