oj.uz

Submission #380938

# Submission time Handle Problem Language Result Execution time Memory
380938 2021-03-23T18:26:13 Z dolphingarlic Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 168584 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
typedef long long ll;
using namespace std;

struct Segtree {
    int sz;
    vector<ll> vals, lazy;

    void push_lazy(int node, int l, int r) {
        vals[node] += lazy[node];
        if (l != r) {
            lazy[node * 2] += lazy[node];
            lazy[node * 2 + 1] += lazy[node];
        }
        lazy[node] = 0;
    }

    void update(int a, int b, ll val, int node, int l, int r) {
        push_lazy(node, l, r);
        if (l > b || r < a) return;
        if (l >= a && r <= b) {
            lazy[node] = val;
            push_lazy(node, l, r);
        } else {
            int mid = (l + r) / 2;
            update(a, b, val, node * 2, l, mid);
            update(a, b, val, node * 2 + 1, mid + 1, r);
            vals[node] = max(vals[node * 2], vals[node * 2 + 1]);
        }
    }

    ll query(int a, int b, int node, int l, int r) {
        push_lazy(node, l, r);
        if (l > b || r < a) return 0;
        if (l >= a && r <= b) return vals[node];
        int mid = (l + r) / 2;
        return max(query(a, b, node * 2, l, mid),
                   query(a, b, node * 2 + 1, mid + 1, r));
    }

    void build(vector<ll> &dists, int node, int l, int r) {
        if (l == r)
            vals[node] = dists[l];
        else {
            int mid = (l + r) / 2;
            build(dists, node * 2, l, mid);
            build(dists, node * 2 + 1, mid + 1, r);
            vals[node] = max(vals[node * 2], vals[node * 2 + 1]);
        }
    }

    void init(vector<ll> &dists) {
        sz = dists.size();
        vals.resize(4 * sz), lazy.resize(4 * sz);
        build(dists, 1, 1, sz);
    }
} segtree[100001];

ll e_weight[100001];
pair<int, int> e_nodes[100001];
vector<pair<int, int>> graph[100001];
bool processed[100001];
int subtree[100001], c_par[100001], c_level[100001];
int tin[18][100001], tout[18][100001], timer;
vector<int> c_timers[100001];
vector<ll> dists;
multiset<ll> ms_all, ms_centroid[100001];

void get_subtree_sizes(int node, int parent = 0) {
    subtree[node] = 1;
    for (pair<int, int> i : graph[node])
        if (i.first != parent && !processed[i.first]) {
            get_subtree_sizes(i.first, node);
            subtree[node] += subtree[i.first];
        }
}

int get_centroid(int node, int parent, int tree_size) {
    for (pair<int, int> i : graph[node])
        if (i.first != parent && !processed[i.first] &&
            subtree[i.first] > tree_size)
            return get_centroid(i.first, node, tree_size);
    return node;
}

ll get_dists(int node, int parent, int level, ll curr_dist) {
    tin[level][node] = ++timer;

    dists.push_back(curr_dist);
    ll ret = curr_dist;
    for (pair<int, int> i : graph[node])
        if (i.first != parent && !processed[i.first])
            ret = max(ret, get_dists(i.first, node, level,
                                     curr_dist + e_weight[i.second]));

    tout[level][node] = timer;

    return ret;
}

void centroid_decomp(int node = 1, int prv_centroid = 0, int level = 0) {
    get_subtree_sizes(node);
    int centroid = get_centroid(node, 0, subtree[node] / 2);
    c_par[centroid] = prv_centroid;
    c_level[centroid] = level;

    dists.clear();
    timer = 0;
    ms_centroid[centroid].insert(0), ms_centroid[centroid].insert(0);
    dists.push_back(0);
    for (pair<int, int> i : graph[centroid])
        if (!processed[i.first]) {
            ms_centroid[centroid].insert(
                get_dists(i.first, centroid, level, e_weight[i.second]));
            c_timers[centroid].push_back(timer);
        }
    tin[level][centroid] = 0, tout[level][centroid] = timer + 1;
    segtree[centroid].init(dists);
    ms_all.insert(*ms_centroid[centroid].rbegin() +
                  *next(ms_centroid[centroid].rbegin()));

    processed[centroid] = true;
    for (pair<int, int> i : graph[centroid])
        if (!processed[i.first]) centroid_decomp(i.first, centroid, level + 1);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    ll w;
    cin >> n >> q >> w;
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v >> e_weight[i];
        graph[u].push_back({v, i});
        graph[v].push_back({u, i});
        e_nodes[i] = {u, v};
    }
    centroid_decomp();

    ll last = 0;
    while (q--) {
        int d;
        ll e;
        cin >> d >> e;
        d = (d + last) % (n - 1), e = (e + last) % w;

        ll delta = e - e_weight[d];
        int u = e_nodes[d].first, v = e_nodes[d].second;
        int node = (c_level[u] < c_level[v] ? u : v);
        while (node) {
            auto lb = lower_bound(
                c_timers[node].begin(), c_timers[node].end(),
                min(tout[c_level[node]][u], tout[c_level[node]][v]));

            ms_all.erase(ms_all.find(*ms_centroid[node].rbegin() +
                                     *next(ms_centroid[node].rbegin())));
            ms_centroid[node].erase(ms_centroid[node].find(segtree[node].query(
                *prev(lb) + 1, *lb, 1, 1, segtree[node].sz)));
            segtree[node].update(
                max(tin[c_level[node]][u], tin[c_level[node]][v]),
                min(tout[c_level[node]][u], tout[c_level[node]][v]), delta, 1,
                1, segtree[node].sz);
            ms_centroid[node].insert(segtree[node].query(*prev(lb) + 1, *lb, 1,
                                                         1, segtree[node].sz));
            ms_all.insert(*ms_centroid[node].rbegin() +
                          *next(ms_centroid[node].rbegin()));

            node = c_par[node];
        }
        e_weight[d] = e;

        last = *ms_all.rbegin();
        cout << last << '\n';
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15340 KB Output is correct
2 Correct 10 ms 15340 KB Output is correct
3 Correct 10 ms 15340 KB Output is correct
4 Correct 10 ms 15340 KB Output is correct
5 Correct 10 ms 15340 KB Output is correct
6 Correct 10 ms 15340 KB Output is correct
7 Correct 10 ms 15340 KB Output is correct
8 Correct 10 ms 15340 KB Output is correct
9 Correct 10 ms 15340 KB Output is correct
10 Correct 10 ms 15340 KB Output is correct
11 Correct 10 ms 15340 KB Output is correct
12 Correct 10 ms 15340 KB Output is correct
13 Correct 10 ms 15340 KB Output is correct
14 Correct 10 ms 15340 KB Output is correct
15 Correct 10 ms 15340 KB Output is correct
16 Correct 10 ms 15340 KB Output is correct
17 Correct 10 ms 15340 KB Output is correct
18 Correct 10 ms 15340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15340 KB Output is correct
2 Correct 10 ms 15340 KB Output is correct
3 Correct 10 ms 15340 KB Output is correct
4 Correct 10 ms 15340 KB Output is correct
5 Correct 10 ms 15340 KB Output is correct
6 Correct 10 ms 15340 KB Output is correct
7 Correct 10 ms 15340 KB Output is correct
8 Correct 10 ms 15340 KB Output is correct
9 Correct 10 ms 15340 KB Output is correct
10 Correct 10 ms 15340 KB Output is correct
11 Correct 10 ms 15340 KB Output is correct
12 Correct 10 ms 15340 KB Output is correct
13 Correct 10 ms 15340 KB Output is correct
14 Correct 10 ms 15340 KB Output is correct
15 Correct 10 ms 15340 KB Output is correct
16 Correct 10 ms 15340 KB Output is correct
17 Correct 10 ms 15340 KB Output is correct
18 Correct 10 ms 15340 KB Output is correct
19 Correct 41 ms 16108 KB Output is correct
20 Correct 37 ms 16108 KB Output is correct
21 Correct 44 ms 16236 KB Output is correct
22 Correct 53 ms 16364 KB Output is correct
23 Correct 60 ms 19436 KB Output is correct
24 Correct 75 ms 20204 KB Output is correct
25 Correct 81 ms 20716 KB Output is correct
26 Correct 87 ms 21484 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 15212 KB Output is correct
2 Correct 10 ms 15212 KB Output is correct
3 Correct 11 ms 15340 KB Output is correct
4 Correct 24 ms 15340 KB Output is correct
5 Correct 82 ms 15724 KB Output is correct
6 Correct 10 ms 15212 KB Output is correct
7 Correct 10 ms 15468 KB Output is correct
8 Correct 10 ms 15468 KB Output is correct
9 Correct 13 ms 15468 KB Output is correct
10 Correct 34 ms 15596 KB Output is correct
11 Correct 129 ms 16140 KB Output is correct
12 Correct 16 ms 17516 KB Output is correct
13 Correct 17 ms 17516 KB Output is correct
14 Correct 20 ms 17476 KB Output is correct
15 Correct 51 ms 17644 KB Output is correct
16 Correct 193 ms 18048 KB Output is correct
17 Correct 159 ms 59232 KB Output is correct
18 Correct 159 ms 59232 KB Output is correct
19 Correct 165 ms 59232 KB Output is correct
20 Correct 232 ms 59360 KB Output is correct
21 Correct 629 ms 59872 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16256 KB Output is correct
2 Correct 55 ms 16236 KB Output is correct
3 Correct 211 ms 16492 KB Output is correct
4 Correct 407 ms 16748 KB Output is correct
5 Correct 45 ms 26476 KB Output is correct
6 Correct 120 ms 26604 KB Output is correct
7 Correct 472 ms 26860 KB Output is correct
8 Correct 906 ms 27372 KB Output is correct
9 Correct 184 ms 79468 KB Output is correct
10 Correct 337 ms 79468 KB Output is correct
11 Correct 974 ms 79852 KB Output is correct
12 Correct 1774 ms 80364 KB Output is correct
13 Correct 363 ms 150368 KB Output is correct
14 Correct 562 ms 150368 KB Output is correct
15 Correct 1384 ms 150772 KB Output is correct
16 Correct 2393 ms 151008 KB Output is correct
17 Correct 4469 ms 150984 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3493 ms 127272 KB Output is correct
2 Correct 3639 ms 130296 KB Output is correct
3 Correct 3560 ms 129044 KB Output is correct
4 Correct 3651 ms 130400 KB Output is correct
5 Correct 3601 ms 125132 KB Output is correct
6 Correct 3462 ms 102112 KB Output is correct
7 Correct 4907 ms 155104 KB Output is correct
8 Correct 4906 ms 154928 KB Output is correct
9 Correct 4801 ms 155084 KB Output is correct
10 Correct 4781 ms 154592 KB Output is correct
11 Correct 4713 ms 149112 KB Output is correct
12 Correct 4519 ms 116448 KB Output is correct
13 Correct 4979 ms 168584 KB Output is correct
14 Execution timed out 5067 ms 168440 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 15340 KB Output is correct
2 Correct 10 ms 15340 KB Output is correct
3 Correct 10 ms 15340 KB Output is correct
4 Correct 10 ms 15340 KB Output is correct
5 Correct 10 ms 15340 KB Output is correct
6 Correct 10 ms 15340 KB Output is correct
7 Correct 10 ms 15340 KB Output is correct
8 Correct 10 ms 15340 KB Output is correct
9 Correct 10 ms 15340 KB Output is correct
10 Correct 10 ms 15340 KB Output is correct
11 Correct 10 ms 15340 KB Output is correct
12 Correct 10 ms 15340 KB Output is correct
13 Correct 10 ms 15340 KB Output is correct
14 Correct 10 ms 15340 KB Output is correct
15 Correct 10 ms 15340 KB Output is correct
16 Correct 10 ms 15340 KB Output is correct
17 Correct 10 ms 15340 KB Output is correct
18 Correct 10 ms 15340 KB Output is correct
19 Correct 41 ms 16108 KB Output is correct
20 Correct 37 ms 16108 KB Output is correct
21 Correct 44 ms 16236 KB Output is correct
22 Correct 53 ms 16364 KB Output is correct
23 Correct 60 ms 19436 KB Output is correct
24 Correct 75 ms 20204 KB Output is correct
25 Correct 81 ms 20716 KB Output is correct
26 Correct 87 ms 21484 KB Output is correct
27 Correct 11 ms 15212 KB Output is correct
28 Correct 10 ms 15212 KB Output is correct
29 Correct 11 ms 15340 KB Output is correct
30 Correct 24 ms 15340 KB Output is correct
31 Correct 82 ms 15724 KB Output is correct
32 Correct 10 ms 15212 KB Output is correct
33 Correct 10 ms 15468 KB Output is correct
34 Correct 10 ms 15468 KB Output is correct
35 Correct 13 ms 15468 KB Output is correct
36 Correct 34 ms 15596 KB Output is correct
37 Correct 129 ms 16140 KB Output is correct
38 Correct 16 ms 17516 KB Output is correct
39 Correct 17 ms 17516 KB Output is correct
40 Correct 20 ms 17476 KB Output is correct
41 Correct 51 ms 17644 KB Output is correct
42 Correct 193 ms 18048 KB Output is correct
43 Correct 159 ms 59232 KB Output is correct
44 Correct 159 ms 59232 KB Output is correct
45 Correct 165 ms 59232 KB Output is correct
46 Correct 232 ms 59360 KB Output is correct
47 Correct 629 ms 59872 KB Output is correct
48 Correct 16 ms 16256 KB Output is correct
49 Correct 55 ms 16236 KB Output is correct
50 Correct 211 ms 16492 KB Output is correct
51 Correct 407 ms 16748 KB Output is correct
52 Correct 45 ms 26476 KB Output is correct
53 Correct 120 ms 26604 KB Output is correct
54 Correct 472 ms 26860 KB Output is correct
55 Correct 906 ms 27372 KB Output is correct
56 Correct 184 ms 79468 KB Output is correct
57 Correct 337 ms 79468 KB Output is correct
58 Correct 974 ms 79852 KB Output is correct
59 Correct 1774 ms 80364 KB Output is correct
60 Correct 363 ms 150368 KB Output is correct
61 Correct 562 ms 150368 KB Output is correct
62 Correct 1384 ms 150772 KB Output is correct
63 Correct 2393 ms 151008 KB Output is correct
64 Correct 4469 ms 150984 KB Output is correct
65 Correct 3493 ms 127272 KB Output is correct
66 Correct 3639 ms 130296 KB Output is correct
67 Correct 3560 ms 129044 KB Output is correct
68 Correct 3651 ms 130400 KB Output is correct
69 Correct 3601 ms 125132 KB Output is correct
70 Correct 3462 ms 102112 KB Output is correct
71 Correct 4907 ms 155104 KB Output is correct
72 Correct 4906 ms 154928 KB Output is correct
73 Correct 4801 ms 155084 KB Output is correct
74 Correct 4781 ms 154592 KB Output is correct
75 Correct 4713 ms 149112 KB Output is correct
76 Correct 4519 ms 116448 KB Output is correct
77 Correct 4979 ms 168584 KB Output is correct
78 Execution timed out 5067 ms 168440 KB Time limit exceeded
79 Halted 0 ms 0 KB -