oj.uz

Submission #579125

# Submission time Handle Problem Language Result Execution time Memory
579125 2022-06-18T12:00:09 Z talant117408 Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 171364 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

const int N = 1e5+7;
set <pair <int, ll>> graph[N];
vector <pair <pii, ll>> edges;
vector <vector <ll>> tree(N), lz(N);
vector <pair <int, pii>> eulers[N];
multiset <ll, greater <ll>> to_leaves[N];
int subtree[N], level[N], parent[N][20], timer, par[N];
int n, q;
ll w;

void push(int i, int v, int l, int r) {
    if (lz[i][v] != 0) {
        tree[i][v] += lz[i][v];
        if (l != r) {
            lz[i][v*2] += lz[i][v];
            lz[i][v*2+1] += lz[i][v];
        }
        lz[i][v] = 0;
    }
}

void update(int i, int v, int l, int r, int ql, int qr, ll val) {
    push(i, v, l, r);
    if (ql > r || l > qr) return;
    if (ql <= l && r <= qr) {
        lz[i][v] += val;
        push(i, v, l, r);
        return;
    }
    int mid = (l+r) >> 1;
    update(i, v*2, l, mid, ql, qr, val);
    update(i, v*2+1, mid+1, r, ql, qr, val);
    tree[i][v] = max(tree[i][v*2], tree[i][v*2+1]);
}

ll get(int i, int v, int l, int r, int ql, int qr) {
    push(i, v, l, r);
    if (ql > r || l > qr) return -1e18;
    if (ql <= l && r <= qr) return tree[i][v];
    int mid = (l+r) >> 1;
    return max(get(i, v*2, l, mid, ql, qr), get(i, v*2+1, mid+1, r, ql, qr));
}

void find_subtrees(int v, int p) {
    subtree[v] = 1;
    for (auto to : graph[v]) {
        if (to.first == p || level[to.first]) continue;
        find_subtrees(to.first, v);
        subtree[v] += subtree[to.first];
    }
}

int find_centroid(int v, int p, int saizu) {
    for (auto to : graph[v]) {
        if (to.first == p || level[to.first]) continue;
        if (subtree[to.first]*2 > saizu) return find_centroid(to.first, v, saizu);
    }
    return v;
}

ll tmpddd;
ll ans_tree[N*4];
void ans_update(int v, int l, int r, int pos, ll val) {
    if (l == r) {
        ans_tree[v] = val;
        return;
    }
    int mid = (l+r) >> 1;
    if (pos <= mid) ans_update(v*2, l, mid, pos, val);
    else ans_update(v*2+1, mid+1, r, pos, val);
    ans_tree[v] = max(ans_tree[v*2], ans_tree[v*2+1]);
}

void cnd_dfs(int v, int p, ll dist, int &origin, int &saizu, int &lev, int &origin2) {
    pii range;
    range.first = ++timer;
    tmpddd = max(tmpddd, dist);
    update(origin, 1, 0, saizu-1, timer, timer, dist);
    parent[v][lev] = origin2;
    
    for (auto to : graph[v]) {
        if (to.first == p || level[to.first]) continue;
        cnd_dfs(to.first, v, dist+to.second, origin, saizu, lev, origin2);
    }
    range.second = timer;
    eulers[origin].pb(mp(v, range));
}

void centroid_decomposition(int v, int p = 0, int lev = 1) {
    find_subtrees(v, v);
    auto centroid = find_centroid(v, v, subtree[v]);
    level[centroid] = lev;
    par[centroid] = p;
    
    tree[centroid].resize(subtree[v]*4);
    lz[centroid].resize(subtree[v]*4);
    timer = 0;
    for (auto to : graph[centroid]) {
        if (level[to.first]) continue;
        tmpddd = 0;
        cnd_dfs(to.first, centroid, to.second, centroid, subtree[v], lev, to.first);
        to_leaves[centroid].insert(tmpddd);
    }
    eulers[centroid].pb(mp(centroid, mp(0, timer)));
    sort(all(eulers[centroid]));
    ll res = 0, cnt = 0;
    for (auto to : to_leaves[centroid]) {
        res += to;
        if (++cnt > 1) break;
    }
    ans_update(1, 1, n, centroid, res);
    
    for (auto to : graph[centroid]) {
        if (level[to.first]) continue;
        centroid_decomposition(to.first, centroid, lev+1);
    }
}

void solve() {
    cin >> n >> q >> w;
    for (int i = 0; i < n-1; i++) {
        int a, b;
        ll c;
        cin >> a >> b >> c;
        if (a > b) swap(a, b);
        edges.pb(mp(mp(a, b), c));
        graph[a].insert(mp(b, c));
        graph[b].insert(mp(a, c));
    }
    centroid_decomposition(1);
    ll last = 0;
    while (q--) {
        ll d, e;
        cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w; 
        auto a = edges[d].first.first, b = edges[d].first.second;
        auto &c = edges[d].second;
        if (level[a] > level[b]) swap(a, b);
        auto x = a;
        while (x) {
            {
                auto ita = (*lb(all(eulers[x]), mp(a, mp(0, 0)))).second.first;
                auto itb = (*lb(all(eulers[x]), mp(b, mp(0, 0)))).second.first;
                if (get(x, 1, 0, sz(eulers[x])-1, ita, ita) > get(x, 1, 0, sz(eulers[x])-1, itb, itb)) swap(a, b);
            }
            auto it = lb(all(eulers[x]), mp(b, mp(0, 0)));
            auto range = (*it).second;
            auto pit = lb(all(eulers[x]), mp(parent[b][level[x]], mp(0, 0)));
            auto prange = (*pit).second;
            to_leaves[x].erase(to_leaves[x].find(get(x, 1, 0, sz(eulers[x])-1, prange.first, prange.second)));
            update(x, 1, 0, sz(eulers[x])-1, range.first, range.second, e-c);
            to_leaves[x].insert(get(x, 1, 0, sz(eulers[x])-1, prange.first, prange.second));
            ll res = 0, cnt = 0;
            for (auto to : to_leaves[x]) {
                res += to;
                if (++cnt > 1) break;
            }
            ans_update(1, 1, n, x, res);
            x = par[x];
        }
        cout << ans_tree[1] << endl;
        c = e;
        last = ans_tree[1];
    }
}

int main() {
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}
/*

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16724 KB Output is correct
4 Correct 10 ms 16724 KB Output is correct
5 Correct 9 ms 16792 KB Output is correct
6 Correct 9 ms 16792 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 9 ms 16724 KB Output is correct
9 Correct 9 ms 16728 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 11 ms 16788 KB Output is correct
13 Correct 10 ms 16852 KB Output is correct
14 Correct 10 ms 16800 KB Output is correct
15 Correct 10 ms 16784 KB Output is correct
16 Correct 10 ms 16768 KB Output is correct
17 Correct 10 ms 16788 KB Output is correct
18 Correct 10 ms 16852 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16724 KB Output is correct
4 Correct 10 ms 16724 KB Output is correct
5 Correct 9 ms 16792 KB Output is correct
6 Correct 9 ms 16792 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 9 ms 16724 KB Output is correct
9 Correct 9 ms 16728 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 11 ms 16788 KB Output is correct
13 Correct 10 ms 16852 KB Output is correct
14 Correct 10 ms 16800 KB Output is correct
15 Correct 10 ms 16784 KB Output is correct
16 Correct 10 ms 16768 KB Output is correct
17 Correct 10 ms 16788 KB Output is correct
18 Correct 10 ms 16852 KB Output is correct
19 Correct 39 ms 17688 KB Output is correct
20 Correct 44 ms 17652 KB Output is correct
21 Correct 52 ms 17868 KB Output is correct
22 Correct 57 ms 17952 KB Output is correct
23 Correct 66 ms 21320 KB Output is correct
24 Correct 85 ms 22252 KB Output is correct
25 Correct 106 ms 22684 KB Output is correct
26 Correct 109 ms 23608 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16784 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 11 ms 16724 KB Output is correct
4 Correct 25 ms 17020 KB Output is correct
5 Correct 84 ms 17836 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 10 ms 16980 KB Output is correct
8 Correct 11 ms 16980 KB Output is correct
9 Correct 13 ms 17044 KB Output is correct
10 Correct 39 ms 17236 KB Output is correct
11 Correct 141 ms 18396 KB Output is correct
12 Correct 16 ms 19352 KB Output is correct
13 Correct 18 ms 19356 KB Output is correct
14 Correct 20 ms 19340 KB Output is correct
15 Correct 67 ms 19608 KB Output is correct
16 Correct 221 ms 20728 KB Output is correct
17 Correct 190 ms 67696 KB Output is correct
18 Correct 220 ms 67736 KB Output is correct
19 Correct 203 ms 67816 KB Output is correct
20 Correct 243 ms 68224 KB Output is correct
21 Correct 583 ms 68880 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 17748 KB Output is correct
2 Correct 63 ms 17856 KB Output is correct
3 Correct 233 ms 18444 KB Output is correct
4 Correct 477 ms 19124 KB Output is correct
5 Correct 57 ms 28948 KB Output is correct
6 Correct 137 ms 29116 KB Output is correct
7 Correct 451 ms 29788 KB Output is correct
8 Correct 911 ms 30548 KB Output is correct
9 Correct 263 ms 86340 KB Output is correct
10 Correct 388 ms 86588 KB Output is correct
11 Correct 925 ms 87420 KB Output is correct
12 Correct 1567 ms 87588 KB Output is correct
13 Correct 550 ms 163096 KB Output is correct
14 Correct 715 ms 163236 KB Output is correct
15 Correct 1280 ms 163448 KB Output is correct
16 Correct 2240 ms 164208 KB Output is correct
17 Correct 3327 ms 164084 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3624 ms 137760 KB Output is correct
2 Correct 3775 ms 142760 KB Output is correct
3 Correct 3640 ms 141780 KB Output is correct
4 Correct 3764 ms 142720 KB Output is correct
5 Correct 3754 ms 137156 KB Output is correct
6 Correct 3380 ms 108580 KB Output is correct
7 Execution timed out 5034 ms 171364 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16724 KB Output is correct
4 Correct 10 ms 16724 KB Output is correct
5 Correct 9 ms 16792 KB Output is correct
6 Correct 9 ms 16792 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 9 ms 16724 KB Output is correct
9 Correct 9 ms 16728 KB Output is correct
10 Correct 9 ms 16724 KB Output is correct
11 Correct 9 ms 16724 KB Output is correct
12 Correct 11 ms 16788 KB Output is correct
13 Correct 10 ms 16852 KB Output is correct
14 Correct 10 ms 16800 KB Output is correct
15 Correct 10 ms 16784 KB Output is correct
16 Correct 10 ms 16768 KB Output is correct
17 Correct 10 ms 16788 KB Output is correct
18 Correct 10 ms 16852 KB Output is correct
19 Correct 39 ms 17688 KB Output is correct
20 Correct 44 ms 17652 KB Output is correct
21 Correct 52 ms 17868 KB Output is correct
22 Correct 57 ms 17952 KB Output is correct
23 Correct 66 ms 21320 KB Output is correct
24 Correct 85 ms 22252 KB Output is correct
25 Correct 106 ms 22684 KB Output is correct
26 Correct 109 ms 23608 KB Output is correct
27 Correct 11 ms 16784 KB Output is correct
28 Correct 9 ms 16724 KB Output is correct
29 Correct 11 ms 16724 KB Output is correct
30 Correct 25 ms 17020 KB Output is correct
31 Correct 84 ms 17836 KB Output is correct
32 Correct 8 ms 16724 KB Output is correct
33 Correct 10 ms 16980 KB Output is correct
34 Correct 11 ms 16980 KB Output is correct
35 Correct 13 ms 17044 KB Output is correct
36 Correct 39 ms 17236 KB Output is correct
37 Correct 141 ms 18396 KB Output is correct
38 Correct 16 ms 19352 KB Output is correct
39 Correct 18 ms 19356 KB Output is correct
40 Correct 20 ms 19340 KB Output is correct
41 Correct 67 ms 19608 KB Output is correct
42 Correct 221 ms 20728 KB Output is correct
43 Correct 190 ms 67696 KB Output is correct
44 Correct 220 ms 67736 KB Output is correct
45 Correct 203 ms 67816 KB Output is correct
46 Correct 243 ms 68224 KB Output is correct
47 Correct 583 ms 68880 KB Output is correct
48 Correct 17 ms 17748 KB Output is correct
49 Correct 63 ms 17856 KB Output is correct
50 Correct 233 ms 18444 KB Output is correct
51 Correct 477 ms 19124 KB Output is correct
52 Correct 57 ms 28948 KB Output is correct
53 Correct 137 ms 29116 KB Output is correct
54 Correct 451 ms 29788 KB Output is correct
55 Correct 911 ms 30548 KB Output is correct
56 Correct 263 ms 86340 KB Output is correct
57 Correct 388 ms 86588 KB Output is correct
58 Correct 925 ms 87420 KB Output is correct
59 Correct 1567 ms 87588 KB Output is correct
60 Correct 550 ms 163096 KB Output is correct
61 Correct 715 ms 163236 KB Output is correct
62 Correct 1280 ms 163448 KB Output is correct
63 Correct 2240 ms 164208 KB Output is correct
64 Correct 3327 ms 164084 KB Output is correct
65 Correct 3624 ms 137760 KB Output is correct
66 Correct 3775 ms 142760 KB Output is correct
67 Correct 3640 ms 141780 KB Output is correct
68 Correct 3764 ms 142720 KB Output is correct
69 Correct 3754 ms 137156 KB Output is correct
70 Correct 3380 ms 108580 KB Output is correct
71 Execution timed out 5034 ms 171364 KB Time limit exceeded
72 Halted 0 ms 0 KB -