oj.uz

답안 #938731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938731 2024-03-05T13:31:00 Z a_l_i_r_e_z_a Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 114 ms 60404 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 * 4];
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 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 1 ms 6748 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 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 1 ms 6792 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 2 ms 6760 KB Output is correct
15 Correct 1 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 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 1 ms 6748 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 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 1 ms 6792 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 2 ms 6760 KB Output is correct
15 Correct 1 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 5 ms 6748 KB Output is correct
20 Correct 5 ms 6804 KB Output is correct
21 Correct 5 ms 6748 KB Output is correct
22 Correct 5 ms 7004 KB Output is correct
23 Correct 7 ms 7260 KB Output is correct
24 Correct 7 ms 7312 KB Output is correct
25 Correct 7 ms 7316 KB Output is correct
26 Correct 7 ms 7772 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 9 ms 7004 KB Output is correct
5 Correct 37 ms 7764 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 6804 KB Output is correct
10 Correct 13 ms 7004 KB Output is correct
11 Correct 57 ms 7972 KB Output is correct
12 Correct 3 ms 7260 KB Output is correct
13 Correct 3 ms 7256 KB Output is correct
14 Correct 4 ms 7260 KB Output is correct
15 Correct 17 ms 7500 KB Output is correct
16 Correct 74 ms 8728 KB Output is correct
17 Runtime error 50 ms 58180 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 7 ms 7004 KB Output is correct
3 Correct 33 ms 7516 KB Output is correct
4 Correct 64 ms 8276 KB Output is correct
5 Correct 5 ms 9688 KB Output is correct
6 Correct 12 ms 9948 KB Output is correct
7 Correct 41 ms 10460 KB Output is correct
8 Correct 78 ms 11384 KB Output is correct
9 Correct 21 ms 23500 KB Output is correct
10 Correct 27 ms 23692 KB Output is correct
11 Correct 73 ms 24320 KB Output is correct
12 Correct 114 ms 25124 KB Output is correct
13 Runtime error 53 ms 60352 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 65 ms 60404 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.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 1 ms 6748 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 1 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 1 ms 6792 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 2 ms 6760 KB Output is correct
15 Correct 1 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 5 ms 6748 KB Output is correct
20 Correct 5 ms 6804 KB Output is correct
21 Correct 5 ms 6748 KB Output is correct
22 Correct 5 ms 7004 KB Output is correct
23 Correct 7 ms 7260 KB Output is correct
24 Correct 7 ms 7312 KB Output is correct
25 Correct 7 ms 7316 KB Output is correct
26 Correct 7 ms 7772 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 9 ms 7004 KB Output is correct
31 Correct 37 ms 7764 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 6748 KB Output is correct
34 Correct 2 ms 6748 KB Output is correct
35 Correct 3 ms 6804 KB Output is correct
36 Correct 13 ms 7004 KB Output is correct
37 Correct 57 ms 7972 KB Output is correct
38 Correct 3 ms 7260 KB Output is correct
39 Correct 3 ms 7256 KB Output is correct
40 Correct 4 ms 7260 KB Output is correct
41 Correct 17 ms 7500 KB Output is correct
42 Correct 74 ms 8728 KB Output is correct
43 Runtime error 50 ms 58180 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -