oj.uz

답안 #578814

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578814 2022-06-18T04:50:44 Z talant117408 Dynamic Diameter (CEOI19_diameter) C++17
73 / 100
 2422 ms 34136 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;
ll df, vf;
int n, q;
ll w;

void find_furthest(int v, int p, ll dist = 0) {
    if (dist > df) {
        df = dist;
        vf = v;
    }
    for (auto to : graph[v]) {
        if (to.first == p) continue;
        find_furthest(to.first, v, dist+to.second);
    }
}

void subtask3() {
    if (w > 10000) return;
    for (auto to : edges) {
        if (to.first.first != 1) {
            return;
        }
    }
    set <pair <ll, int>, greater <pair <ll, int>>> st;
    for (auto to : edges) {
        st.insert(mp(to.second, to.first.second));
    }
    ll last = 0;
    while (q--) {
        ll d, e;
        cin >> d >> e;
        d = (d + last) % (n - 1);
        e = (e + last) % w;
        auto &c = edges[d].second;
        auto b = edges[d].first.second;
        st.erase(st.find(mp(c, b)));
        c = e;
        st.insert(mp(c, b));
        ll ans = 0;
        ll cnt = 0;
        for (auto to : st) {
            ans += to.first;
            if (++cnt > 1) break;
        }
        cout << ans << endl;
        last = ans;
    }
    exit(0);
}

void subtask4() {
    if (w > 10000) return;
    vector <ll> ans_for(n+1);
    vector <pll> mx_child(n+1), dist_child(n+1);
    set <pair <ll, int>, greater <pair <ll, int>>> st;
    for (auto to : edges) {
        auto a = to.first.first;
        auto b = to.first.second;
        if (!(a*2 != b || a*2+1 != b)) {
            return;
        }
        if (a*2 == b) dist_child[a].first = to.second;
        else dist_child[a].second = to.second;
    }
    
    for (int i = 1; i <= n; i++) {
        if (sz(graph[i]) == 1) {
            int x = i;
            while (x) {
                if (x*2 <= n) mx_child[x].first = max(mx_child[x*2].first, mx_child[x*2].second)+dist_child[x].first;
                if (x*2+1 <= n) mx_child[x].second = max(mx_child[x*2+1].first, mx_child[x*2+1].second)+dist_child[x].second;
                x >>= 1;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        st.insert(mp(mx_child[i].first+mx_child[i].second, i));
    }
    
    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;
        int x = (b >> 1);
        if (a*2 == b) dist_child[a].first = e;
        else dist_child[a].second = e;
        while (x) {
            st.erase(st.find(mp(mx_child[x].first+mx_child[x].second, x)));
            if (x*2 <= n) mx_child[x].first = max(mx_child[x*2].first, mx_child[x*2].second)+dist_child[x].first;
            if (x*2+1 <= n) mx_child[x].second = max(mx_child[x*2+1].first, mx_child[x*2+1].second)+dist_child[x].second;
            st.insert(mp(mx_child[x].first+mx_child[x].second, x));
            x >>= 1;
        }
        cout << (*st.begin()).first << endl;
        last = (*st.begin()).first;
    }
    exit(0);
}

ll tree[N*4], lz[N*4];
int depth[N], timer;
pii range[N];
int parent[N];
int origin = 1;

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

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

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

void dfs(int v = 1, int p = 1, ll dist = 0) {
    range[v].first = ++timer;
    update(1, 1, n, timer, timer, dist);
    parent[v] = origin;
    for (auto to : graph[v]) {
        if (to.first == p) continue;
        depth[to.first] = depth[v] + 1;
        if (v == 1) origin = to.first;
        dfs(to.first, v, dist+to.second);
    }
    range[v].second = timer;
}

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));
    }
    
    if (n <= 5000 && w <= 10000) {
        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;
            graph[a].erase(graph[a].find(mp(b, c)));
            graph[b].erase(graph[b].find(mp(a, c)));
            c = e;
            graph[a].insert(mp(b, c));
            graph[b].insert(mp(a, c));
            df = vf = 0;
            find_furthest(1, 1);
            df = 0;
            find_furthest(vf, vf);
            cout << df << endl;
            last = df;
        }
        return;
    }
    subtask3();
    subtask4();
    
    dfs();
    set <pair <ll, int>, greater <pair <ll, int>>> st;
    for (auto to : graph[1]) {
        st.insert(mp(get(1, 1, n, range[to.first].first, range[to.first].second), to.first));
    }
    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 (depth[a] > depth[b]) swap(a, b);
        st.erase(st.find(mp(get(1, 1, n, range[parent[b]].first, range[parent[b]].second), parent[b])));
        update(1, 1, n, range[b].first, range[b].second, e-c);
        c = e;
        st.insert(mp(get(1, 1, n, range[parent[b]].first, range[parent[b]].second), parent[b]));
        ll res = 0;
        ll cnt = 0;
        for (auto to : st) {
            res += to.first;
            if (++cnt > 1) break;
        }
        cout << res << endl;
        last = res;
    }
}

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

*/

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5016 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 4948 KB Output is correct
19 Correct 231 ms 5296 KB Output is correct
20 Correct 232 ms 5188 KB Output is correct
21 Correct 266 ms 5160 KB Output is correct
22 Correct 297 ms 5352 KB Output is correct
23 Correct 1719 ms 5876 KB Output is correct
24 Correct 1928 ms 5756 KB Output is correct
25 Correct 1942 ms 5904 KB Output is correct
26 Correct 2422 ms 6108 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 25 ms 5072 KB Output is correct
5 Correct 87 ms 5424 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 5 ms 5096 KB Output is correct
9 Correct 31 ms 5104 KB Output is correct
10 Correct 310 ms 5120 KB Output is correct
11 Correct 1445 ms 5460 KB Output is correct
12 Correct 8 ms 5972 KB Output is correct
13 Correct 7 ms 5972 KB Output is correct
14 Correct 8 ms 5972 KB Output is correct
15 Correct 21 ms 6060 KB Output is correct
16 Correct 55 ms 6488 KB Output is correct
17 Correct 94 ms 25332 KB Output is correct
18 Correct 99 ms 25260 KB Output is correct
19 Correct 98 ms 25352 KB Output is correct
20 Correct 116 ms 25400 KB Output is correct
21 Correct 219 ms 25924 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 5076 KB Output is correct
2 Correct 234 ms 5208 KB Output is correct
3 Correct 1205 ms 5420 KB Output is correct
4 Correct 2350 ms 5708 KB Output is correct
5 Correct 12 ms 7376 KB Output is correct
6 Correct 25 ms 7504 KB Output is correct
7 Correct 88 ms 7748 KB Output is correct
8 Correct 164 ms 8060 KB Output is correct
9 Correct 38 ms 17084 KB Output is correct
10 Correct 66 ms 17196 KB Output is correct
11 Correct 146 ms 17420 KB Output is correct
12 Correct 252 ms 17816 KB Output is correct
13 Correct 83 ms 29244 KB Output is correct
14 Correct 100 ms 29300 KB Output is correct
15 Correct 194 ms 29496 KB Output is correct
16 Correct 355 ms 29832 KB Output is correct
17 Correct 737 ms 30120 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 259 ms 26332 KB Output is correct
2 Correct 338 ms 26244 KB Output is correct
3 Correct 315 ms 26288 KB Output is correct
4 Correct 315 ms 26340 KB Output is correct
5 Correct 377 ms 26852 KB Output is correct
6 Correct 389 ms 29140 KB Output is correct
7 Correct 293 ms 29216 KB Output is correct
8 Correct 331 ms 29208 KB Output is correct
9 Correct 290 ms 29240 KB Output is correct
10 Correct 381 ms 29324 KB Output is correct
11 Correct 378 ms 29744 KB Output is correct
12 Correct 422 ms 31360 KB Output is correct
13 Correct 280 ms 34108 KB Output is correct
14 Correct 366 ms 34016 KB Output is correct
15 Correct 347 ms 34048 KB Output is correct
16 Correct 345 ms 34072 KB Output is correct
17 Correct 389 ms 33896 KB Output is correct
18 Correct 425 ms 33092 KB Output is correct
19 Correct 290 ms 34136 KB Output is correct
20 Correct 326 ms 34072 KB Output is correct
21 Correct 373 ms 34024 KB Output is correct
22 Correct 348 ms 34036 KB Output is correct
23 Correct 376 ms 33904 KB Output is correct
24 Correct 412 ms 33088 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5016 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 4 ms 4948 KB Output is correct
19 Correct 231 ms 5296 KB Output is correct
20 Correct 232 ms 5188 KB Output is correct
21 Correct 266 ms 5160 KB Output is correct
22 Correct 297 ms 5352 KB Output is correct
23 Correct 1719 ms 5876 KB Output is correct
24 Correct 1928 ms 5756 KB Output is correct
25 Correct 1942 ms 5904 KB Output is correct
26 Correct 2422 ms 6108 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 4 ms 4948 KB Output is correct
29 Correct 5 ms 4948 KB Output is correct
30 Correct 25 ms 5072 KB Output is correct
31 Correct 87 ms 5424 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 5 ms 5096 KB Output is correct
35 Correct 31 ms 5104 KB Output is correct
36 Correct 310 ms 5120 KB Output is correct
37 Correct 1445 ms 5460 KB Output is correct
38 Correct 8 ms 5972 KB Output is correct
39 Correct 7 ms 5972 KB Output is correct
40 Correct 8 ms 5972 KB Output is correct
41 Correct 21 ms 6060 KB Output is correct
42 Correct 55 ms 6488 KB Output is correct
43 Correct 94 ms 25332 KB Output is correct
44 Correct 99 ms 25260 KB Output is correct
45 Correct 98 ms 25352 KB Output is correct
46 Correct 116 ms 25400 KB Output is correct
47 Correct 219 ms 25924 KB Output is correct
48 Correct 29 ms 5076 KB Output is correct
49 Correct 234 ms 5208 KB Output is correct
50 Correct 1205 ms 5420 KB Output is correct
51 Correct 2350 ms 5708 KB Output is correct
52 Correct 12 ms 7376 KB Output is correct
53 Correct 25 ms 7504 KB Output is correct
54 Correct 88 ms 7748 KB Output is correct
55 Correct 164 ms 8060 KB Output is correct
56 Correct 38 ms 17084 KB Output is correct
57 Correct 66 ms 17196 KB Output is correct
58 Correct 146 ms 17420 KB Output is correct
59 Correct 252 ms 17816 KB Output is correct
60 Correct 83 ms 29244 KB Output is correct
61 Correct 100 ms 29300 KB Output is correct
62 Correct 194 ms 29496 KB Output is correct
63 Correct 355 ms 29832 KB Output is correct
64 Correct 737 ms 30120 KB Output is correct
65 Correct 259 ms 26332 KB Output is correct
66 Correct 338 ms 26244 KB Output is correct
67 Correct 315 ms 26288 KB Output is correct
68 Correct 315 ms 26340 KB Output is correct
69 Correct 377 ms 26852 KB Output is correct
70 Correct 389 ms 29140 KB Output is correct
71 Correct 293 ms 29216 KB Output is correct
72 Correct 331 ms 29208 KB Output is correct
73 Correct 290 ms 29240 KB Output is correct
74 Correct 381 ms 29324 KB Output is correct
75 Correct 378 ms 29744 KB Output is correct
76 Correct 422 ms 31360 KB Output is correct
77 Correct 280 ms 34108 KB Output is correct
78 Correct 366 ms 34016 KB Output is correct
79 Correct 347 ms 34048 KB Output is correct
80 Correct 345 ms 34072 KB Output is correct
81 Correct 389 ms 33896 KB Output is correct
82 Correct 425 ms 33092 KB Output is correct
83 Correct 290 ms 34136 KB Output is correct
84 Correct 326 ms 34072 KB Output is correct
85 Correct 373 ms 34024 KB Output is correct
86 Correct 348 ms 34036 KB Output is correct
87 Correct 376 ms 33904 KB Output is correct
88 Correct 412 ms 33088 KB Output is correct
89 Incorrect 263 ms 29616 KB Output isn't correct
90 Halted 0 ms 0 KB -