oj.uz

Submission #259992

# Submission time Handle Problem Language Result Execution time Memory
259992 2020-08-08T21:44:27 Z doowey Dynamic Diameter (CEOI19_diameter) C++14
100 / 100
 4962 ms 202412 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)1e5 + 2;
ll ww[N];
vector<pii> T[N];

struct Edge{
    int id;
    int op_l;
    int op_r;
    int el;
    int er;
};

vector<Edge> G[N];
const int M = (int)180000;

struct Node{
    ll val;
    ll lazy;
};

set<pair<ll,int>> all_di;

struct Centroid{
    set<pair<ll,int>> best;
    vector<Node> Tree;
    int CURN;
    int thi_id;
    void init(int n){
        CURN = n;
        for(int i = 0 ; i <= n * 4 + 8; i ++) {
            Tree.push_back({0,0});
        }
    }
    void push(int node, int cl, int cr){
        Tree[node].val += Tree[node].lazy;
        if(cl != cr){
            Tree[node * 2].lazy += Tree[node].lazy;
            Tree[node * 2 + 1].lazy += Tree[node].lazy;
        }
        Tree[node].lazy = 0;
    }
    void upd(int node, int cl, int cr, int tl, int tr, ll v){
        push(node, cl, cr);
        if(cr < tl)
            return;
        if(cl > tr)
            return;
        if(cl >= tl && cr <= tr){
            Tree[node].lazy += v;
            push(node, cl, cr);
            return;
        }
        int mid = (cl + cr) / 2;
        upd(node << 1, cl, mid, tl, tr, v);
        upd(node << 1 | 1, mid + 1, cr, tl, tr, v);
        Tree[node].val = max(Tree[node << 1].val, Tree[node << 1 | 1].val);
    }
    ll get(int node, int cl, int cr, int tl, int tr){
        push(node, cl, cr);
        if(cr < tl)
            return 0ll;
        if(cl > tr)
            return 0ll;
        if(cl >= tl && cr <= tr){
            return Tree[node].val;
        }
        int mid = (cl + cr) / 2;
        return max(get(node << 1, cl, mid, tl, tr), get(node << 1 | 1, mid + 1, cr, tl, tr));
    }
    void check(int mode){
        ll sum = 0;
        auto it = best.end();
        for(int j = 0 ; j < 2; j ++ ){
            if(it != best.begin()){
                it -- ;
                sum += it->fi;
            }
            else{
                break;
            }
        }
        if(mode == 1){
            all_di.insert(mp(sum,thi_id));
        }
        else{
            all_di.erase(mp(sum,thi_id));
        }
    }
};

vector<Centroid>shi;
int idccc = 0;

bool ban[N];
int subt[N];

void dfs1(int u, int par){
    subt[u]=1;
    for(auto x : T[u]){
        if(ban[x.fi] || x.fi == par) continue;
        dfs1(x.fi, u);
        subt[u] += subt[x.fi];
    }
}

int cc;
int tin[N];
int tout[N];
int las;
int sz;

void dfs2(int u, int par){
    tin[u] = cc++;
    int ni, nj;
    for(auto x : T[u]){
        if(ban[x.fi] || x.fi == par) continue;
        dfs2(x.fi, u);
    }
    tout[u] = cc - 1;
}

void dfs3(int u, int par, int l1, int r1){
    int ni, nj;
    for(auto x : T[u]){
        if(ban[x.fi] || x.fi == par) continue;
        ni = l1, nj = r1;
        if(ni == -1)
            ni = tin[x.fi], nj = tout[x.fi];
        dfs3(x.fi, u, ni, nj);
        shi[las].upd(1, 0, sz - 1, tin[x.fi], tout[x.fi], +ww[x.se]);
        G[x.se].push_back({las, tin[x.fi], tout[x.fi], ni, nj});
        if(par == -1){
            shi[las].best.insert(mp(shi[las].get(1, 0, sz - 1, tin[x.fi], tout[x.fi]), ni));
        }
    }
}

Centroid def;

void decomp(int node){
    dfs1(node, -1);
    int pr = -1;
    bool ok = true;
    sz = subt[node];
    if(sz == 1)
        return;
    while(ok){
        ok = false;
        for(auto x : T[node]){
            if(ban[x.fi] || x.fi == pr) continue;
            if(subt[x.fi] > sz/2){
                pr = node;
                node = x.fi;
                ok = true;
                break;
            }
        }
    }
    shi.push_back(def);
    shi[idccc].init(sz);
    shi[idccc].thi_id = idccc;
    las=idccc;
    idccc ++ ;
    cc = 0;
    dfs2(node, -1);
    dfs3(node, -1, -1, -1);
    shi[las].check(1);
    ban[node]=true;
    for(auto p : T[node]){
        if(ban[p.fi]) continue;
        decomp(p.fi);
    }
}

int main(){
    fastIO;
    ll lim;
    int n, q;
    cin >> n >> q >> lim;
    int u, v;
    for(int i = 0 ; i < n - 1; i ++ ){
        cin >> u >> v >> ww[i];
        T[u].push_back(mp(v, i));
        T[v].push_back(mp(u, i));
    }
    decomp(1);
    ll lasres = 0;
    ll id;
    ll new_w;
    for(int tt = 0; tt < q; tt ++ ){
        cin >> id >> new_w;
        id += lasres;
        new_w += lasres;
        id %= (n - 1);
        new_w %= lim;
        lasres = 0;
        for(auto y : G[id]){
            shi[y.id].check(0);
            shi[y.id].best.erase(mp(shi[y.id].get(1, 0, shi[y.id].CURN - 1, y.el, y.er), y.el));
            shi[y.id].upd(1, 0, shi[y.id].CURN - 1, y.op_l, y.op_r, new_w - ww[id]);
            shi[y.id].best.insert(mp(shi[y.id].get(1, 0, shi[y.id].CURN - 1, y.el, y.er), y.el));
            shi[y.id].check(1);
        }
        ww[id] = new_w;
        auto gt = all_di.end();
        gt -- ;
        lasres = gt->fi;
        cout << lasres << "\n";
    }
    return 0;
}

Compilation message

diameter.cpp: In function 'void dfs2(int, int)':
diameter.cpp:126:9: warning: unused variable 'ni' [-Wunused-variable]
     int ni, nj;
         ^~
diameter.cpp:126:13: warning: unused variable 'nj' [-Wunused-variable]
     int ni, nj;
             ^~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 4 ms 5248 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 5 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 30 ms 6016 KB Output is correct
20 Correct 32 ms 6144 KB Output is correct
21 Correct 40 ms 6264 KB Output is correct
22 Correct 37 ms 6560 KB Output is correct
23 Correct 59 ms 9968 KB Output is correct
24 Correct 72 ms 11128 KB Output is correct
25 Correct 86 ms 12308 KB Output is correct
26 Correct 83 ms 13428 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 8 ms 5120 KB Output is correct
4 Correct 19 ms 5120 KB Output is correct
5 Correct 82 ms 5624 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 5248 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 6 ms 5120 KB Output is correct
10 Correct 27 ms 5248 KB Output is correct
11 Correct 119 ms 5624 KB Output is correct
12 Correct 11 ms 6136 KB Output is correct
13 Correct 10 ms 6136 KB Output is correct
14 Correct 13 ms 6136 KB Output is correct
15 Correct 41 ms 6260 KB Output is correct
16 Correct 153 ms 6768 KB Output is correct
17 Correct 193 ms 26524 KB Output is correct
18 Correct 196 ms 26580 KB Output is correct
19 Correct 197 ms 26716 KB Output is correct
20 Correct 236 ms 26712 KB Output is correct
21 Correct 514 ms 27480 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6272 KB Output is correct
2 Correct 46 ms 6392 KB Output is correct
3 Correct 220 ms 6524 KB Output is correct
4 Correct 388 ms 6852 KB Output is correct
5 Correct 67 ms 21612 KB Output is correct
6 Correct 126 ms 21612 KB Output is correct
7 Correct 414 ms 22000 KB Output is correct
8 Correct 776 ms 22380 KB Output is correct
9 Correct 349 ms 98912 KB Output is correct
10 Correct 453 ms 99040 KB Output is correct
11 Correct 968 ms 99296 KB Output is correct
12 Correct 1536 ms 99932 KB Output is correct
13 Correct 752 ms 201204 KB Output is correct
14 Correct 876 ms 201296 KB Output is correct
15 Correct 1468 ms 201540 KB Output is correct
16 Correct 2347 ms 201936 KB Output is correct
17 Correct 3922 ms 202064 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3594 ms 147344 KB Output is correct
2 Correct 3530 ms 150404 KB Output is correct
3 Correct 3535 ms 149016 KB Output is correct
4 Correct 3407 ms 149680 KB Output is correct
5 Correct 3373 ms 140120 KB Output is correct
6 Correct 2899 ms 90836 KB Output is correct
7 Correct 4572 ms 180972 KB Output is correct
8 Correct 4602 ms 180884 KB Output is correct
9 Correct 4478 ms 181172 KB Output is correct
10 Correct 4532 ms 180052 KB Output is correct
11 Correct 4461 ms 168420 KB Output is correct
12 Correct 3716 ms 108860 KB Output is correct
13 Correct 4593 ms 198736 KB Output is correct
14 Correct 4344 ms 198708 KB Output is correct
15 Correct 4307 ms 198660 KB Output is correct
16 Correct 4566 ms 197692 KB Output is correct
17 Correct 4250 ms 184932 KB Output is correct
18 Correct 3586 ms 117796 KB Output is correct
19 Correct 4499 ms 198964 KB Output is correct
20 Correct 4493 ms 198928 KB Output is correct
21 Correct 4467 ms 198936 KB Output is correct
22 Correct 4652 ms 197800 KB Output is correct
23 Correct 4328 ms 185152 KB Output is correct
24 Correct 3955 ms 117804 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 5120 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 4 ms 5248 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 5120 KB Output is correct
12 Correct 4 ms 5120 KB Output is correct
13 Correct 4 ms 5120 KB Output is correct
14 Correct 5 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 5 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 30 ms 6016 KB Output is correct
20 Correct 32 ms 6144 KB Output is correct
21 Correct 40 ms 6264 KB Output is correct
22 Correct 37 ms 6560 KB Output is correct
23 Correct 59 ms 9968 KB Output is correct
24 Correct 72 ms 11128 KB Output is correct
25 Correct 86 ms 12308 KB Output is correct
26 Correct 83 ms 13428 KB Output is correct
27 Correct 4 ms 4992 KB Output is correct
28 Correct 3 ms 4992 KB Output is correct
29 Correct 8 ms 5120 KB Output is correct
30 Correct 19 ms 5120 KB Output is correct
31 Correct 82 ms 5624 KB Output is correct
32 Correct 4 ms 4992 KB Output is correct
33 Correct 4 ms 5248 KB Output is correct
34 Correct 4 ms 5120 KB Output is correct
35 Correct 6 ms 5120 KB Output is correct
36 Correct 27 ms 5248 KB Output is correct
37 Correct 119 ms 5624 KB Output is correct
38 Correct 11 ms 6136 KB Output is correct
39 Correct 10 ms 6136 KB Output is correct
40 Correct 13 ms 6136 KB Output is correct
41 Correct 41 ms 6260 KB Output is correct
42 Correct 153 ms 6768 KB Output is correct
43 Correct 193 ms 26524 KB Output is correct
44 Correct 196 ms 26580 KB Output is correct
45 Correct 197 ms 26716 KB Output is correct
46 Correct 236 ms 26712 KB Output is correct
47 Correct 514 ms 27480 KB Output is correct
48 Correct 11 ms 6272 KB Output is correct
49 Correct 46 ms 6392 KB Output is correct
50 Correct 220 ms 6524 KB Output is correct
51 Correct 388 ms 6852 KB Output is correct
52 Correct 67 ms 21612 KB Output is correct
53 Correct 126 ms 21612 KB Output is correct
54 Correct 414 ms 22000 KB Output is correct
55 Correct 776 ms 22380 KB Output is correct
56 Correct 349 ms 98912 KB Output is correct
57 Correct 453 ms 99040 KB Output is correct
58 Correct 968 ms 99296 KB Output is correct
59 Correct 1536 ms 99932 KB Output is correct
60 Correct 752 ms 201204 KB Output is correct
61 Correct 876 ms 201296 KB Output is correct
62 Correct 1468 ms 201540 KB Output is correct
63 Correct 2347 ms 201936 KB Output is correct
64 Correct 3922 ms 202064 KB Output is correct
65 Correct 3594 ms 147344 KB Output is correct
66 Correct 3530 ms 150404 KB Output is correct
67 Correct 3535 ms 149016 KB Output is correct
68 Correct 3407 ms 149680 KB Output is correct
69 Correct 3373 ms 140120 KB Output is correct
70 Correct 2899 ms 90836 KB Output is correct
71 Correct 4572 ms 180972 KB Output is correct
72 Correct 4602 ms 180884 KB Output is correct
73 Correct 4478 ms 181172 KB Output is correct
74 Correct 4532 ms 180052 KB Output is correct
75 Correct 4461 ms 168420 KB Output is correct
76 Correct 3716 ms 108860 KB Output is correct
77 Correct 4593 ms 198736 KB Output is correct
78 Correct 4344 ms 198708 KB Output is correct
79 Correct 4307 ms 198660 KB Output is correct
80 Correct 4566 ms 197692 KB Output is correct
81 Correct 4250 ms 184932 KB Output is correct
82 Correct 3586 ms 117796 KB Output is correct
83 Correct 4499 ms 198964 KB Output is correct
84 Correct 4493 ms 198928 KB Output is correct
85 Correct 4467 ms 198936 KB Output is correct
86 Correct 4652 ms 197800 KB Output is correct
87 Correct 4328 ms 185152 KB Output is correct
88 Correct 3955 ms 117804 KB Output is correct
89 Correct 3629 ms 147864 KB Output is correct
90 Correct 4043 ms 160336 KB Output is correct
91 Correct 4962 ms 176560 KB Output is correct
92 Correct 4607 ms 180840 KB Output is correct
93 Correct 4786 ms 189944 KB Output is correct
94 Correct 4545 ms 195616 KB Output is correct
95 Correct 4810 ms 202408 KB Output is correct
96 Correct 4318 ms 202280 KB Output is correct
97 Correct 4482 ms 202116 KB Output is correct
98 Correct 4325 ms 202412 KB Output is correct
99 Correct 4561 ms 202072 KB Output is correct
100 Correct 4371 ms 202344 KB Output is correct