oj.uz

Submission #938744

# Submission time Handle Problem Language Result Execution time Memory
938744 2024-03-05T13:37:08 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 210 ms 50716 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]);
    }
}
 
inline 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;
}
 
inline 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]);
}
 
inline 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 3 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6744 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 2 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 6756 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 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 3 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6744 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 2 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 6756 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 6744 KB Output is correct
20 Correct 4 ms 6744 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 8 ms 7260 KB Output is correct
24 Correct 6 ms 7256 KB Output is correct
25 Correct 6 ms 7292 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 6744 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 7 ms 6748 KB Output is correct
5 Correct 33 ms 3164 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 2 ms 2984 KB Output is correct
10 Correct 9 ms 6748 KB Output is correct
11 Correct 39 ms 7128 KB Output is correct
12 Correct 3 ms 7004 KB Output is correct
13 Correct 3 ms 7000 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 18 ms 7508 KB Output is correct
16 Correct 62 ms 7508 KB Output is correct
17 Correct 37 ms 35960 KB Output is correct
18 Correct 39 ms 37704 KB Output is correct
19 Correct 36 ms 37696 KB Output is correct
20 Correct 47 ms 37680 KB Output is correct
21 Correct 142 ms 38472 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 6900 KB Output is correct
3 Correct 22 ms 7124 KB Output is correct
4 Correct 41 ms 7212 KB Output is correct
5 Correct 5 ms 9532 KB Output is correct
6 Correct 10 ms 9512 KB Output is correct
7 Correct 36 ms 9740 KB Output is correct
8 Correct 59 ms 10196 KB Output is correct
9 Correct 22 ms 20936 KB Output is correct
10 Correct 26 ms 20944 KB Output is correct
11 Correct 51 ms 21404 KB Output is correct
12 Correct 79 ms 23112 KB Output is correct
13 Correct 39 ms 36804 KB Output is correct
14 Correct 46 ms 36980 KB Output is correct
15 Correct 76 ms 38800 KB Output is correct
16 Correct 112 ms 37484 KB Output is correct
17 Correct 122 ms 37360 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 38076 KB Output is correct
2 Correct 156 ms 38028 KB Output is correct
3 Correct 159 ms 38072 KB Output is correct
4 Correct 179 ms 38148 KB Output is correct
5 Correct 153 ms 37972 KB Output is correct
6 Correct 136 ms 37864 KB Output is correct
7 Correct 163 ms 42404 KB Output is correct
8 Correct 194 ms 42628 KB Output is correct
9 Correct 161 ms 42256 KB Output is correct
10 Correct 161 ms 42308 KB Output is correct
11 Correct 170 ms 42040 KB Output is correct
12 Correct 165 ms 42308 KB Output is correct
13 Correct 161 ms 48940 KB Output is correct
14 Correct 210 ms 49088 KB Output is correct
15 Correct 164 ms 49128 KB Output is correct
16 Correct 183 ms 48988 KB Output is correct
17 Correct 206 ms 48044 KB Output is correct
18 Correct 157 ms 43328 KB Output is correct
19 Correct 173 ms 50652 KB Output is correct
20 Correct 190 ms 50716 KB Output is correct
21 Correct 187 ms 50620 KB Output is correct
22 Correct 161 ms 50628 KB Output is correct
23 Correct 167 ms 49600 KB Output is correct
24 Correct 141 ms 44868 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6744 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 2 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 6756 KB Output is correct
16 Correct 2 ms 6748 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 4 ms 6744 KB Output is correct
20 Correct 4 ms 6744 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 8 ms 7260 KB Output is correct
24 Correct 6 ms 7256 KB Output is correct
25 Correct 6 ms 7292 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 6744 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 7 ms 6748 KB Output is correct
31 Correct 33 ms 3164 KB Output is correct
32 Correct 1 ms 6744 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 2 ms 2984 KB Output is correct
36 Correct 9 ms 6748 KB Output is correct
37 Correct 39 ms 7128 KB Output is correct
38 Correct 3 ms 7004 KB Output is correct
39 Correct 3 ms 7000 KB Output is correct
40 Correct 4 ms 7260 KB Output is correct
41 Correct 18 ms 7508 KB Output is correct
42 Correct 62 ms 7508 KB Output is correct
43 Correct 37 ms 35960 KB Output is correct
44 Correct 39 ms 37704 KB Output is correct
45 Correct 36 ms 37696 KB Output is correct
46 Correct 47 ms 37680 KB Output is correct
47 Correct 142 ms 38472 KB Output is correct
48 Correct 2 ms 6748 KB Output is correct
49 Correct 6 ms 6900 KB Output is correct
50 Correct 22 ms 7124 KB Output is correct
51 Correct 41 ms 7212 KB Output is correct
52 Correct 5 ms 9532 KB Output is correct
53 Correct 10 ms 9512 KB Output is correct
54 Correct 36 ms 9740 KB Output is correct
55 Correct 59 ms 10196 KB Output is correct
56 Correct 22 ms 20936 KB Output is correct
57 Correct 26 ms 20944 KB Output is correct
58 Correct 51 ms 21404 KB Output is correct
59 Correct 79 ms 23112 KB Output is correct
60 Correct 39 ms 36804 KB Output is correct
61 Correct 46 ms 36980 KB Output is correct
62 Correct 76 ms 38800 KB Output is correct
63 Correct 112 ms 37484 KB Output is correct
64 Correct 122 ms 37360 KB Output is correct
65 Correct 150 ms 38076 KB Output is correct
66 Correct 156 ms 38028 KB Output is correct
67 Correct 159 ms 38072 KB Output is correct
68 Correct 179 ms 38148 KB Output is correct
69 Correct 153 ms 37972 KB Output is correct
70 Correct 136 ms 37864 KB Output is correct
71 Correct 163 ms 42404 KB Output is correct
72 Correct 194 ms 42628 KB Output is correct
73 Correct 161 ms 42256 KB Output is correct
74 Correct 161 ms 42308 KB Output is correct
75 Correct 170 ms 42040 KB Output is correct
76 Correct 165 ms 42308 KB Output is correct
77 Correct 161 ms 48940 KB Output is correct
78 Correct 210 ms 49088 KB Output is correct
79 Correct 164 ms 49128 KB Output is correct
80 Correct 183 ms 48988 KB Output is correct
81 Correct 206 ms 48044 KB Output is correct
82 Correct 157 ms 43328 KB Output is correct
83 Correct 173 ms 50652 KB Output is correct
84 Correct 190 ms 50716 KB Output is correct
85 Correct 187 ms 50620 KB Output is correct
86 Correct 161 ms 50628 KB Output is correct
87 Correct 167 ms 49600 KB Output is correct
88 Correct 141 ms 44868 KB Output is correct
89 Correct 150 ms 39356 KB Output is correct
90 Correct 165 ms 40128 KB Output is correct
91 Correct 147 ms 42256 KB Output is correct
92 Correct 151 ms 42176 KB Output is correct
93 Correct 154 ms 46136 KB Output is correct
94 Correct 154 ms 44736 KB Output is correct
95 Correct 160 ms 47260 KB Output is correct
96 Correct 180 ms 45828 KB Output is correct
97 Correct 159 ms 47036 KB Output is correct
98 Correct 166 ms 50368 KB Output is correct
99 Correct 170 ms 46788 KB Output is correct
100 Correct 178 ms 46588 KB Output is correct