oj.uz

Submission #557316

# Submission time Handle Problem Language Result Execution time Memory
557316 2022-05-05T06:42:41 Z fatemetmhr Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 1102 ms 67072 KB 
// ~~ Be name khoda ~~ //
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define all(x)    x.begin(), x.end()
#define fi        first
#define se        second
#define pb        push_back
 
const int maxn5 = 1e5 + 10;
const int maxnt = 4e5 + 10;
const ll  inf   = 2e18;
 
 
struct segment_tree{
 
    ll val[maxn5], lazy[maxnt];
    pair <ll, int> mx[maxnt];
 
    inline void build(int l, int r, int v){
        if(r - l == 1){
            mx[v] = {val[l], l};
            return;
        }
        int mid = (l + r) >> 1;
        build(l, mid, v * 2);
        build(mid, r, v * 2 + 1);
        mx[v] = max(mx[v * 2], mx[v * 2 + 1]);
    }
 
    inline void add(int l, int r, int lq, int rq, ll valu, int v){
        if(rq <= l || r <= lq)
            return;
        if(lq <= l && r <= rq){
            lazy[v] += valu;
            mx[v].fi += valu;
            return;
        }
        int mid = (l + r) >> 1;
        add(l, mid, lq, rq, valu, v * 2);
        add(mid, r, lq, rq, valu, v * 2 + 1);
        mx[v] = max(mx[v * 2], mx[v * 2 + 1]);
        mx[v].fi += lazy[v];
    }
 
    inline void update(int l, int r, int id, ll valu, int v){
        if(r - l == 1){
            lazy[v] = 0;
            val[l] = valu;
            mx[v] = {valu, l};
            return;
        }
        int mid = (l + r) >> 1;
        if(id < mid)
            update(l, mid, id, valu - lazy[v], v * 2);
        else
            update(mid, r, id, valu - lazy[v], v * 2 + 1);
        mx[v] = max(mx[v * 2], mx[v * 2 + 1]);
        mx[v].fi += lazy[v];
    }
 
    inline pair<ll, int> get_max(int l, int r, int lq, int rq, int v){
        if(rq <= l || r <= lq)
            return {-inf, 0};
        if(lq <= l && r <= rq)
            return mx[v];
        int mid = (l + r) >> 1;
        auto ans = max(get_max(l, mid, lq, rq, v * 2), get_max(mid, r, lq, rq, v * 2 + 1));
        return {ans.fi + lazy[v], ans.se};
    }
 
 
} fut_seg, hld_seg;
 
int ti = -1, st[maxn5], ft[maxn5], pos = -1, n;
int id[maxn5], big[maxn5], sz[maxn5], top[maxn5], ver[maxn5];
int h[maxn5], f[maxn5], a[maxn5], b[maxn5], retuid[maxn5];
ll hw[maxn5], mxw[maxn5], paredge[maxn5], c[maxn5];
vector <pair<int, ll>> adj[maxn5];
 
inline void dfs_det(int v, int par){
    sz[v] = 1;
    big[v] = -1;
    st[v] = ++ti;
    ver[ti] = v;
    mxw[v] = 0;
    for(auto [u, c] : adj[v]) if(u != par){
        h[u] = h[v] + 1;
        hw[u] = hw[v] + c;
        paredge[u] = c;
        dfs_det(u, v);
        sz[v] += sz[u];
        mxw[v] = max(mxw[v], mxw[u] + c);
        if(big[v] == -1 || sz[big[v]] <= sz[u])
            big[v] = u;
    }
    ft[v] = ti;
    return;
}
 
inline void dfs_hld(int v, int par){
    id[v] = ++pos;
    if(big[v] != -1){
        top[big[v]] = top[v];
        f[big[v]] = f[v];
        dfs_hld(big[v], v);
    }
    ll val = 0;
    for(auto [u, c] : adj[v]) if(u != big[v] && u != par){
        f[u] = v;
        top[u] = u;
        val = max(val, (mxw[u] + c));
        dfs_hld(u, v);
    }
    hld_seg.val[id[v]] = val - hw[v];
    retuid[v] = pos;
    return;
}
 
inline void update(int v, int u){
    if(v == -1)
        return;
    if(u != big[v]){
        ll val = fut_seg.get_max(0, n, st[v], st[big[v]], 1).fi;
        val = max(val, fut_seg.get_max(0, n, ft[big[v]] + 1, ft[v] + 1, 1).fi);
        hld_seg.update(0, n, id[v], val - 2 * fut_seg.get_max(0, n, st[v], st[v] + 1, 1).fi, 1);
    }
    update(f[v], top[v]);
}
 
inline ll get(int v){
    auto tmp = hld_seg.get_max(0, n, id[top[v]], id[v], 1);
    ll res = tmp.fi;
    if(f[v] == -1)
        return res;
    res = max(res, get(f[v]));
    int u = top[v];
    int z = f[v];
    ll ezafe = fut_seg.get_max(0, n, st[z], st[z] + 1, 1).fi;
    ezafe *= 2;
    res = max(res, fut_seg.get_max(0, n, st[z], st[u], 1).fi - ezafe);
    res = max(res, fut_seg.get_max(0, n, ft[u] + 1, ft[z] + 1, 1).fi - ezafe);
    return res;
}
 
 
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
 
    ll w;
    int q; cin >> n >> q >> w;
 
    for(int i = 0; i < n - 1; i++){
        cin >> a[i] >> b[i] >> c[i];
        a[i]--; b[i]--;
        adj[a[i]].pb({b[i], c[i]});
        adj[b[i]].pb({a[i], c[i]});
    }
 
    f[0] = -1;
    top[0] = 0;
    dfs_det(0, -1);
    dfs_hld(0, -1);
    for(int i = 0; i < n; i++)
        fut_seg.val[st[i]] = hw[i];
    fut_seg.build(0, n, 1);
    hld_seg.build(0, n, 1);
 
    ll last = 0;
    for(int i = 0; i < q; i++){
        ll d, e; cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w;
        if(st[a[d]] > st[b[d]])
            swap(a[d], b[d]);
        fut_seg.add(0, n, st[b[d]], ft[b[d]] + 1, e - c[d], 1);
        update(a[d], b[d]);
        hld_seg.add(0, n, id[b[d]], retuid[b[d]] + 1, -e + c[d], 1);
        auto tmp = fut_seg.mx[1];
        int v = ver[tmp.se];
        last = tmp.fi + get(v);
        last = max(last, tmp.fi);
        c[d] = e;
        cout << last << '\n';
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15216 KB Output is correct
2 Correct 7 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 12 ms 15188 KB Output is correct
5 Correct 8 ms 15188 KB Output is correct
6 Correct 13 ms 15212 KB Output is correct
7 Correct 8 ms 15268 KB Output is correct
8 Correct 7 ms 15316 KB Output is correct
9 Correct 8 ms 15188 KB Output is correct
10 Correct 8 ms 15208 KB Output is correct
11 Correct 9 ms 15260 KB Output is correct
12 Correct 8 ms 15316 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 10 ms 15188 KB Output is correct
15 Correct 8 ms 15188 KB Output is correct
16 Correct 8 ms 15212 KB Output is correct
17 Correct 9 ms 15316 KB Output is correct
18 Correct 8 ms 15324 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15216 KB Output is correct
2 Correct 7 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 12 ms 15188 KB Output is correct
5 Correct 8 ms 15188 KB Output is correct
6 Correct 13 ms 15212 KB Output is correct
7 Correct 8 ms 15268 KB Output is correct
8 Correct 7 ms 15316 KB Output is correct
9 Correct 8 ms 15188 KB Output is correct
10 Correct 8 ms 15208 KB Output is correct
11 Correct 9 ms 15260 KB Output is correct
12 Correct 8 ms 15316 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 10 ms 15188 KB Output is correct
15 Correct 8 ms 15188 KB Output is correct
16 Correct 8 ms 15212 KB Output is correct
17 Correct 9 ms 15316 KB Output is correct
18 Correct 8 ms 15324 KB Output is correct
19 Correct 23 ms 15556 KB Output is correct
20 Correct 21 ms 15436 KB Output is correct
21 Correct 17 ms 15628 KB Output is correct
22 Correct 11 ms 15704 KB Output is correct
23 Correct 47 ms 16332 KB Output is correct
24 Correct 25 ms 16452 KB Output is correct
25 Correct 26 ms 16588 KB Output is correct
26 Correct 20 ms 18004 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 15188 KB Output is correct
2 Correct 8 ms 15188 KB Output is correct
3 Correct 9 ms 15212 KB Output is correct
4 Correct 19 ms 15480 KB Output is correct
5 Correct 67 ms 15824 KB Output is correct
6 Correct 8 ms 15188 KB Output is correct
7 Correct 10 ms 15316 KB Output is correct
8 Correct 9 ms 15336 KB Output is correct
9 Correct 12 ms 15344 KB Output is correct
10 Correct 33 ms 15568 KB Output is correct
11 Correct 114 ms 15964 KB Output is correct
12 Correct 17 ms 16132 KB Output is correct
13 Correct 10 ms 16200 KB Output is correct
14 Correct 13 ms 16284 KB Output is correct
15 Correct 39 ms 16388 KB Output is correct
16 Correct 145 ms 17240 KB Output is correct
17 Correct 49 ms 29668 KB Output is correct
18 Correct 51 ms 30364 KB Output is correct
19 Correct 55 ms 32396 KB Output is correct
20 Correct 98 ms 32752 KB Output is correct
21 Correct 280 ms 33180 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 15444 KB Output is correct
2 Correct 39 ms 15536 KB Output is correct
3 Correct 169 ms 15844 KB Output is correct
4 Correct 324 ms 16088 KB Output is correct
5 Correct 17 ms 17400 KB Output is correct
6 Correct 81 ms 17420 KB Output is correct
7 Correct 269 ms 17812 KB Output is correct
8 Correct 596 ms 18080 KB Output is correct
9 Correct 43 ms 24880 KB Output is correct
10 Correct 115 ms 25028 KB Output is correct
11 Correct 437 ms 25296 KB Output is correct
12 Correct 879 ms 25624 KB Output is correct
13 Correct 86 ms 33980 KB Output is correct
14 Correct 170 ms 34480 KB Output is correct
15 Correct 512 ms 34724 KB Output is correct
16 Correct 952 ms 34988 KB Output is correct
17 Correct 1102 ms 33956 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 768 ms 36120 KB Output is correct
2 Correct 882 ms 35892 KB Output is correct
3 Correct 770 ms 35880 KB Output is correct
4 Correct 792 ms 35828 KB Output is correct
5 Correct 833 ms 35300 KB Output is correct
6 Correct 668 ms 33472 KB Output is correct
7 Correct 382 ms 47692 KB Output is correct
8 Correct 467 ms 47664 KB Output is correct
9 Correct 399 ms 47552 KB Output is correct
10 Correct 447 ms 47644 KB Output is correct
11 Correct 447 ms 46932 KB Output is correct
12 Correct 343 ms 42132 KB Output is correct
13 Correct 272 ms 66956 KB Output is correct
14 Correct 266 ms 66972 KB Output is correct
15 Correct 308 ms 66924 KB Output is correct
16 Correct 279 ms 66564 KB Output is correct
17 Correct 281 ms 63432 KB Output is correct
18 Correct 227 ms 48940 KB Output is correct
19 Correct 296 ms 67012 KB Output is correct
20 Correct 292 ms 67000 KB Output is correct
21 Correct 303 ms 67072 KB Output is correct
22 Correct 279 ms 66568 KB Output is correct
23 Correct 286 ms 63436 KB Output is correct
24 Correct 232 ms 48968 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15216 KB Output is correct
2 Correct 7 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 12 ms 15188 KB Output is correct
5 Correct 8 ms 15188 KB Output is correct
6 Correct 13 ms 15212 KB Output is correct
7 Correct 8 ms 15268 KB Output is correct
8 Correct 7 ms 15316 KB Output is correct
9 Correct 8 ms 15188 KB Output is correct
10 Correct 8 ms 15208 KB Output is correct
11 Correct 9 ms 15260 KB Output is correct
12 Correct 8 ms 15316 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 10 ms 15188 KB Output is correct
15 Correct 8 ms 15188 KB Output is correct
16 Correct 8 ms 15212 KB Output is correct
17 Correct 9 ms 15316 KB Output is correct
18 Correct 8 ms 15324 KB Output is correct
19 Correct 23 ms 15556 KB Output is correct
20 Correct 21 ms 15436 KB Output is correct
21 Correct 17 ms 15628 KB Output is correct
22 Correct 11 ms 15704 KB Output is correct
23 Correct 47 ms 16332 KB Output is correct
24 Correct 25 ms 16452 KB Output is correct
25 Correct 26 ms 16588 KB Output is correct
26 Correct 20 ms 18004 KB Output is correct
27 Correct 12 ms 15188 KB Output is correct
28 Correct 8 ms 15188 KB Output is correct
29 Correct 9 ms 15212 KB Output is correct
30 Correct 19 ms 15480 KB Output is correct
31 Correct 67 ms 15824 KB Output is correct
32 Correct 8 ms 15188 KB Output is correct
33 Correct 10 ms 15316 KB Output is correct
34 Correct 9 ms 15336 KB Output is correct
35 Correct 12 ms 15344 KB Output is correct
36 Correct 33 ms 15568 KB Output is correct
37 Correct 114 ms 15964 KB Output is correct
38 Correct 17 ms 16132 KB Output is correct
39 Correct 10 ms 16200 KB Output is correct
40 Correct 13 ms 16284 KB Output is correct
41 Correct 39 ms 16388 KB Output is correct
42 Correct 145 ms 17240 KB Output is correct
43 Correct 49 ms 29668 KB Output is correct
44 Correct 51 ms 30364 KB Output is correct
45 Correct 55 ms 32396 KB Output is correct
46 Correct 98 ms 32752 KB Output is correct
47 Correct 280 ms 33180 KB Output is correct
48 Correct 12 ms 15444 KB Output is correct
49 Correct 39 ms 15536 KB Output is correct
50 Correct 169 ms 15844 KB Output is correct
51 Correct 324 ms 16088 KB Output is correct
52 Correct 17 ms 17400 KB Output is correct
53 Correct 81 ms 17420 KB Output is correct
54 Correct 269 ms 17812 KB Output is correct
55 Correct 596 ms 18080 KB Output is correct
56 Correct 43 ms 24880 KB Output is correct
57 Correct 115 ms 25028 KB Output is correct
58 Correct 437 ms 25296 KB Output is correct
59 Correct 879 ms 25624 KB Output is correct
60 Correct 86 ms 33980 KB Output is correct
61 Correct 170 ms 34480 KB Output is correct
62 Correct 512 ms 34724 KB Output is correct
63 Correct 952 ms 34988 KB Output is correct
64 Correct 1102 ms 33956 KB Output is correct
65 Correct 768 ms 36120 KB Output is correct
66 Correct 882 ms 35892 KB Output is correct
67 Correct 770 ms 35880 KB Output is correct
68 Correct 792 ms 35828 KB Output is correct
69 Correct 833 ms 35300 KB Output is correct
70 Correct 668 ms 33472 KB Output is correct
71 Correct 382 ms 47692 KB Output is correct
72 Correct 467 ms 47664 KB Output is correct
73 Correct 399 ms 47552 KB Output is correct
74 Correct 447 ms 47644 KB Output is correct
75 Correct 447 ms 46932 KB Output is correct
76 Correct 343 ms 42132 KB Output is correct
77 Correct 272 ms 66956 KB Output is correct
78 Correct 266 ms 66972 KB Output is correct
79 Correct 308 ms 66924 KB Output is correct
80 Correct 279 ms 66564 KB Output is correct
81 Correct 281 ms 63432 KB Output is correct
82 Correct 227 ms 48940 KB Output is correct
83 Correct 296 ms 67012 KB Output is correct
84 Correct 292 ms 67000 KB Output is correct
85 Correct 303 ms 67072 KB Output is correct
86 Correct 279 ms 66568 KB Output is correct
87 Correct 286 ms 63436 KB Output is correct
88 Correct 232 ms 48968 KB Output is correct
89 Correct 709 ms 35580 KB Output is correct
90 Correct 672 ms 36616 KB Output is correct
91 Correct 444 ms 42516 KB Output is correct
92 Correct 480 ms 42424 KB Output is correct
93 Correct 368 ms 53680 KB Output is correct
94 Correct 302 ms 49484 KB Output is correct
95 Correct 285 ms 57464 KB Output is correct
96 Correct 269 ms 52724 KB Output is correct
97 Correct 299 ms 56996 KB Output is correct
98 Correct 274 ms 66188 KB Output is correct
99 Correct 308 ms 56024 KB Output is correct
100 Correct 263 ms 55812 KB Output is correct