oj.uz

Submission #938752

# Submission time Handle Problem Language Result Execution time Memory
938752 2024-03-05T13:43:33 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 182 ms 50876 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 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 6748 KB Output is correct
5 Correct 1 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 1 ms 6792 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 1 ms 6668 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6576 KB Output is correct
13 Correct 1 ms 6756 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 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 1 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 6748 KB Output is correct
5 Correct 1 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 1 ms 6792 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 1 ms 6668 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6576 KB Output is correct
13 Correct 1 ms 6756 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 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 6748 KB Output is correct
20 Correct 4 ms 6900 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 7260 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 7 ms 7272 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 6748 KB Output is correct
3 Correct 2 ms 6756 KB Output is correct
4 Correct 7 ms 6748 KB Output is correct
5 Correct 30 ms 7160 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6752 KB Output is correct
8 Correct 2 ms 6832 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 10 ms 6760 KB Output is correct
11 Correct 44 ms 7264 KB Output is correct
12 Correct 3 ms 7456 KB Output is correct
13 Correct 2 ms 7512 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 13 ms 7256 KB Output is correct
16 Correct 56 ms 7664 KB Output is correct
17 Correct 29 ms 37784 KB Output is correct
18 Correct 29 ms 37640 KB Output is correct
19 Correct 32 ms 37720 KB Output is correct
20 Correct 45 ms 37700 KB Output is correct
21 Correct 164 ms 38208 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 6 ms 6896 KB Output is correct
3 Correct 23 ms 7000 KB Output is correct
4 Correct 43 ms 7260 KB Output is correct
5 Correct 5 ms 9688 KB Output is correct
6 Correct 10 ms 9688 KB Output is correct
7 Correct 33 ms 9844 KB Output is correct
8 Correct 57 ms 10192 KB Output is correct
9 Correct 18 ms 22736 KB Output is correct
10 Correct 24 ms 22724 KB Output is correct
11 Correct 50 ms 22932 KB Output is correct
12 Correct 82 ms 23232 KB Output is correct
13 Correct 35 ms 38508 KB Output is correct
14 Correct 53 ms 38560 KB Output is correct
15 Correct 71 ms 38848 KB Output is correct
16 Correct 116 ms 38940 KB Output is correct
17 Correct 115 ms 39104 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 39952 KB Output is correct
2 Correct 148 ms 39856 KB Output is correct
3 Correct 169 ms 39868 KB Output is correct
4 Correct 144 ms 39756 KB Output is correct
5 Correct 142 ms 39748 KB Output is correct
6 Correct 125 ms 39520 KB Output is correct
7 Correct 155 ms 43968 KB Output is correct
8 Correct 150 ms 43964 KB Output is correct
9 Correct 150 ms 43968 KB Output is correct
10 Correct 155 ms 43920 KB Output is correct
11 Correct 170 ms 43772 KB Output is correct
12 Correct 126 ms 42312 KB Output is correct
13 Correct 162 ms 50628 KB Output is correct
14 Correct 171 ms 50744 KB Output is correct
15 Correct 171 ms 50652 KB Output is correct
16 Correct 182 ms 50452 KB Output is correct
17 Correct 166 ms 49856 KB Output is correct
18 Correct 134 ms 44860 KB Output is correct
19 Correct 161 ms 50628 KB Output is correct
20 Correct 178 ms 50876 KB Output is correct
21 Correct 164 ms 50624 KB Output is correct
22 Correct 161 ms 50524 KB Output is correct
23 Correct 164 ms 49852 KB Output is correct
24 Correct 134 ms 44720 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 6748 KB Output is correct
5 Correct 1 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 1 ms 6792 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 1 ms 6668 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6576 KB Output is correct
13 Correct 1 ms 6756 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 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 6748 KB Output is correct
20 Correct 4 ms 6900 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 7260 KB Output is correct
24 Correct 6 ms 7260 KB Output is correct
25 Correct 7 ms 7272 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 6748 KB Output is correct
29 Correct 2 ms 6756 KB Output is correct
30 Correct 7 ms 6748 KB Output is correct
31 Correct 30 ms 7160 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 1 ms 6752 KB Output is correct
34 Correct 2 ms 6832 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 10 ms 6760 KB Output is correct
37 Correct 44 ms 7264 KB Output is correct
38 Correct 3 ms 7456 KB Output is correct
39 Correct 2 ms 7512 KB Output is correct
40 Correct 4 ms 7260 KB Output is correct
41 Correct 13 ms 7256 KB Output is correct
42 Correct 56 ms 7664 KB Output is correct
43 Correct 29 ms 37784 KB Output is correct
44 Correct 29 ms 37640 KB Output is correct
45 Correct 32 ms 37720 KB Output is correct
46 Correct 45 ms 37700 KB Output is correct
47 Correct 164 ms 38208 KB Output is correct
48 Correct 2 ms 6744 KB Output is correct
49 Correct 6 ms 6896 KB Output is correct
50 Correct 23 ms 7000 KB Output is correct
51 Correct 43 ms 7260 KB Output is correct
52 Correct 5 ms 9688 KB Output is correct
53 Correct 10 ms 9688 KB Output is correct
54 Correct 33 ms 9844 KB Output is correct
55 Correct 57 ms 10192 KB Output is correct
56 Correct 18 ms 22736 KB Output is correct
57 Correct 24 ms 22724 KB Output is correct
58 Correct 50 ms 22932 KB Output is correct
59 Correct 82 ms 23232 KB Output is correct
60 Correct 35 ms 38508 KB Output is correct
61 Correct 53 ms 38560 KB Output is correct
62 Correct 71 ms 38848 KB Output is correct
63 Correct 116 ms 38940 KB Output is correct
64 Correct 115 ms 39104 KB Output is correct
65 Correct 156 ms 39952 KB Output is correct
66 Correct 148 ms 39856 KB Output is correct
67 Correct 169 ms 39868 KB Output is correct
68 Correct 144 ms 39756 KB Output is correct
69 Correct 142 ms 39748 KB Output is correct
70 Correct 125 ms 39520 KB Output is correct
71 Correct 155 ms 43968 KB Output is correct
72 Correct 150 ms 43964 KB Output is correct
73 Correct 150 ms 43968 KB Output is correct
74 Correct 155 ms 43920 KB Output is correct
75 Correct 170 ms 43772 KB Output is correct
76 Correct 126 ms 42312 KB Output is correct
77 Correct 162 ms 50628 KB Output is correct
78 Correct 171 ms 50744 KB Output is correct
79 Correct 171 ms 50652 KB Output is correct
80 Correct 182 ms 50452 KB Output is correct
81 Correct 166 ms 49856 KB Output is correct
82 Correct 134 ms 44860 KB Output is correct
83 Correct 161 ms 50628 KB Output is correct
84 Correct 178 ms 50876 KB Output is correct
85 Correct 164 ms 50624 KB Output is correct
86 Correct 161 ms 50524 KB Output is correct
87 Correct 164 ms 49852 KB Output is correct
88 Correct 134 ms 44720 KB Output is correct
89 Correct 141 ms 39356 KB Output is correct
90 Correct 143 ms 39968 KB Output is correct
91 Correct 151 ms 42176 KB Output is correct
92 Correct 152 ms 42176 KB Output is correct
93 Correct 153 ms 46016 KB Output is correct
94 Correct 149 ms 44732 KB Output is correct
95 Correct 158 ms 47276 KB Output is correct
96 Correct 164 ms 45760 KB Output is correct
97 Correct 174 ms 47128 KB Output is correct
98 Correct 175 ms 50496 KB Output is correct
99 Correct 168 ms 46792 KB Output is correct
100 Correct 154 ms 46736 KB Output is correct