oj.uz

답안 #658926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658926 2022-11-15T12:40:24 Z dooompy Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 3488 ms 250772 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

#define int ll

struct node {
    int val, lazy;
};

struct update {
    int x, l, r, ql, qr, id, cent, edgeid;
};

struct edge {
    int to; ll cost; int id;
};

vector<update> history[100005];
vector<edge> adj[100005];
int sz[100005];
bool seen[100005];
int timer = 1;
int st[100005], en[100005];
multiset<ll> pathd[100005], total;
int ct = 0;

vector<vector<node>> tree;

ll get() {
    return *prev(total.end());
}

ll calc(multiset<ll> &cur) {
    if (cur.empty()) return 0;
    if (cur.size() == 1) return *cur.begin();

    auto itr = cur.end(); itr--;
    ll sum = *itr; itr--;
    sum += *itr;

    return sum;
}

void predfs(int node, int par = -1) {
    ct++;
    sz[node] = 1;
    for (auto nxt : adj[node]) {
        if (nxt.to == par)continue;
        if (seen[nxt.to]) continue;
        predfs(nxt.to, node);
        sz[node] += sz[nxt.to];
    }
}

int find(int node, int root, int par = -1) {

    for (auto nxt : adj[node]) {
        if (seen[nxt.to]) continue;
        if (nxt.to == par)continue;
        if (sz[nxt.to] > ct / 2) return find(nxt.to, root, node);
    }

    return node;
}

void dfs(int node, int par = -1) {
    st[node] = timer++;

    for (auto nxt : adj[node]) {
        if (seen[nxt.to] || nxt.to == par) continue;
        dfs(nxt.to, node);
    }

    en[node] = timer - 1;
}

void pushdown(int x, int l, int r, int id) {
    if (l == r) return;

    tree[id][2 * x].val += tree[id][x].lazy;
    tree[id][2 * x].lazy += tree[id][x].lazy;
    tree[id][2 * x + 1].val += tree[id][x].lazy;
    tree[id][2 * x + 1].lazy += tree[id][x].lazy;

    tree[id][x].lazy = 0;
}

void update(int x, int l, int r, int ql, int qr, int id, int cent, int v) {
    if (ql <= l && r <= qr) {
        if (x == 1) {
            pathd[cent].erase(pathd[cent].find(tree[id][x].val));
        }

        tree[id][x].val += v;
        tree[id][x].lazy += v;

        if (x == 1) {
            pathd[cent].insert(tree[id][x].val);
        }
        return;
    }

    if (l > qr || ql > r) return;

    pushdown(x, l, r, id);
    int mid = (l + r) / 2;

    update(2 * x, l, mid, ql, qr, id, cent, v);
    update(2 * x + 1, mid + 1, r, ql, qr, id, cent, v);

    if (x == 1) {
        pathd[cent].erase(pathd[cent].find(tree[id][x].val));
    }

    tree[id][x].val = max(tree[id][2 * x].val, tree[id][2 * x + 1].val);

    if (x == 1) {
        pathd[cent].insert(tree[id][x].val);
    }
}

void updateall(int node, int par, int cent) {
    for (auto nxt : adj[node]) {
        if (seen[nxt.to] || par == nxt.to) continue;

        update(1, 1, timer, st[nxt.to], en[nxt.to], tree.size() - 1, cent, nxt.cost);
        history[nxt.id].push_back({1, 1, timer, st[nxt.to], en[nxt.to], (int) tree.size() - 1, cent, nxt.id});

        updateall(nxt.to, node, cent);
    }
}

void centroid(int node) {
    ct = 0;
    predfs(node);

    if (ct == 1) {
        seen[node] = true; return;
    }
    int cent = find(node, node);

    for (auto nxt : adj[cent]) {
        if (seen[nxt.to]) continue;

        timer = 1;

        dfs(nxt.to, cent);

        tree.push_back({});
        tree.back().resize(4 * (timer + 1));
        pathd[cent].insert(0);

        update(1, 1, timer, st[nxt.to], en[nxt.to], tree.size() - 1, cent, nxt.cost);
        history[nxt.id].push_back({1, 1, timer, st[nxt.to], en[nxt.to], (int) tree.size() - 1, cent, nxt.id});

        updateall(nxt.to, cent, cent);
    }

    total.insert(calc(pathd[cent]));

    seen[cent] = true;

    for (auto nxt : adj[cent]) {
        if (seen[nxt.to]) continue;
        centroid(nxt.to);
    }
}

ll edgeinfo[100005];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n, q, w; cin >> n >> q >> w;

    for (int i = 1; i <= n-1; i++) {
        int a, b; cin >> a >> b;
        ll c; cin >> c;
        adj[a].push_back({b, c, i});
        adj[b].push_back({a, c, i});
        edgeinfo[i] = c;
    }

    centroid(1);

//    cout << *prev(total.end()) << endl;

    ll last = 0;

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

        ll delta = e - edgeinfo[d];
        edgeinfo[d] = e;

        for (auto [x, l, r, ql, qr, id, cent, edgeid] : history[d]) {
            total.erase(total.find(calc(pathd[cent])));
            update(x, l, r, ql, qr, id, cent, delta);
            total.insert(calc(pathd[cent]));
        }

        last = get();
        cout << last << "\n";
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9688 KB Output is correct
2 Correct 6 ms 9736 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9736 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9784 KB Output is correct
11 Correct 5 ms 9732 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9736 KB Output is correct
14 Correct 5 ms 9728 KB Output is correct
15 Correct 6 ms 9728 KB Output is correct
16 Correct 6 ms 9732 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 6 ms 9812 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9688 KB Output is correct
2 Correct 6 ms 9736 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9736 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9784 KB Output is correct
11 Correct 5 ms 9732 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9736 KB Output is correct
14 Correct 5 ms 9728 KB Output is correct
15 Correct 6 ms 9728 KB Output is correct
16 Correct 6 ms 9732 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 6 ms 9812 KB Output is correct
19 Correct 18 ms 10856 KB Output is correct
20 Correct 20 ms 10964 KB Output is correct
21 Correct 22 ms 11112 KB Output is correct
22 Correct 29 ms 11496 KB Output is correct
23 Correct 36 ms 15660 KB Output is correct
24 Correct 48 ms 17508 KB Output is correct
25 Correct 53 ms 18764 KB Output is correct
26 Correct 66 ms 20092 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9756 KB Output is correct
4 Correct 13 ms 9804 KB Output is correct
5 Correct 44 ms 10124 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 7 ms 9940 KB Output is correct
8 Correct 6 ms 9940 KB Output is correct
9 Correct 6 ms 9940 KB Output is correct
10 Correct 15 ms 9944 KB Output is correct
11 Correct 50 ms 10296 KB Output is correct
12 Correct 9 ms 11860 KB Output is correct
13 Correct 9 ms 11860 KB Output is correct
14 Correct 11 ms 11924 KB Output is correct
15 Correct 20 ms 12052 KB Output is correct
16 Correct 65 ms 12428 KB Output is correct
17 Correct 151 ms 53624 KB Output is correct
18 Correct 138 ms 53580 KB Output is correct
19 Correct 138 ms 53620 KB Output is correct
20 Correct 163 ms 53684 KB Output is correct
21 Correct 394 ms 54200 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 11032 KB Output is correct
2 Correct 30 ms 11156 KB Output is correct
3 Correct 106 ms 11724 KB Output is correct
4 Correct 208 ms 12548 KB Output is correct
5 Correct 52 ms 29504 KB Output is correct
6 Correct 85 ms 29624 KB Output is correct
7 Correct 240 ms 30220 KB Output is correct
8 Correct 423 ms 31120 KB Output is correct
9 Correct 285 ms 117952 KB Output is correct
10 Correct 349 ms 118456 KB Output is correct
11 Correct 624 ms 118872 KB Output is correct
12 Correct 928 ms 119864 KB Output is correct
13 Correct 628 ms 233076 KB Output is correct
14 Correct 699 ms 233140 KB Output is correct
15 Correct 1018 ms 233920 KB Output is correct
16 Correct 1486 ms 234908 KB Output is correct
17 Correct 2507 ms 234552 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2029 ms 198388 KB Output is correct
2 Correct 2150 ms 203684 KB Output is correct
3 Correct 2171 ms 202500 KB Output is correct
4 Correct 2158 ms 202176 KB Output is correct
5 Correct 2021 ms 191880 KB Output is correct
6 Correct 1625 ms 131448 KB Output is correct
7 Correct 2984 ms 234976 KB Output is correct
8 Correct 2901 ms 235120 KB Output is correct
9 Correct 2919 ms 235144 KB Output is correct
10 Correct 2854 ms 234068 KB Output is correct
11 Correct 2736 ms 220728 KB Output is correct
12 Correct 2243 ms 148904 KB Output is correct
13 Correct 3433 ms 247248 KB Output is correct
14 Correct 3382 ms 247192 KB Output is correct
15 Correct 3452 ms 247256 KB Output is correct
16 Correct 3405 ms 246148 KB Output is correct
17 Correct 3229 ms 232648 KB Output is correct
18 Correct 2544 ms 155156 KB Output is correct
19 Correct 3488 ms 247200 KB Output is correct
20 Correct 3375 ms 247196 KB Output is correct
21 Correct 3368 ms 247244 KB Output is correct
22 Correct 3403 ms 246196 KB Output is correct
23 Correct 3436 ms 232400 KB Output is correct
24 Correct 2492 ms 155236 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9688 KB Output is correct
2 Correct 6 ms 9736 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9736 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 6 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 6 ms 9784 KB Output is correct
11 Correct 5 ms 9732 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9736 KB Output is correct
14 Correct 5 ms 9728 KB Output is correct
15 Correct 6 ms 9728 KB Output is correct
16 Correct 6 ms 9732 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 6 ms 9812 KB Output is correct
19 Correct 18 ms 10856 KB Output is correct
20 Correct 20 ms 10964 KB Output is correct
21 Correct 22 ms 11112 KB Output is correct
22 Correct 29 ms 11496 KB Output is correct
23 Correct 36 ms 15660 KB Output is correct
24 Correct 48 ms 17508 KB Output is correct
25 Correct 53 ms 18764 KB Output is correct
26 Correct 66 ms 20092 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 6 ms 9684 KB Output is correct
29 Correct 6 ms 9756 KB Output is correct
30 Correct 13 ms 9804 KB Output is correct
31 Correct 44 ms 10124 KB Output is correct
32 Correct 5 ms 9684 KB Output is correct
33 Correct 7 ms 9940 KB Output is correct
34 Correct 6 ms 9940 KB Output is correct
35 Correct 6 ms 9940 KB Output is correct
36 Correct 15 ms 9944 KB Output is correct
37 Correct 50 ms 10296 KB Output is correct
38 Correct 9 ms 11860 KB Output is correct
39 Correct 9 ms 11860 KB Output is correct
40 Correct 11 ms 11924 KB Output is correct
41 Correct 20 ms 12052 KB Output is correct
42 Correct 65 ms 12428 KB Output is correct
43 Correct 151 ms 53624 KB Output is correct
44 Correct 138 ms 53580 KB Output is correct
45 Correct 138 ms 53620 KB Output is correct
46 Correct 163 ms 53684 KB Output is correct
47 Correct 394 ms 54200 KB Output is correct
48 Correct 10 ms 11032 KB Output is correct
49 Correct 30 ms 11156 KB Output is correct
50 Correct 106 ms 11724 KB Output is correct
51 Correct 208 ms 12548 KB Output is correct
52 Correct 52 ms 29504 KB Output is correct
53 Correct 85 ms 29624 KB Output is correct
54 Correct 240 ms 30220 KB Output is correct
55 Correct 423 ms 31120 KB Output is correct
56 Correct 285 ms 117952 KB Output is correct
57 Correct 349 ms 118456 KB Output is correct
58 Correct 624 ms 118872 KB Output is correct
59 Correct 928 ms 119864 KB Output is correct
60 Correct 628 ms 233076 KB Output is correct
61 Correct 699 ms 233140 KB Output is correct
62 Correct 1018 ms 233920 KB Output is correct
63 Correct 1486 ms 234908 KB Output is correct
64 Correct 2507 ms 234552 KB Output is correct
65 Correct 2029 ms 198388 KB Output is correct
66 Correct 2150 ms 203684 KB Output is correct
67 Correct 2171 ms 202500 KB Output is correct
68 Correct 2158 ms 202176 KB Output is correct
69 Correct 2021 ms 191880 KB Output is correct
70 Correct 1625 ms 131448 KB Output is correct
71 Correct 2984 ms 234976 KB Output is correct
72 Correct 2901 ms 235120 KB Output is correct
73 Correct 2919 ms 235144 KB Output is correct
74 Correct 2854 ms 234068 KB Output is correct
75 Correct 2736 ms 220728 KB Output is correct
76 Correct 2243 ms 148904 KB Output is correct
77 Correct 3433 ms 247248 KB Output is correct
78 Correct 3382 ms 247192 KB Output is correct
79 Correct 3452 ms 247256 KB Output is correct
80 Correct 3405 ms 246148 KB Output is correct
81 Correct 3229 ms 232648 KB Output is correct
82 Correct 2544 ms 155156 KB Output is correct
83 Correct 3488 ms 247200 KB Output is correct
84 Correct 3375 ms 247196 KB Output is correct
85 Correct 3368 ms 247244 KB Output is correct
86 Correct 3403 ms 246196 KB Output is correct
87 Correct 3436 ms 232400 KB Output is correct
88 Correct 2492 ms 155236 KB Output is correct
89 Correct 2032 ms 203484 KB Output is correct
90 Correct 2370 ms 218760 KB Output is correct
91 Correct 2803 ms 234168 KB Output is correct
92 Correct 2852 ms 238584 KB Output is correct
93 Correct 3142 ms 243620 KB Output is correct
94 Correct 3206 ms 247448 KB Output is correct
95 Correct 3365 ms 250588 KB Output is correct
96 Correct 3393 ms 250772 KB Output is correct
97 Correct 3355 ms 250640 KB Output is correct
98 Correct 3410 ms 250528 KB Output is correct
99 Correct 3378 ms 250668 KB Output is correct
100 Correct 3380 ms 250760 KB Output is correct