oj.uz

Submission #938754

# Submission time Handle Problem Language Result Execution time Memory
938754 2024-03-05T13:45:14 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 256 ms 49416 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;
    res.ans = max(l.ans, max(r.ans, max(l.ul + r.mx + l.sum, l.mx + r.lv - l.sum)));
    res.sum = l.sum + r.sum;
    res.mx = max(l.mx, r.mx + l.sum);
    res.mn = min(l.mn, r.mn + l.sum);
    res.ul = max(l.ul, max(r.ul - l.sum, l.mx - 2 * (r.mn + l.sum)));
    res.lv = max(l.lv, max(r.lv - l.sum, -l.mn * 2 + r.mx + l.sum));
    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 1 ms 6744 KB Output is correct
2 Correct 1 ms 6744 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 6760 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 6900 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6800 KB Output is correct
14 Correct 1 ms 6744 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 6744 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 6760 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 6900 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6800 KB Output is correct
14 Correct 1 ms 6744 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 5 ms 6744 KB Output is correct
21 Correct 5 ms 6748 KB Output is correct
22 Correct 4 ms 6756 KB Output is correct
23 Correct 7 ms 7256 KB Output is correct
24 Correct 8 ms 7260 KB Output is correct
25 Correct 8 ms 7352 KB Output is correct
26 Correct 8 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 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 8 ms 6748 KB Output is correct
5 Correct 37 ms 7140 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 2 ms 6748 KB Output is correct
10 Correct 12 ms 6748 KB Output is correct
11 Correct 55 ms 7252 KB Output is correct
12 Correct 3 ms 7256 KB Output is correct
13 Correct 3 ms 7260 KB Output is correct
14 Correct 4 ms 7268 KB Output is correct
15 Correct 16 ms 7260 KB Output is correct
16 Correct 71 ms 7744 KB Output is correct
17 Correct 34 ms 37700 KB Output is correct
18 Correct 30 ms 37700 KB Output is correct
19 Correct 40 ms 37632 KB Output is correct
20 Correct 53 ms 37856 KB Output is correct
21 Correct 146 ms 38344 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7000 KB Output is correct
2 Correct 8 ms 6804 KB Output is correct
3 Correct 30 ms 7004 KB Output is correct
4 Correct 58 ms 7648 KB Output is correct
5 Correct 5 ms 9692 KB Output is correct
6 Correct 12 ms 9712 KB Output is correct
7 Correct 43 ms 9936 KB Output is correct
8 Correct 80 ms 10196 KB Output is correct
9 Correct 20 ms 22992 KB Output is correct
10 Correct 27 ms 22736 KB Output is correct
11 Correct 65 ms 23036 KB Output is correct
12 Correct 111 ms 23264 KB Output is correct
13 Correct 43 ms 38596 KB Output is correct
14 Correct 49 ms 38408 KB Output is correct
15 Correct 85 ms 38848 KB Output is correct
16 Correct 137 ms 39100 KB Output is correct
17 Correct 147 ms 38968 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 39864 KB Output is correct
2 Correct 178 ms 39872 KB Output is correct
3 Correct 171 ms 39872 KB Output is correct
4 Correct 188 ms 39872 KB Output is correct
5 Correct 161 ms 39736 KB Output is correct
6 Correct 160 ms 39484 KB Output is correct
7 Correct 189 ms 43492 KB Output is correct
8 Correct 175 ms 43344 KB Output is correct
9 Correct 192 ms 43376 KB Output is correct
10 Correct 184 ms 43292 KB Output is correct
11 Correct 168 ms 43076 KB Output is correct
12 Correct 158 ms 41884 KB Output is correct
13 Correct 204 ms 49056 KB Output is correct
14 Correct 212 ms 49372 KB Output is correct
15 Correct 190 ms 49244 KB Output is correct
16 Correct 242 ms 49416 KB Output is correct
17 Correct 178 ms 48332 KB Output is correct
18 Correct 158 ms 44044 KB Output is correct
19 Correct 198 ms 49088 KB Output is correct
20 Correct 197 ms 49088 KB Output is correct
21 Correct 198 ms 49332 KB Output is correct
22 Correct 180 ms 49084 KB Output is correct
23 Correct 179 ms 48324 KB Output is correct
24 Correct 222 ms 44172 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 6744 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 6760 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 6900 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6800 KB Output is correct
14 Correct 1 ms 6744 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 5 ms 6744 KB Output is correct
21 Correct 5 ms 6748 KB Output is correct
22 Correct 4 ms 6756 KB Output is correct
23 Correct 7 ms 7256 KB Output is correct
24 Correct 8 ms 7260 KB Output is correct
25 Correct 8 ms 7352 KB Output is correct
26 Correct 8 ms 7768 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 8 ms 6748 KB Output is correct
31 Correct 37 ms 7140 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 12 ms 6748 KB Output is correct
37 Correct 55 ms 7252 KB Output is correct
38 Correct 3 ms 7256 KB Output is correct
39 Correct 3 ms 7260 KB Output is correct
40 Correct 4 ms 7268 KB Output is correct
41 Correct 16 ms 7260 KB Output is correct
42 Correct 71 ms 7744 KB Output is correct
43 Correct 34 ms 37700 KB Output is correct
44 Correct 30 ms 37700 KB Output is correct
45 Correct 40 ms 37632 KB Output is correct
46 Correct 53 ms 37856 KB Output is correct
47 Correct 146 ms 38344 KB Output is correct
48 Correct 2 ms 7000 KB Output is correct
49 Correct 8 ms 6804 KB Output is correct
50 Correct 30 ms 7004 KB Output is correct
51 Correct 58 ms 7648 KB Output is correct
52 Correct 5 ms 9692 KB Output is correct
53 Correct 12 ms 9712 KB Output is correct
54 Correct 43 ms 9936 KB Output is correct
55 Correct 80 ms 10196 KB Output is correct
56 Correct 20 ms 22992 KB Output is correct
57 Correct 27 ms 22736 KB Output is correct
58 Correct 65 ms 23036 KB Output is correct
59 Correct 111 ms 23264 KB Output is correct
60 Correct 43 ms 38596 KB Output is correct
61 Correct 49 ms 38408 KB Output is correct
62 Correct 85 ms 38848 KB Output is correct
63 Correct 137 ms 39100 KB Output is correct
64 Correct 147 ms 38968 KB Output is correct
65 Correct 182 ms 39864 KB Output is correct
66 Correct 178 ms 39872 KB Output is correct
67 Correct 171 ms 39872 KB Output is correct
68 Correct 188 ms 39872 KB Output is correct
69 Correct 161 ms 39736 KB Output is correct
70 Correct 160 ms 39484 KB Output is correct
71 Correct 189 ms 43492 KB Output is correct
72 Correct 175 ms 43344 KB Output is correct
73 Correct 192 ms 43376 KB Output is correct
74 Correct 184 ms 43292 KB Output is correct
75 Correct 168 ms 43076 KB Output is correct
76 Correct 158 ms 41884 KB Output is correct
77 Correct 204 ms 49056 KB Output is correct
78 Correct 212 ms 49372 KB Output is correct
79 Correct 190 ms 49244 KB Output is correct
80 Correct 242 ms 49416 KB Output is correct
81 Correct 178 ms 48332 KB Output is correct
82 Correct 158 ms 44044 KB Output is correct
83 Correct 198 ms 49088 KB Output is correct
84 Correct 197 ms 49088 KB Output is correct
85 Correct 198 ms 49332 KB Output is correct
86 Correct 180 ms 49084 KB Output is correct
87 Correct 179 ms 48324 KB Output is correct
88 Correct 222 ms 44172 KB Output is correct
89 Correct 171 ms 39584 KB Output is correct
90 Correct 190 ms 40000 KB Output is correct
91 Correct 201 ms 41784 KB Output is correct
92 Correct 199 ms 41660 KB Output is correct
93 Correct 218 ms 45032 KB Output is correct
94 Correct 198 ms 43968 KB Output is correct
95 Correct 214 ms 46120 KB Output is correct
96 Correct 210 ms 45128 KB Output is correct
97 Correct 224 ms 46072 KB Output is correct
98 Correct 256 ms 48920 KB Output is correct
99 Correct 224 ms 45776 KB Output is correct
100 Correct 208 ms 45760 KB Output is correct