oj.uz

답안 #837851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837851 2023-08-25T18:44:01 Z jasmin Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 4401 ms 274068 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long

const int INF=LLONG_MAX;
const int L=25;

struct segtree{ //lazy maximum segtree with add updates

    vector<int> tree;
    vector<int> lazy;

    segtree(int n){
        tree.assign(n*4, 0);
        lazy.assign(n*4, 0);
    }

    int update_node(int v, int add){
        tree[v] += add;
        lazy[v] += add;

        return tree[v];
    }

    void propagate(int v){
        if(lazy[v]==0) return;

        update_node(v*2+1, lazy[v]);
        update_node(v*2+2, lazy[v]);
        lazy[v]=0;
    }

    int update(int l, int r, int v, int ql, int qr, int add){
        if(qr<=l || r<=ql) return tree[v];
        if(ql<=l && r<=qr){
            return update_node(v, add);
        }
        propagate(v);
        int m=l+(r-l)/2;
        return tree[v] = max(update(l, m, v*2+1, ql, qr, add), update(m, r, v*2+2, ql, qr, add));
    }

    int query(int l, int r, int v, int ql, int qr){
        if(qr<=l || r<=ql) return 0;
        if(ql<=l && r<=qr){
            return tree[v];
        }
        propagate(v);
        int m=l+(r-l)/2;
        return max(query(l, m, v*2+1, ql, qr), query(m, r, v*2+2, ql, qr));
    }
};

struct segtree2{
    vector<int> tree;

    void init(int n){
        tree.assign(n*4, 0);
    }

    int update(int l, int r, int v, int x, int val){
        if(x<l || r<=x) return tree[v];
        if(l+1==r){
            return tree[v]=val;
        }
        int m=l+(r-l)/2;
        return tree[v] = max(update(l, m, v*2+1, x, val), update(m, r, v*2+2, x, val));
    }

    int query(){
        return tree[0];
    }
};

struct tree{
    int n;
    vector<pair<int,int> > edge;
    vector<vector<pair<int,int> > >adi;

    segtree2 segans;

    vector<int> level;
    vector<int> pc; //parent centroid

    vector<int> subtreesize;

    vector<int> curind;
    vector<set<pair<int, int> > >children;
    vector<set<pair<int, int> > >paths;

    vector<vector<int> > preind;
    vector<vector<int> > ssize;
    vector<vector<int> > paredge;
    vector<segtree> seg;

    tree(int ninput){
        n = ninput;
        edge.assign(n-1, {-1, -1});
        adi.assign(n, {});

        segans.init(n);

        level.assign(n, INF);
        pc.assign(n, -1);

        subtreesize.assign(n, 0);

        curind.assign(L, 0);
        children.assign(n, {});
        paths.assign(n, {});

        preind.assign(L, vector<int>(n, 0));
        ssize.assign(L, vector<int> (n, 0));
        paredge.assign(L, vector<int> (n, 0));
        seg.assign(L, segtree(n));
    }

    //centroids
    int dfs(int v, int p, int lev){ //precomputes the subtreesizes
 
        subtreesize[v] = 1;
        for(auto [u, d]: adi[v]){
            if(u==p || level[u]<lev) continue;

            subtreesize[v] += dfs(u, v, lev);
        }

        return subtreesize[v];
    }

    int centroiddfs(int v, int lev, int size){ //finds a centroid in a connected graph

        for(auto [u, d]: adi[v]){
            if(level[u] < lev) continue;

            if(subtreesize[u] > size/2){

                subtreesize[v] = size - subtreesize[u];
                return centroiddfs(u, lev, size);
            }
        }

        return v;
    }

    void find_centroids(int v, int lev, int centroidp){ //finds all centroids recursively
        int size = dfs(v, -1, lev);

        int centroid = centroiddfs(v, lev, size);
        level[centroid] = lev;
        pc[centroid]= centroidp;


        //compute all values for this component
        distancedfs(centroid, -1, 0, lev);
        
        for(auto [u, d]: adi[centroid]){
            if(level[u] < lev) continue;

            children[centroid].insert({preind[lev][u], u});
            int p = seg[lev].query(0, n, 0, preind[lev][u], preind[lev][u] + ssize[lev][u]);
            paths[centroid].insert({p, u});
        }
        paths[centroid].insert({0, -1});
        paths[centroid].insert({0, -2});

        int diameter = (*prev(paths[centroid].end())).first;
        diameter += (*prev(prev(paths[centroid].end()))).first;
    
        segans.update(0, n, 0, centroid, diameter);

        //find next centroids
        for(auto [u, d]: adi[centroid]){
            if(level[u] < lev) continue;

            find_centroids(u, lev+1, centroid);
        }
    }

    int distancedfs(int v, int p, int dist, int lev){

        preind[lev][v] = curind[lev];
        curind[lev]++;

        seg[lev].update(0, n, 0, preind[lev][v], preind[lev][v]+1, dist);

        int s=1;
        for(auto [u, d]: adi[v]){
            if(u==p || level[u] < lev) continue;

            paredge[lev][u] = d;
            s += distancedfs(u, v, dist+d, lev);
        }

        ssize[lev][v] = s;
        return s;
    }


    int update_edge(int a, int b, int add){

        int c; 
        if(level[a] > level[b]){

            c=b;    
        }
        else{

            c=a;
        }
        //c = pc[c];

        while(c!=-1){
            int lev = level[c];

            if(preind[lev][b]<preind[lev][a]){ 

                swap(a, b);
            } //=> a is an ancestor of b

            // update c
            int x = (*prev(children[c].upper_bound({preind[lev][b], b}))).second;
            int oldp = seg[lev].query(0, n, 0, preind[lev][x], preind[lev][x] + ssize[lev][x]);
            paths[c].erase({oldp, x});


            seg[lev].update(0, n, 0, preind[lev][b], preind[lev][b]+ssize[lev][b], add);

            int newp = seg[lev].query(0, n, 0, preind[lev][x], preind[lev][x] + ssize[lev][x]);
            paths[c].insert({newp, x});


            int diameterc = (*prev(paths[c].end())).first;
            diameterc += (*prev(prev(paths[c].end()))).first;
            
            segans.update(0, n, 0, c, diameterc);

            c = pc[c];
        }

        return segans.query();
    }
};

/*int solve(int n, vector<int>& v, vector<int>& u, vector<int>& w){
    tree g(n);

    for(int i=0; i<n-1; i++){
        int a=v[i];
        int b=u[i];
        int c=w[i];

        g.edge[i]={a, b};
        g.adi[a].push_back({b, c});
        g.adi[b].push_back({a, c});
    }

    g.find_centroids(0, 0, -1);

    int ans=g.segans.query();
    return ans;
}*/

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, q, maxw;
    cin >> n >> q >> maxw;

    /*vector<int> v(n-1);
    vector<int> u(n-1);
    vector<int> w(n-1);
    for(int i=0; i<n-1; i++){
        cin >> v[i] >> u[i] >> w[i];
        v[i]--;
        u[i]--;
    }

    int last=0;
    for(int i=0; i<q; i++){

        int di, wi;
        cin >> di >> wi;

        int d = (di + last) % (n-1);
        int weight = (wi + last) % maxw;

        w[d] = weight;

        int ans= solve(n, v, u, w);
        cout << ans << "\n";
        last = ans;
    }*/

    tree g(n);

    vector<int> c(n-1);
    for(int i=0; i<n-1; i++){
        int a, b;
        cin >> a >> b >> c[i];
        a--; b--;

        g.edge[i]={a, b};
        g.adi[a].push_back({b, c[i]});
        g.adi[b].push_back({a, c[i]});
    }

    g.find_centroids(0, 0, -1);

    int last=0;
    for(int i=0; i<q; i++){

        int di, wi;
        cin >> di >> wi;

        int d = (di + last) % (n-1);
        int w = (wi + last) % maxw;

        auto [a, b] = g.edge[d];

        //cout << "update " << d << " " << a+1 << " " << b+1 << " " << w << "\n";

        int add = w - c[d];
        c[d] = w;
        
        int ans=g.update_edge(a, b, add);
        cout << ans << "\n";
        
        last = ans;
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 580 KB Output is correct
19 Correct 17 ms 3052 KB Output is correct
20 Correct 18 ms 3016 KB Output is correct
21 Correct 22 ms 3028 KB Output is correct
22 Correct 25 ms 3012 KB Output is correct
23 Correct 38 ms 13844 KB Output is correct
24 Correct 46 ms 13908 KB Output is correct
25 Correct 54 ms 13944 KB Output is correct
26 Correct 60 ms 14084 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 49 ms 740 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 2 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 3 ms 1620 KB Output is correct
10 Correct 16 ms 1748 KB Output is correct
11 Correct 78 ms 2096 KB Output is correct
12 Correct 11 ms 13724 KB Output is correct
13 Correct 11 ms 13732 KB Output is correct
14 Correct 19 ms 13716 KB Output is correct
15 Correct 33 ms 13792 KB Output is correct
16 Correct 119 ms 14440 KB Output is correct
17 Correct 240 ms 265052 KB Output is correct
18 Correct 238 ms 265080 KB Output is correct
19 Correct 245 ms 265180 KB Output is correct
20 Correct 280 ms 265200 KB Output is correct
21 Correct 516 ms 265624 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2900 KB Output is correct
2 Correct 29 ms 3028 KB Output is correct
3 Correct 134 ms 3112 KB Output is correct
4 Correct 264 ms 3424 KB Output is correct
5 Correct 42 ms 26996 KB Output is correct
6 Correct 92 ms 27312 KB Output is correct
7 Correct 278 ms 27936 KB Output is correct
8 Correct 541 ms 28708 KB Output is correct
9 Correct 210 ms 133888 KB Output is correct
10 Correct 299 ms 134056 KB Output is correct
11 Correct 646 ms 134640 KB Output is correct
12 Correct 1105 ms 135564 KB Output is correct
13 Correct 441 ms 267428 KB Output is correct
14 Correct 548 ms 267668 KB Output is correct
15 Correct 1012 ms 268316 KB Output is correct
16 Correct 1587 ms 269188 KB Output is correct
17 Correct 2933 ms 268920 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2435 ms 267076 KB Output is correct
2 Correct 2576 ms 267076 KB Output is correct
3 Correct 2575 ms 267156 KB Output is correct
4 Correct 2717 ms 267128 KB Output is correct
5 Correct 2669 ms 267204 KB Output is correct
6 Correct 2419 ms 266776 KB Output is correct
7 Correct 3431 ms 268772 KB Output is correct
8 Correct 3644 ms 268568 KB Output is correct
9 Correct 3465 ms 268588 KB Output is correct
10 Correct 3419 ms 268600 KB Output is correct
11 Correct 3354 ms 268408 KB Output is correct
12 Correct 3189 ms 268108 KB Output is correct
13 Correct 3771 ms 270780 KB Output is correct
14 Correct 3762 ms 270796 KB Output is correct
15 Correct 3869 ms 270864 KB Output is correct
16 Correct 3721 ms 270724 KB Output is correct
17 Correct 3638 ms 270320 KB Output is correct
18 Correct 3264 ms 269152 KB Output is correct
19 Correct 4048 ms 270748 KB Output is correct
20 Correct 4241 ms 270772 KB Output is correct
21 Correct 4165 ms 270744 KB Output is correct
22 Correct 4401 ms 270632 KB Output is correct
23 Correct 3780 ms 270284 KB Output is correct
24 Correct 4010 ms 269024 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 580 KB Output is correct
19 Correct 17 ms 3052 KB Output is correct
20 Correct 18 ms 3016 KB Output is correct
21 Correct 22 ms 3028 KB Output is correct
22 Correct 25 ms 3012 KB Output is correct
23 Correct 38 ms 13844 KB Output is correct
24 Correct 46 ms 13908 KB Output is correct
25 Correct 54 ms 13944 KB Output is correct
26 Correct 60 ms 14084 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 12 ms 468 KB Output is correct
31 Correct 49 ms 740 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 2 ms 1620 KB Output is correct
34 Correct 1 ms 1620 KB Output is correct
35 Correct 3 ms 1620 KB Output is correct
36 Correct 16 ms 1748 KB Output is correct
37 Correct 78 ms 2096 KB Output is correct
38 Correct 11 ms 13724 KB Output is correct
39 Correct 11 ms 13732 KB Output is correct
40 Correct 19 ms 13716 KB Output is correct
41 Correct 33 ms 13792 KB Output is correct
42 Correct 119 ms 14440 KB Output is correct
43 Correct 240 ms 265052 KB Output is correct
44 Correct 238 ms 265080 KB Output is correct
45 Correct 245 ms 265180 KB Output is correct
46 Correct 280 ms 265200 KB Output is correct
47 Correct 516 ms 265624 KB Output is correct
48 Correct 5 ms 2900 KB Output is correct
49 Correct 29 ms 3028 KB Output is correct
50 Correct 134 ms 3112 KB Output is correct
51 Correct 264 ms 3424 KB Output is correct
52 Correct 42 ms 26996 KB Output is correct
53 Correct 92 ms 27312 KB Output is correct
54 Correct 278 ms 27936 KB Output is correct
55 Correct 541 ms 28708 KB Output is correct
56 Correct 210 ms 133888 KB Output is correct
57 Correct 299 ms 134056 KB Output is correct
58 Correct 646 ms 134640 KB Output is correct
59 Correct 1105 ms 135564 KB Output is correct
60 Correct 441 ms 267428 KB Output is correct
61 Correct 548 ms 267668 KB Output is correct
62 Correct 1012 ms 268316 KB Output is correct
63 Correct 1587 ms 269188 KB Output is correct
64 Correct 2933 ms 268920 KB Output is correct
65 Correct 2435 ms 267076 KB Output is correct
66 Correct 2576 ms 267076 KB Output is correct
67 Correct 2575 ms 267156 KB Output is correct
68 Correct 2717 ms 267128 KB Output is correct
69 Correct 2669 ms 267204 KB Output is correct
70 Correct 2419 ms 266776 KB Output is correct
71 Correct 3431 ms 268772 KB Output is correct
72 Correct 3644 ms 268568 KB Output is correct
73 Correct 3465 ms 268588 KB Output is correct
74 Correct 3419 ms 268600 KB Output is correct
75 Correct 3354 ms 268408 KB Output is correct
76 Correct 3189 ms 268108 KB Output is correct
77 Correct 3771 ms 270780 KB Output is correct
78 Correct 3762 ms 270796 KB Output is correct
79 Correct 3869 ms 270864 KB Output is correct
80 Correct 3721 ms 270724 KB Output is correct
81 Correct 3638 ms 270320 KB Output is correct
82 Correct 3264 ms 269152 KB Output is correct
83 Correct 4048 ms 270748 KB Output is correct
84 Correct 4241 ms 270772 KB Output is correct
85 Correct 4165 ms 270744 KB Output is correct
86 Correct 4401 ms 270632 KB Output is correct
87 Correct 3780 ms 270284 KB Output is correct
88 Correct 4010 ms 269024 KB Output is correct
89 Correct 2737 ms 270364 KB Output is correct
90 Correct 2899 ms 270592 KB Output is correct
91 Correct 3370 ms 271460 KB Output is correct
92 Correct 3550 ms 271836 KB Output is correct
93 Correct 3619 ms 272652 KB Output is correct
94 Correct 3687 ms 272864 KB Output is correct
95 Correct 3771 ms 273028 KB Output is correct
96 Correct 3735 ms 272708 KB Output is correct
97 Correct 3741 ms 273012 KB Output is correct
98 Correct 3797 ms 274068 KB Output is correct
99 Correct 3783 ms 272872 KB Output is correct
100 Correct 3826 ms 273040 KB Output is correct