oj.uz

Submission #938749

# Submission time Handle Problem Language Result Execution time Memory
938749 2024-03-05T13:43:00 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 213 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]);
    }
}
 
inline 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;
}
 
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 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 1 ms 6748 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6752 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 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 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 2 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 2 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 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6752 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 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 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 2 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 6 ms 7004 KB Output is correct
20 Correct 4 ms 6880 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 6 ms 7256 KB Output is correct
25 Correct 6 ms 7260 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 6748 KB Output is correct
4 Correct 8 ms 6748 KB Output is correct
5 Correct 30 ms 6960 KB Output is correct
6 Correct 1 ms 6744 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 9 ms 6848 KB Output is correct
11 Correct 39 ms 7248 KB Output is correct
12 Correct 3 ms 7204 KB Output is correct
13 Correct 2 ms 7004 KB Output is correct
14 Correct 5 ms 7256 KB Output is correct
15 Correct 13 ms 7260 KB Output is correct
16 Correct 51 ms 7536 KB Output is correct
17 Correct 39 ms 37924 KB Output is correct
18 Correct 37 ms 37708 KB Output is correct
19 Correct 31 ms 37704 KB Output is correct
20 Correct 46 ms 37892 KB Output is correct
21 Correct 129 ms 38384 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 22 ms 7004 KB Output is correct
4 Correct 41 ms 7324 KB Output is correct
5 Correct 5 ms 9692 KB Output is correct
6 Correct 10 ms 9704 KB Output is correct
7 Correct 31 ms 9940 KB Output is correct
8 Correct 76 ms 10196 KB Output is correct
9 Correct 23 ms 22636 KB Output is correct
10 Correct 24 ms 22784 KB Output is correct
11 Correct 48 ms 23008 KB Output is correct
12 Correct 78 ms 23120 KB Output is correct
13 Correct 35 ms 38600 KB Output is correct
14 Correct 43 ms 38628 KB Output is correct
15 Correct 71 ms 38844 KB Output is correct
16 Correct 105 ms 39104 KB Output is correct
17 Correct 130 ms 39160 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 39844 KB Output is correct
2 Correct 176 ms 39828 KB Output is correct
3 Correct 156 ms 39872 KB Output is correct
4 Correct 142 ms 39868 KB Output is correct
5 Correct 152 ms 39624 KB Output is correct
6 Correct 127 ms 39452 KB Output is correct
7 Correct 160 ms 43868 KB Output is correct
8 Correct 164 ms 44172 KB Output is correct
9 Correct 184 ms 43896 KB Output is correct
10 Correct 150 ms 43832 KB Output is correct
11 Correct 181 ms 43840 KB Output is correct
12 Correct 127 ms 42416 KB Output is correct
13 Correct 158 ms 50688 KB Output is correct
14 Correct 173 ms 50664 KB Output is correct
15 Correct 160 ms 50740 KB Output is correct
16 Correct 161 ms 50612 KB Output is correct
17 Correct 181 ms 49592 KB Output is correct
18 Correct 162 ms 44864 KB Output is correct
19 Correct 161 ms 50776 KB Output is correct
20 Correct 166 ms 50636 KB Output is correct
21 Correct 164 ms 50608 KB Output is correct
22 Correct 174 ms 50876 KB Output is correct
23 Correct 192 ms 49776 KB Output is correct
24 Correct 138 ms 44704 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 1 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6752 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 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 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 2 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 6 ms 7004 KB Output is correct
20 Correct 4 ms 6880 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 5 ms 7260 KB Output is correct
24 Correct 6 ms 7256 KB Output is correct
25 Correct 6 ms 7260 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 6748 KB Output is correct
30 Correct 8 ms 6748 KB Output is correct
31 Correct 30 ms 6960 KB Output is correct
32 Correct 1 ms 6744 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 9 ms 6848 KB Output is correct
37 Correct 39 ms 7248 KB Output is correct
38 Correct 3 ms 7204 KB Output is correct
39 Correct 2 ms 7004 KB Output is correct
40 Correct 5 ms 7256 KB Output is correct
41 Correct 13 ms 7260 KB Output is correct
42 Correct 51 ms 7536 KB Output is correct
43 Correct 39 ms 37924 KB Output is correct
44 Correct 37 ms 37708 KB Output is correct
45 Correct 31 ms 37704 KB Output is correct
46 Correct 46 ms 37892 KB Output is correct
47 Correct 129 ms 38384 KB Output is correct
48 Correct 2 ms 6748 KB Output is correct
49 Correct 6 ms 6748 KB Output is correct
50 Correct 22 ms 7004 KB Output is correct
51 Correct 41 ms 7324 KB Output is correct
52 Correct 5 ms 9692 KB Output is correct
53 Correct 10 ms 9704 KB Output is correct
54 Correct 31 ms 9940 KB Output is correct
55 Correct 76 ms 10196 KB Output is correct
56 Correct 23 ms 22636 KB Output is correct
57 Correct 24 ms 22784 KB Output is correct
58 Correct 48 ms 23008 KB Output is correct
59 Correct 78 ms 23120 KB Output is correct
60 Correct 35 ms 38600 KB Output is correct
61 Correct 43 ms 38628 KB Output is correct
62 Correct 71 ms 38844 KB Output is correct
63 Correct 105 ms 39104 KB Output is correct
64 Correct 130 ms 39160 KB Output is correct
65 Correct 157 ms 39844 KB Output is correct
66 Correct 176 ms 39828 KB Output is correct
67 Correct 156 ms 39872 KB Output is correct
68 Correct 142 ms 39868 KB Output is correct
69 Correct 152 ms 39624 KB Output is correct
70 Correct 127 ms 39452 KB Output is correct
71 Correct 160 ms 43868 KB Output is correct
72 Correct 164 ms 44172 KB Output is correct
73 Correct 184 ms 43896 KB Output is correct
74 Correct 150 ms 43832 KB Output is correct
75 Correct 181 ms 43840 KB Output is correct
76 Correct 127 ms 42416 KB Output is correct
77 Correct 158 ms 50688 KB Output is correct
78 Correct 173 ms 50664 KB Output is correct
79 Correct 160 ms 50740 KB Output is correct
80 Correct 161 ms 50612 KB Output is correct
81 Correct 181 ms 49592 KB Output is correct
82 Correct 162 ms 44864 KB Output is correct
83 Correct 161 ms 50776 KB Output is correct
84 Correct 166 ms 50636 KB Output is correct
85 Correct 164 ms 50608 KB Output is correct
86 Correct 174 ms 50876 KB Output is correct
87 Correct 192 ms 49776 KB Output is correct
88 Correct 138 ms 44704 KB Output is correct
89 Correct 140 ms 39520 KB Output is correct
90 Correct 155 ms 40168 KB Output is correct
91 Correct 149 ms 42180 KB Output is correct
92 Correct 154 ms 42136 KB Output is correct
93 Correct 178 ms 45960 KB Output is correct
94 Correct 159 ms 44780 KB Output is correct
95 Correct 157 ms 47316 KB Output is correct
96 Correct 160 ms 45724 KB Output is correct
97 Correct 168 ms 47036 KB Output is correct
98 Correct 213 ms 50472 KB Output is correct
99 Correct 169 ms 46932 KB Output is correct
100 Correct 151 ms 46692 KB Output is correct