oj.uz

Submission #557314

# Submission time Handle Problem Language Result Execution time Memory
557314 2022-05-05T06:40:05 Z fatemetmhr Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 1131 ms 70956 KB 
// ~~ Be name khoda ~~ //
 
#include <bits/stdc++.h>
 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2")
 
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};
            //cout << "update for " << l << ' ' << valu << endl;
            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};
        //cout << "seeing futrure " << l << ' ' << r << ' ' << lq << ' '<< rq << ' ' << mx[v].fi << ' ' << mx[v].se << endl;
        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));
        //cout << "hey see this " << l << ' ' << r << ' ' << lq << ' ' << rq << ' ' << ans.fi << ' ' << ans.se << ' ' << lazy[v] << endl;
        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);
    }
    //cout << "ok " << v << ' ' << id[v] << ' ' << val << ' ' << hw[v]  << endl;
    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]){
        //cout << "in case of " << v << ' ' << u << ' ' << st[v] << ' ' << ft[v] << ' ' << st[u] << ' ' << ft[u] << ' ' << st[big[v]] << ' '<< ft[big[v]] << endl;
        ll val = fut_seg.get_max(0, n, st[v], st[big[v]], 1).fi;
        //cout << "a " << val << endl;
        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);
        //cout << "with final value " << val << ' ' << id[v] << ' ' << big[v] << ' ' << fut_seg.get_max(0, n, st[v], st[v] + 1, 1).fi << endl;
        //cout << "done " << endl;
    }
    update(f[v], top[v]);
}
 
inline ll get(int v){
    //cout << "all about getting " << v << ' ' << f[v] << ' ' << top[v] << endl;
    auto tmp = hld_seg.get_max(0, n, id[top[v]], id[v], 1);
    ll res = tmp.fi;
    //cout << tmp.se << endl;
    //cout << res << endl;
    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);
    //cout << "returning " << res << endl;
    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);
 
    //cout << "avale kar " << fut_seg.get_max(0, n, st[9], st[big[9]], 1).fi << endl;
 
    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;
        //cout << "________________query " << d << ' ' << e << endl;
        if(st[a[d]] > st[b[d]])
            swap(a[d], b[d]);
        // a pedar hast
        fut_seg.add(0, n, st[b[d]], ft[b[d]] + 1, e - c[d], 1);
        //cout << "befor update " << endl;
        //cout << "idea of " << st[b[d]] << ' ' << ft[b[d]] << ' ' << b[d] << ' ' << e- c[d] << endl;
        //cout << "max is " << fut_seg.get_max(0, n, st[5], ft[5] + 1, 1).fi << endl;
        update(a[d], b[d]);
        hld_seg.add(0, n, id[b[d]], retuid[b[d]] + 1, -e + c[d], 1);
        //cout << "every time check " << hld_seg.get_max(0, n, id[1], id[1] + 1, 1).fi << endl;
        //cout << "while having " << b[d] << ' ' << id[b[d]] << ' ' << retuid[b[d]] << ' ' << -e + c[d] << endl; 
        auto tmp = fut_seg.mx[1];
        int v = ver[tmp.se];
        //cout << "found " << v << ' ' << tmp.fi << endl;
        last = tmp.fi + get(v);
        //cout << "oh! " << last << endl;
        last = max(last, tmp.fi);
        c[d] = e;
        cout << last << '\n';
    }
}

/*
7 8 16
2 1 9
3 2 3
4 1 11
5 4 15
6 1 4
7 5 7
2 0
4 6
1 6
1 1
5 14
3 13
4 11
1 1
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15188 KB Output is correct
2 Correct 6 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15252 KB Output is correct
5 Correct 7 ms 15224 KB Output is correct
6 Correct 7 ms 15204 KB Output is correct
7 Correct 7 ms 15268 KB Output is correct
8 Correct 7 ms 15188 KB Output is correct
9 Correct 8 ms 15188 KB Output is correct
10 Correct 9 ms 15188 KB Output is correct
11 Correct 7 ms 15188 KB Output is correct
12 Correct 7 ms 15316 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 7 ms 15188 KB Output is correct
15 Correct 6 ms 15188 KB Output is correct
16 Correct 7 ms 15188 KB Output is correct
17 Correct 6 ms 15188 KB Output is correct
18 Correct 8 ms 15316 KB Output is correct
19 Correct 23 ms 15508 KB Output is correct
20 Correct 18 ms 15444 KB Output is correct
21 Correct 15 ms 15472 KB Output is correct
22 Correct 12 ms 15696 KB Output is correct
23 Correct 27 ms 16296 KB Output is correct
24 Correct 28 ms 16412 KB Output is correct
25 Correct 18 ms 16468 KB Output is correct
26 Correct 15 ms 17868 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15260 KB Output is correct
2 Correct 7 ms 15188 KB Output is correct
3 Correct 7 ms 15316 KB Output is correct
4 Correct 17 ms 15364 KB Output is correct
5 Correct 60 ms 15676 KB Output is correct
6 Correct 7 ms 15188 KB Output is correct
7 Correct 7 ms 15316 KB Output is correct
8 Correct 8 ms 15388 KB Output is correct
9 Correct 11 ms 15316 KB Output is correct
10 Correct 30 ms 15444 KB Output is correct
11 Correct 103 ms 15792 KB Output is correct
12 Correct 7 ms 16084 KB Output is correct
13 Correct 9 ms 16212 KB Output is correct
14 Correct 11 ms 16212 KB Output is correct
15 Correct 34 ms 16264 KB Output is correct
16 Correct 138 ms 16956 KB Output is correct
17 Correct 47 ms 30628 KB Output is correct
18 Correct 48 ms 31280 KB Output is correct
19 Correct 50 ms 33360 KB Output is correct
20 Correct 82 ms 33840 KB Output is correct
21 Correct 259 ms 35128 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15488 KB Output is correct
2 Correct 36 ms 15496 KB Output is correct
3 Correct 145 ms 15692 KB Output is correct
4 Correct 304 ms 15956 KB Output is correct
5 Correct 16 ms 17236 KB Output is correct
6 Correct 61 ms 17296 KB Output is correct
7 Correct 270 ms 17512 KB Output is correct
8 Correct 508 ms 18968 KB Output is correct
9 Correct 42 ms 25420 KB Output is correct
10 Correct 110 ms 25696 KB Output is correct
11 Correct 399 ms 26420 KB Output is correct
12 Correct 786 ms 27144 KB Output is correct
13 Correct 66 ms 35324 KB Output is correct
14 Correct 149 ms 35916 KB Output is correct
15 Correct 478 ms 36552 KB Output is correct
16 Correct 933 ms 37324 KB Output is correct
17 Correct 1131 ms 36072 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 759 ms 37488 KB Output is correct
2 Correct 802 ms 39756 KB Output is correct
3 Correct 764 ms 39848 KB Output is correct
4 Correct 820 ms 39724 KB Output is correct
5 Correct 776 ms 39220 KB Output is correct
6 Correct 681 ms 37408 KB Output is correct
7 Correct 401 ms 51432 KB Output is correct
8 Correct 423 ms 51560 KB Output is correct
9 Correct 438 ms 51484 KB Output is correct
10 Correct 421 ms 51404 KB Output is correct
11 Correct 397 ms 50552 KB Output is correct
12 Correct 335 ms 46020 KB Output is correct
13 Correct 234 ms 70884 KB Output is correct
14 Correct 284 ms 70788 KB Output is correct
15 Correct 267 ms 70776 KB Output is correct
16 Correct 302 ms 70592 KB Output is correct
17 Correct 270 ms 67248 KB Output is correct
18 Correct 254 ms 52996 KB Output is correct
19 Correct 242 ms 70732 KB Output is correct
20 Correct 274 ms 70788 KB Output is correct
21 Correct 303 ms 70956 KB Output is correct
22 Correct 324 ms 70476 KB Output is correct
23 Correct 255 ms 67400 KB Output is correct
24 Correct 272 ms 52944 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 15188 KB Output is correct
2 Correct 6 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 7 ms 15252 KB Output is correct
5 Correct 7 ms 15224 KB Output is correct
6 Correct 7 ms 15204 KB Output is correct
7 Correct 7 ms 15268 KB Output is correct
8 Correct 7 ms 15188 KB Output is correct
9 Correct 8 ms 15188 KB Output is correct
10 Correct 9 ms 15188 KB Output is correct
11 Correct 7 ms 15188 KB Output is correct
12 Correct 7 ms 15316 KB Output is correct
13 Correct 7 ms 15188 KB Output is correct
14 Correct 7 ms 15188 KB Output is correct
15 Correct 6 ms 15188 KB Output is correct
16 Correct 7 ms 15188 KB Output is correct
17 Correct 6 ms 15188 KB Output is correct
18 Correct 8 ms 15316 KB Output is correct
19 Correct 23 ms 15508 KB Output is correct
20 Correct 18 ms 15444 KB Output is correct
21 Correct 15 ms 15472 KB Output is correct
22 Correct 12 ms 15696 KB Output is correct
23 Correct 27 ms 16296 KB Output is correct
24 Correct 28 ms 16412 KB Output is correct
25 Correct 18 ms 16468 KB Output is correct
26 Correct 15 ms 17868 KB Output is correct
27 Correct 8 ms 15260 KB Output is correct
28 Correct 7 ms 15188 KB Output is correct
29 Correct 7 ms 15316 KB Output is correct
30 Correct 17 ms 15364 KB Output is correct
31 Correct 60 ms 15676 KB Output is correct
32 Correct 7 ms 15188 KB Output is correct
33 Correct 7 ms 15316 KB Output is correct
34 Correct 8 ms 15388 KB Output is correct
35 Correct 11 ms 15316 KB Output is correct
36 Correct 30 ms 15444 KB Output is correct
37 Correct 103 ms 15792 KB Output is correct
38 Correct 7 ms 16084 KB Output is correct
39 Correct 9 ms 16212 KB Output is correct
40 Correct 11 ms 16212 KB Output is correct
41 Correct 34 ms 16264 KB Output is correct
42 Correct 138 ms 16956 KB Output is correct
43 Correct 47 ms 30628 KB Output is correct
44 Correct 48 ms 31280 KB Output is correct
45 Correct 50 ms 33360 KB Output is correct
46 Correct 82 ms 33840 KB Output is correct
47 Correct 259 ms 35128 KB Output is correct
48 Correct 11 ms 15488 KB Output is correct
49 Correct 36 ms 15496 KB Output is correct
50 Correct 145 ms 15692 KB Output is correct
51 Correct 304 ms 15956 KB Output is correct
52 Correct 16 ms 17236 KB Output is correct
53 Correct 61 ms 17296 KB Output is correct
54 Correct 270 ms 17512 KB Output is correct
55 Correct 508 ms 18968 KB Output is correct
56 Correct 42 ms 25420 KB Output is correct
57 Correct 110 ms 25696 KB Output is correct
58 Correct 399 ms 26420 KB Output is correct
59 Correct 786 ms 27144 KB Output is correct
60 Correct 66 ms 35324 KB Output is correct
61 Correct 149 ms 35916 KB Output is correct
62 Correct 478 ms 36552 KB Output is correct
63 Correct 933 ms 37324 KB Output is correct
64 Correct 1131 ms 36072 KB Output is correct
65 Correct 759 ms 37488 KB Output is correct
66 Correct 802 ms 39756 KB Output is correct
67 Correct 764 ms 39848 KB Output is correct
68 Correct 820 ms 39724 KB Output is correct
69 Correct 776 ms 39220 KB Output is correct
70 Correct 681 ms 37408 KB Output is correct
71 Correct 401 ms 51432 KB Output is correct
72 Correct 423 ms 51560 KB Output is correct
73 Correct 438 ms 51484 KB Output is correct
74 Correct 421 ms 51404 KB Output is correct
75 Correct 397 ms 50552 KB Output is correct
76 Correct 335 ms 46020 KB Output is correct
77 Correct 234 ms 70884 KB Output is correct
78 Correct 284 ms 70788 KB Output is correct
79 Correct 267 ms 70776 KB Output is correct
80 Correct 302 ms 70592 KB Output is correct
81 Correct 270 ms 67248 KB Output is correct
82 Correct 254 ms 52996 KB Output is correct
83 Correct 242 ms 70732 KB Output is correct
84 Correct 274 ms 70788 KB Output is correct
85 Correct 303 ms 70956 KB Output is correct
86 Correct 324 ms 70476 KB Output is correct
87 Correct 255 ms 67400 KB Output is correct
88 Correct 272 ms 52944 KB Output is correct
89 Correct 684 ms 38692 KB Output is correct
90 Correct 565 ms 39920 KB Output is correct
91 Correct 439 ms 45876 KB Output is correct
92 Correct 467 ms 45748 KB Output is correct
93 Correct 323 ms 56868 KB Output is correct
94 Correct 329 ms 52968 KB Output is correct
95 Correct 256 ms 60620 KB Output is correct
96 Correct 270 ms 55940 KB Output is correct
97 Correct 252 ms 60204 KB Output is correct
98 Correct 284 ms 69576 KB Output is correct
99 Correct 260 ms 59172 KB Output is correct
100 Correct 269 ms 59068 KB Output is correct