oj.uz

Submission #939146

# Submission time Handle Problem Language Result Execution time Memory
939146 2024-03-06T06:14:25 Z Amirreza_Fakhri Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 249 ms 50892 KB 
// In the name of the God
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 1e5+5;

struct D {
    int sum, ans, mx, mn, vl, lv;
} seg[maxn*8];

int n, q, W, w[maxn], in[maxn], out[maxn];
vector <int> vec;
vector <pii> adj[maxn];

void dfs(int v = 0, int p = 0) {
    for (pii e : adj[v]) {
        if (e.F != p) {
            in[e.S] = vec.size(); vec.pb(w[e.S]);
            dfs(e.F, v);
            out[e.S] = vec.size(); vec.pb(-w[e.S]);
        }
    }
}

void relax(int id, int x) {
    seg[id].sum = x;
    seg[id].ans = abs(x);
    seg[id].mx = max(0ll, x);
    seg[id].mn = min(0ll, x);
    seg[id].vl = max(0ll, -2*x);
    seg[id].lv = max(0ll, x);
}

D merge(D l, D r) {
    D res;
    r.mx += l.sum, r.mn += l.sum, r.vl -= l.sum, r.lv -= l.sum;
    res.sum = l.sum+r.sum;
    res.ans = max(max(l.ans, r.ans), max(l.vl+r.mx, l.mx+r.lv));
    res.mx = max(l.mx, r.mx);
    res.mn = min(l.mn, r.mn);
    res.vl = max(max(l.vl, r.vl), l.mx-r.mn*2);
    res.lv = max(max(l.lv, r.lv), -l.mn*2+r.mx);
    return res;
}

void build(int l = 0, int r = 2*n-2, int id = 1) {
    if (l+1 == r) {
        relax(id, vec[l]); return;
    }
    int mid = (l+r)/2;
    build(l, mid, id*2), build(mid, r, id*2+1);
    seg[id] = merge(seg[id*2], seg[id*2+1]);
}

void upd(int i, int x, int l = 0, int r = 2*n-2, int id = 1) {
    if (l+1 == r) {
        relax(id, x); return;
    }
    int mid = (l+r)/2;
    if (i < mid) upd(i, x, l, mid, id*2);
    else upd(i, x, mid, r, id*2+1);
    seg[id] = merge(seg[id*2], seg[id*2+1]);
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> q >> W;
    for (int i = 0; i < n-1; i++) {
        int v, u; cin >> v >> u >> w[i];
        adj[--v].pb(mp(--u, i));
        adj[u].pb(mp(v, i));
    }
    dfs(); build();
    int last = 0;
    while (q--) {
        int d, e; cin >> d >> e;
        d = (d+last)%(n-1), e = (e+last)%W;
        upd(in[d], e), upd(out[d], -e);
        cout << (last = seg[1].ans) << '\n';
    }
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 6 ms 7512 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 7 ms 7512 KB Output is correct
26 Correct 6 ms 7772 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6764 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 7 ms 6884 KB Output is correct
5 Correct 30 ms 7116 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 2 ms 7000 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 10 ms 6744 KB Output is correct
11 Correct 48 ms 7292 KB Output is correct
12 Correct 2 ms 7256 KB Output is correct
13 Correct 3 ms 7260 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 13 ms 7348 KB Output is correct
16 Correct 55 ms 7644 KB Output is correct
17 Correct 29 ms 37712 KB Output is correct
18 Correct 30 ms 37792 KB Output is correct
19 Correct 32 ms 37708 KB Output is correct
20 Correct 45 ms 37712 KB Output is correct
21 Correct 130 ms 38308 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 6 ms 6748 KB Output is correct
3 Correct 23 ms 7004 KB Output is correct
4 Correct 44 ms 7204 KB Output is correct
5 Correct 5 ms 9688 KB Output is correct
6 Correct 10 ms 9692 KB Output is correct
7 Correct 31 ms 9948 KB Output is correct
8 Correct 59 ms 10280 KB Output is correct
9 Correct 18 ms 22736 KB Output is correct
10 Correct 24 ms 22736 KB Output is correct
11 Correct 50 ms 23024 KB Output is correct
12 Correct 89 ms 23280 KB Output is correct
13 Correct 34 ms 38340 KB Output is correct
14 Correct 41 ms 38596 KB Output is correct
15 Correct 71 ms 38852 KB Output is correct
16 Correct 113 ms 39112 KB Output is correct
17 Correct 117 ms 39184 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 39796 KB Output is correct
2 Correct 147 ms 39868 KB Output is correct
3 Correct 150 ms 39872 KB Output is correct
4 Correct 152 ms 39872 KB Output is correct
5 Correct 143 ms 39676 KB Output is correct
6 Correct 167 ms 39512 KB Output is correct
7 Correct 162 ms 43996 KB Output is correct
8 Correct 151 ms 43928 KB Output is correct
9 Correct 152 ms 43984 KB Output is correct
10 Correct 170 ms 44080 KB Output is correct
11 Correct 219 ms 43648 KB Output is correct
12 Correct 175 ms 42496 KB Output is correct
13 Correct 249 ms 50652 KB Output is correct
14 Correct 177 ms 50892 KB Output is correct
15 Correct 171 ms 50752 KB Output is correct
16 Correct 171 ms 50500 KB Output is correct
17 Correct 169 ms 49652 KB Output is correct
18 Correct 149 ms 44880 KB Output is correct
19 Correct 168 ms 50812 KB Output is correct
20 Correct 204 ms 50596 KB Output is correct
21 Correct 216 ms 50708 KB Output is correct
22 Correct 211 ms 50456 KB Output is correct
23 Correct 196 ms 49872 KB Output is correct
24 Correct 175 ms 44956 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 6 ms 7512 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 7 ms 7512 KB Output is correct
26 Correct 6 ms 7772 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6764 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 7 ms 6884 KB Output is correct
31 Correct 30 ms 7116 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 2 ms 7000 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 10 ms 6744 KB Output is correct
37 Correct 48 ms 7292 KB Output is correct
38 Correct 2 ms 7256 KB Output is correct
39 Correct 3 ms 7260 KB Output is correct
40 Correct 4 ms 7260 KB Output is correct
41 Correct 13 ms 7348 KB Output is correct
42 Correct 55 ms 7644 KB Output is correct
43 Correct 29 ms 37712 KB Output is correct
44 Correct 30 ms 37792 KB Output is correct
45 Correct 32 ms 37708 KB Output is correct
46 Correct 45 ms 37712 KB Output is correct
47 Correct 130 ms 38308 KB Output is correct
48 Correct 2 ms 6748 KB Output is correct
49 Correct 6 ms 6748 KB Output is correct
50 Correct 23 ms 7004 KB Output is correct
51 Correct 44 ms 7204 KB Output is correct
52 Correct 5 ms 9688 KB Output is correct
53 Correct 10 ms 9692 KB Output is correct
54 Correct 31 ms 9948 KB Output is correct
55 Correct 59 ms 10280 KB Output is correct
56 Correct 18 ms 22736 KB Output is correct
57 Correct 24 ms 22736 KB Output is correct
58 Correct 50 ms 23024 KB Output is correct
59 Correct 89 ms 23280 KB Output is correct
60 Correct 34 ms 38340 KB Output is correct
61 Correct 41 ms 38596 KB Output is correct
62 Correct 71 ms 38852 KB Output is correct
63 Correct 113 ms 39112 KB Output is correct
64 Correct 117 ms 39184 KB Output is correct
65 Correct 153 ms 39796 KB Output is correct
66 Correct 147 ms 39868 KB Output is correct
67 Correct 150 ms 39872 KB Output is correct
68 Correct 152 ms 39872 KB Output is correct
69 Correct 143 ms 39676 KB Output is correct
70 Correct 167 ms 39512 KB Output is correct
71 Correct 162 ms 43996 KB Output is correct
72 Correct 151 ms 43928 KB Output is correct
73 Correct 152 ms 43984 KB Output is correct
74 Correct 170 ms 44080 KB Output is correct
75 Correct 219 ms 43648 KB Output is correct
76 Correct 175 ms 42496 KB Output is correct
77 Correct 249 ms 50652 KB Output is correct
78 Correct 177 ms 50892 KB Output is correct
79 Correct 171 ms 50752 KB Output is correct
80 Correct 171 ms 50500 KB Output is correct
81 Correct 169 ms 49652 KB Output is correct
82 Correct 149 ms 44880 KB Output is correct
83 Correct 168 ms 50812 KB Output is correct
84 Correct 204 ms 50596 KB Output is correct
85 Correct 216 ms 50708 KB Output is correct
86 Correct 211 ms 50456 KB Output is correct
87 Correct 196 ms 49872 KB Output is correct
88 Correct 175 ms 44956 KB Output is correct
89 Correct 173 ms 39364 KB Output is correct
90 Correct 173 ms 39892 KB Output is correct
91 Correct 177 ms 42092 KB Output is correct
92 Correct 193 ms 42100 KB Output is correct
93 Correct 192 ms 46004 KB Output is correct
94 Correct 194 ms 44744 KB Output is correct
95 Correct 195 ms 47252 KB Output is correct
96 Correct 200 ms 45664 KB Output is correct
97 Correct 203 ms 47156 KB Output is correct
98 Correct 202 ms 50368 KB Output is correct
99 Correct 184 ms 46848 KB Output is correct
100 Correct 182 ms 46692 KB Output is correct