oj.uz

Submission #938733

# Submission time Handle Problem Language Result Execution time Memory
938733 2024-03-05T13:32:05 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 225 ms 53376 KB 
// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
// #define int long long
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()

const int maxn = 1e5 + 5;
const int inf = 1e9 + 7;
struct D{
    ll ans, sum, mx, mn, ul, lv;
} node[maxn * 8];
ll n, q, W, w[maxn], in[maxn], out[maxn];
vector<pll> adj[maxn];
vector<ll> vec;

void dfs(int v, int p = -1){
    for(auto [u, e]: adj[v]){
        if(u == p) continue;
        in[e] = vec.size();
        vec.pb(w[e]);
        dfs(u, v);
        out[e] = vec.size();
        vec.pb(-w[e]);
    }
}

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

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

void build(int l = 0, int r = vec.size(), int id = 1){
    if(l == r - 1){
        settle(id, vec[l]);
        return;
    }
    int mid = (l + r) / 2;
    build(l, mid, id * 2);
    build(mid, r, id * 2 + 1);
    node[id] = merge(node[id * 2], node[id * 2 + 1]);
}

void upd(int p, ll x, int l = 0, int r = vec.size(), int id = 1){
    if(l == r - 1){
        settle(id, x);
        return;
    }
    int mid = (l + r) / 2;
    if(p < mid) upd(p, x, l, mid, id * 2);
    else upd(p, x, mid, r, id * 2 + 1);
    node[id] = merge(node[id * 2], node[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 u, v; cin >> u >> v >> w[i];
        adj[u].pb(mp(v, i));
        adj[v].pb(mp(u, i));
    }
    dfs(1);
    build();
    ll last = 0;
    while(q--){
        ll d, e; cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % W;
        upd(in[d], e);
        upd(out[d], -e);
        last = node[1].ans;
        cout << last << '\n';
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 6748 KB Output is correct
5 Correct 1 ms 6792 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 2 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 6792 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 6748 KB Output is correct
5 Correct 1 ms 6792 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 2 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 6792 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 5 ms 6748 KB Output is correct
20 Correct 5 ms 6748 KB Output is correct
21 Correct 6 ms 6800 KB Output is correct
22 Correct 5 ms 6748 KB Output is correct
23 Correct 7 ms 7260 KB Output is correct
24 Correct 8 ms 7260 KB Output is correct
25 Correct 7 ms 7260 KB Output is correct
26 Correct 7 ms 7768 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 6796 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 9 ms 6868 KB Output is correct
5 Correct 36 ms 7000 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6744 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 12 ms 6744 KB Output is correct
11 Correct 57 ms 7200 KB Output is correct
12 Correct 3 ms 7260 KB Output is correct
13 Correct 3 ms 7204 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 16 ms 7260 KB Output is correct
16 Correct 72 ms 7768 KB Output is correct
17 Correct 30 ms 37704 KB Output is correct
18 Correct 32 ms 38992 KB Output is correct
19 Correct 33 ms 38852 KB Output is correct
20 Correct 52 ms 39156 KB Output is correct
21 Correct 143 ms 40556 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 8 ms 6944 KB Output is correct
3 Correct 33 ms 7260 KB Output is correct
4 Correct 59 ms 7264 KB Output is correct
5 Correct 5 ms 9692 KB Output is correct
6 Correct 12 ms 9700 KB Output is correct
7 Correct 42 ms 9940 KB Output is correct
8 Correct 79 ms 10268 KB Output is correct
9 Correct 19 ms 22736 KB Output is correct
10 Correct 30 ms 22772 KB Output is correct
11 Correct 70 ms 23096 KB Output is correct
12 Correct 107 ms 23236 KB Output is correct
13 Correct 36 ms 38336 KB Output is correct
14 Correct 46 ms 40132 KB Output is correct
15 Correct 87 ms 40892 KB Output is correct
16 Correct 146 ms 41672 KB Output is correct
17 Correct 144 ms 41592 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 41656 KB Output is correct
2 Correct 207 ms 44140 KB Output is correct
3 Correct 170 ms 43964 KB Output is correct
4 Correct 177 ms 43940 KB Output is correct
5 Correct 204 ms 43792 KB Output is correct
6 Correct 151 ms 43588 KB Output is correct
7 Correct 191 ms 47552 KB Output is correct
8 Correct 196 ms 47456 KB Output is correct
9 Correct 198 ms 47632 KB Output is correct
10 Correct 201 ms 47512 KB Output is correct
11 Correct 174 ms 47364 KB Output is correct
12 Correct 164 ms 46144 KB Output is correct
13 Correct 186 ms 53068 KB Output is correct
14 Correct 194 ms 53308 KB Output is correct
15 Correct 202 ms 53248 KB Output is correct
16 Correct 225 ms 53376 KB Output is correct
17 Correct 199 ms 52504 KB Output is correct
18 Correct 163 ms 48224 KB Output is correct
19 Correct 211 ms 53100 KB Output is correct
20 Correct 183 ms 53204 KB Output is correct
21 Correct 189 ms 53184 KB Output is correct
22 Correct 198 ms 53116 KB Output is correct
23 Correct 197 ms 52356 KB Output is correct
24 Correct 191 ms 48208 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 6748 KB Output is correct
5 Correct 1 ms 6792 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 2 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 6792 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 5 ms 6748 KB Output is correct
20 Correct 5 ms 6748 KB Output is correct
21 Correct 6 ms 6800 KB Output is correct
22 Correct 5 ms 6748 KB Output is correct
23 Correct 7 ms 7260 KB Output is correct
24 Correct 8 ms 7260 KB Output is correct
25 Correct 7 ms 7260 KB Output is correct
26 Correct 7 ms 7768 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6796 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 9 ms 6868 KB Output is correct
31 Correct 36 ms 7000 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 2 ms 6744 KB Output is correct
35 Correct 3 ms 6748 KB Output is correct
36 Correct 12 ms 6744 KB Output is correct
37 Correct 57 ms 7200 KB Output is correct
38 Correct 3 ms 7260 KB Output is correct
39 Correct 3 ms 7204 KB Output is correct
40 Correct 4 ms 7260 KB Output is correct
41 Correct 16 ms 7260 KB Output is correct
42 Correct 72 ms 7768 KB Output is correct
43 Correct 30 ms 37704 KB Output is correct
44 Correct 32 ms 38992 KB Output is correct
45 Correct 33 ms 38852 KB Output is correct
46 Correct 52 ms 39156 KB Output is correct
47 Correct 143 ms 40556 KB Output is correct
48 Correct 2 ms 6748 KB Output is correct
49 Correct 8 ms 6944 KB Output is correct
50 Correct 33 ms 7260 KB Output is correct
51 Correct 59 ms 7264 KB Output is correct
52 Correct 5 ms 9692 KB Output is correct
53 Correct 12 ms 9700 KB Output is correct
54 Correct 42 ms 9940 KB Output is correct
55 Correct 79 ms 10268 KB Output is correct
56 Correct 19 ms 22736 KB Output is correct
57 Correct 30 ms 22772 KB Output is correct
58 Correct 70 ms 23096 KB Output is correct
59 Correct 107 ms 23236 KB Output is correct
60 Correct 36 ms 38336 KB Output is correct
61 Correct 46 ms 40132 KB Output is correct
62 Correct 87 ms 40892 KB Output is correct
63 Correct 146 ms 41672 KB Output is correct
64 Correct 144 ms 41592 KB Output is correct
65 Correct 181 ms 41656 KB Output is correct
66 Correct 207 ms 44140 KB Output is correct
67 Correct 170 ms 43964 KB Output is correct
68 Correct 177 ms 43940 KB Output is correct
69 Correct 204 ms 43792 KB Output is correct
70 Correct 151 ms 43588 KB Output is correct
71 Correct 191 ms 47552 KB Output is correct
72 Correct 196 ms 47456 KB Output is correct
73 Correct 198 ms 47632 KB Output is correct
74 Correct 201 ms 47512 KB Output is correct
75 Correct 174 ms 47364 KB Output is correct
76 Correct 164 ms 46144 KB Output is correct
77 Correct 186 ms 53068 KB Output is correct
78 Correct 194 ms 53308 KB Output is correct
79 Correct 202 ms 53248 KB Output is correct
80 Correct 225 ms 53376 KB Output is correct
81 Correct 199 ms 52504 KB Output is correct
82 Correct 163 ms 48224 KB Output is correct
83 Correct 211 ms 53100 KB Output is correct
84 Correct 183 ms 53204 KB Output is correct
85 Correct 189 ms 53184 KB Output is correct
86 Correct 198 ms 53116 KB Output is correct
87 Correct 197 ms 52356 KB Output is correct
88 Correct 191 ms 48208 KB Output is correct
89 Correct 171 ms 42856 KB Output is correct
90 Correct 191 ms 43404 KB Output is correct
91 Correct 172 ms 45248 KB Output is correct
92 Correct 177 ms 45240 KB Output is correct
93 Correct 173 ms 48700 KB Output is correct
94 Correct 183 ms 47300 KB Output is correct
95 Correct 198 ms 49708 KB Output is correct
96 Correct 184 ms 48320 KB Output is correct
97 Correct 179 ms 49600 KB Output is correct
98 Correct 200 ms 52416 KB Output is correct
99 Correct 183 ms 49540 KB Output is correct
100 Correct 177 ms 49088 KB Output is correct