oj.uz

답안 #938734

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938734 2024-03-05T13:32:45 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 203 ms 50804 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6756 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 2 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 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 2 ms 6772 KB Output is correct
14 Correct 1 ms 6744 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 1 ms 6748 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6756 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 2 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 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 2 ms 6772 KB Output is correct
14 Correct 1 ms 6744 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 1 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6792 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 6 ms 7120 KB Output is correct
24 Correct 6 ms 7292 KB Output is correct
25 Correct 6 ms 7260 KB Output is correct
26 Correct 6 ms 7712 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 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 6844 KB Output is correct
5 Correct 31 ms 7004 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 10 ms 6748 KB Output is correct
11 Correct 43 ms 7252 KB Output is correct
12 Correct 3 ms 7132 KB Output is correct
13 Correct 3 ms 7004 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 14 ms 7256 KB Output is correct
16 Correct 63 ms 7504 KB Output is correct
17 Correct 30 ms 37784 KB Output is correct
18 Correct 30 ms 37556 KB Output is correct
19 Correct 31 ms 37708 KB Output is correct
20 Correct 45 ms 37812 KB Output is correct
21 Correct 119 ms 38208 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 6 ms 6744 KB Output is correct
3 Correct 23 ms 7108 KB Output is correct
4 Correct 44 ms 7368 KB Output is correct
5 Correct 5 ms 9692 KB Output is correct
6 Correct 11 ms 9696 KB Output is correct
7 Correct 34 ms 10020 KB Output is correct
8 Correct 60 ms 10064 KB Output is correct
9 Correct 22 ms 23028 KB Output is correct
10 Correct 25 ms 22736 KB Output is correct
11 Correct 57 ms 22956 KB Output is correct
12 Correct 98 ms 23108 KB Output is correct
13 Correct 44 ms 38336 KB Output is correct
14 Correct 43 ms 38600 KB Output is correct
15 Correct 85 ms 39120 KB Output is correct
16 Correct 113 ms 39108 KB Output is correct
17 Correct 115 ms 39160 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 154 ms 39868 KB Output is correct
2 Correct 145 ms 39868 KB Output is correct
3 Correct 146 ms 39872 KB Output is correct
4 Correct 151 ms 39732 KB Output is correct
5 Correct 183 ms 39656 KB Output is correct
6 Correct 128 ms 39428 KB Output is correct
7 Correct 156 ms 43980 KB Output is correct
8 Correct 203 ms 43944 KB Output is correct
9 Correct 154 ms 43892 KB Output is correct
10 Correct 155 ms 43968 KB Output is correct
11 Correct 153 ms 44036 KB Output is correct
12 Correct 131 ms 42424 KB Output is correct
13 Correct 178 ms 50660 KB Output is correct
14 Correct 168 ms 50804 KB Output is correct
15 Correct 165 ms 50724 KB Output is correct
16 Correct 169 ms 50592 KB Output is correct
17 Correct 154 ms 49604 KB Output is correct
18 Correct 129 ms 44864 KB Output is correct
19 Correct 170 ms 50688 KB Output is correct
20 Correct 172 ms 50624 KB Output is correct
21 Correct 182 ms 50692 KB Output is correct
22 Correct 160 ms 50624 KB Output is correct
23 Correct 170 ms 49752 KB Output is correct
24 Correct 132 ms 44820 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6748 KB Output is correct
2 Correct 2 ms 6756 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 2 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 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 2 ms 6772 KB Output is correct
14 Correct 1 ms 6744 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 1 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 4 ms 6792 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 6 ms 7120 KB Output is correct
24 Correct 6 ms 7292 KB Output is correct
25 Correct 6 ms 7260 KB Output is correct
26 Correct 6 ms 7712 KB Output is correct
27 Correct 1 ms 6744 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 6844 KB Output is correct
31 Correct 31 ms 7004 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 10 ms 6748 KB Output is correct
37 Correct 43 ms 7252 KB Output is correct
38 Correct 3 ms 7132 KB Output is correct
39 Correct 3 ms 7004 KB Output is correct
40 Correct 4 ms 7260 KB Output is correct
41 Correct 14 ms 7256 KB Output is correct
42 Correct 63 ms 7504 KB Output is correct
43 Correct 30 ms 37784 KB Output is correct
44 Correct 30 ms 37556 KB Output is correct
45 Correct 31 ms 37708 KB Output is correct
46 Correct 45 ms 37812 KB Output is correct
47 Correct 119 ms 38208 KB Output is correct
48 Correct 2 ms 6748 KB Output is correct
49 Correct 6 ms 6744 KB Output is correct
50 Correct 23 ms 7108 KB Output is correct
51 Correct 44 ms 7368 KB Output is correct
52 Correct 5 ms 9692 KB Output is correct
53 Correct 11 ms 9696 KB Output is correct
54 Correct 34 ms 10020 KB Output is correct
55 Correct 60 ms 10064 KB Output is correct
56 Correct 22 ms 23028 KB Output is correct
57 Correct 25 ms 22736 KB Output is correct
58 Correct 57 ms 22956 KB Output is correct
59 Correct 98 ms 23108 KB Output is correct
60 Correct 44 ms 38336 KB Output is correct
61 Correct 43 ms 38600 KB Output is correct
62 Correct 85 ms 39120 KB Output is correct
63 Correct 113 ms 39108 KB Output is correct
64 Correct 115 ms 39160 KB Output is correct
65 Correct 154 ms 39868 KB Output is correct
66 Correct 145 ms 39868 KB Output is correct
67 Correct 146 ms 39872 KB Output is correct
68 Correct 151 ms 39732 KB Output is correct
69 Correct 183 ms 39656 KB Output is correct
70 Correct 128 ms 39428 KB Output is correct
71 Correct 156 ms 43980 KB Output is correct
72 Correct 203 ms 43944 KB Output is correct
73 Correct 154 ms 43892 KB Output is correct
74 Correct 155 ms 43968 KB Output is correct
75 Correct 153 ms 44036 KB Output is correct
76 Correct 131 ms 42424 KB Output is correct
77 Correct 178 ms 50660 KB Output is correct
78 Correct 168 ms 50804 KB Output is correct
79 Correct 165 ms 50724 KB Output is correct
80 Correct 169 ms 50592 KB Output is correct
81 Correct 154 ms 49604 KB Output is correct
82 Correct 129 ms 44864 KB Output is correct
83 Correct 170 ms 50688 KB Output is correct
84 Correct 172 ms 50624 KB Output is correct
85 Correct 182 ms 50692 KB Output is correct
86 Correct 160 ms 50624 KB Output is correct
87 Correct 170 ms 49752 KB Output is correct
88 Correct 132 ms 44820 KB Output is correct
89 Correct 141 ms 39356 KB Output is correct
90 Correct 191 ms 39968 KB Output is correct
91 Correct 150 ms 42192 KB Output is correct
92 Correct 146 ms 42176 KB Output is correct
93 Correct 168 ms 46176 KB Output is correct
94 Correct 157 ms 44496 KB Output is correct
95 Correct 164 ms 47292 KB Output is correct
96 Correct 185 ms 46040 KB Output is correct
97 Correct 166 ms 47092 KB Output is correct
98 Correct 172 ms 50368 KB Output is correct
99 Correct 182 ms 46780 KB Output is correct
100 Correct 158 ms 46784 KB Output is correct