oj.uz

Submission #259988

# Submission time Handle Problem Language Result Execution time Memory
259988 2020-08-08T21:37:12 Z doowey Dynamic Diameter (CEOI19_diameter) C++14
49 / 100
 5000 ms 211536 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 * 2, cl, mid, tl, tr, v);
        upd(node * 2 + 1, mid + 1, cr, tl, tr, v);
        Tree[node].val = max(Tree[node * 2].val, Tree[node * 2 + 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 * 2, cl, mid, tl, tr), get(node * 2 + 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));
        }
    }
};

Centroid shi[M];
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));
        }
    }
}

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[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 13 ms 19200 KB Output is correct
2 Correct 12 ms 19072 KB Output is correct
3 Correct 15 ms 19200 KB Output is correct
4 Correct 12 ms 19200 KB Output is correct
5 Correct 27 ms 19072 KB Output is correct
6 Correct 12 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 12 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 14 ms 19200 KB Output is correct
11 Correct 14 ms 19200 KB Output is correct
12 Correct 15 ms 19200 KB Output is correct
13 Correct 15 ms 19200 KB Output is correct
14 Correct 15 ms 19200 KB Output is correct
15 Correct 15 ms 19200 KB Output is correct
16 Correct 14 ms 19200 KB Output is correct
17 Correct 14 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19200 KB Output is correct
2 Correct 12 ms 19072 KB Output is correct
3 Correct 15 ms 19200 KB Output is correct
4 Correct 12 ms 19200 KB Output is correct
5 Correct 27 ms 19072 KB Output is correct
6 Correct 12 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 12 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 14 ms 19200 KB Output is correct
11 Correct 14 ms 19200 KB Output is correct
12 Correct 15 ms 19200 KB Output is correct
13 Correct 15 ms 19200 KB Output is correct
14 Correct 15 ms 19200 KB Output is correct
15 Correct 15 ms 19200 KB Output is correct
16 Correct 14 ms 19200 KB Output is correct
17 Correct 14 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct
19 Correct 38 ms 20096 KB Output is correct
20 Correct 42 ms 20096 KB Output is correct
21 Correct 50 ms 20224 KB Output is correct
22 Correct 50 ms 20580 KB Output is correct
23 Correct 74 ms 23920 KB Output is correct
24 Correct 84 ms 25072 KB Output is correct
25 Correct 102 ms 26092 KB Output is correct
26 Correct 105 ms 27452 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19200 KB Output is correct
2 Correct 12 ms 19072 KB Output is correct
3 Correct 17 ms 19200 KB Output is correct
4 Correct 29 ms 19200 KB Output is correct
5 Correct 114 ms 19576 KB Output is correct
6 Correct 15 ms 19072 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 13 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 46 ms 19328 KB Output is correct
11 Correct 131 ms 19704 KB Output is correct
12 Correct 18 ms 20216 KB Output is correct
13 Correct 19 ms 20216 KB Output is correct
14 Correct 26 ms 20216 KB Output is correct
15 Correct 54 ms 20336 KB Output is correct
16 Correct 177 ms 20764 KB Output is correct
17 Correct 202 ms 40664 KB Output is correct
18 Correct 210 ms 40664 KB Output is correct
19 Correct 205 ms 40660 KB Output is correct
20 Correct 269 ms 40804 KB Output is correct
21 Correct 632 ms 41292 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 20352 KB Output is correct
2 Correct 54 ms 20352 KB Output is correct
3 Correct 321 ms 20728 KB Output is correct
4 Correct 416 ms 20856 KB Output is correct
5 Correct 75 ms 35184 KB Output is correct
6 Correct 146 ms 35312 KB Output is correct
7 Correct 443 ms 35592 KB Output is correct
8 Correct 848 ms 35792 KB Output is correct
9 Correct 369 ms 110816 KB Output is correct
10 Correct 474 ms 110944 KB Output is correct
11 Correct 932 ms 111200 KB Output is correct
12 Correct 1629 ms 111584 KB Output is correct
13 Correct 785 ms 210900 KB Output is correct
14 Correct 943 ms 210896 KB Output is correct
15 Correct 1505 ms 211168 KB Output is correct
16 Correct 2304 ms 211536 KB Output is correct
17 Correct 3956 ms 211496 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3439 ms 157468 KB Output is correct
2 Correct 3993 ms 160516 KB Output is correct
3 Correct 4254 ms 159268 KB Output is correct
4 Correct 3741 ms 159952 KB Output is correct
5 Correct 4168 ms 150440 KB Output is correct
6 Correct 2901 ms 102820 KB Output is correct
7 Execution timed out 5091 ms 190472 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 19200 KB Output is correct
2 Correct 12 ms 19072 KB Output is correct
3 Correct 15 ms 19200 KB Output is correct
4 Correct 12 ms 19200 KB Output is correct
5 Correct 27 ms 19072 KB Output is correct
6 Correct 12 ms 19200 KB Output is correct
7 Correct 15 ms 19200 KB Output is correct
8 Correct 12 ms 19200 KB Output is correct
9 Correct 15 ms 19200 KB Output is correct
10 Correct 14 ms 19200 KB Output is correct
11 Correct 14 ms 19200 KB Output is correct
12 Correct 15 ms 19200 KB Output is correct
13 Correct 15 ms 19200 KB Output is correct
14 Correct 15 ms 19200 KB Output is correct
15 Correct 15 ms 19200 KB Output is correct
16 Correct 14 ms 19200 KB Output is correct
17 Correct 14 ms 19200 KB Output is correct
18 Correct 15 ms 19200 KB Output is correct
19 Correct 38 ms 20096 KB Output is correct
20 Correct 42 ms 20096 KB Output is correct
21 Correct 50 ms 20224 KB Output is correct
22 Correct 50 ms 20580 KB Output is correct
23 Correct 74 ms 23920 KB Output is correct
24 Correct 84 ms 25072 KB Output is correct
25 Correct 102 ms 26092 KB Output is correct
26 Correct 105 ms 27452 KB Output is correct
27 Correct 13 ms 19200 KB Output is correct
28 Correct 12 ms 19072 KB Output is correct
29 Correct 17 ms 19200 KB Output is correct
30 Correct 29 ms 19200 KB Output is correct
31 Correct 114 ms 19576 KB Output is correct
32 Correct 15 ms 19072 KB Output is correct
33 Correct 15 ms 19200 KB Output is correct
34 Correct 13 ms 19200 KB Output is correct
35 Correct 15 ms 19200 KB Output is correct
36 Correct 46 ms 19328 KB Output is correct
37 Correct 131 ms 19704 KB Output is correct
38 Correct 18 ms 20216 KB Output is correct
39 Correct 19 ms 20216 KB Output is correct
40 Correct 26 ms 20216 KB Output is correct
41 Correct 54 ms 20336 KB Output is correct
42 Correct 177 ms 20764 KB Output is correct
43 Correct 202 ms 40664 KB Output is correct
44 Correct 210 ms 40664 KB Output is correct
45 Correct 205 ms 40660 KB Output is correct
46 Correct 269 ms 40804 KB Output is correct
47 Correct 632 ms 41292 KB Output is correct
48 Correct 20 ms 20352 KB Output is correct
49 Correct 54 ms 20352 KB Output is correct
50 Correct 321 ms 20728 KB Output is correct
51 Correct 416 ms 20856 KB Output is correct
52 Correct 75 ms 35184 KB Output is correct
53 Correct 146 ms 35312 KB Output is correct
54 Correct 443 ms 35592 KB Output is correct
55 Correct 848 ms 35792 KB Output is correct
56 Correct 369 ms 110816 KB Output is correct
57 Correct 474 ms 110944 KB Output is correct
58 Correct 932 ms 111200 KB Output is correct
59 Correct 1629 ms 111584 KB Output is correct
60 Correct 785 ms 210900 KB Output is correct
61 Correct 943 ms 210896 KB Output is correct
62 Correct 1505 ms 211168 KB Output is correct
63 Correct 2304 ms 211536 KB Output is correct
64 Correct 3956 ms 211496 KB Output is correct
65 Correct 3439 ms 157468 KB Output is correct
66 Correct 3993 ms 160516 KB Output is correct
67 Correct 4254 ms 159268 KB Output is correct
68 Correct 3741 ms 159952 KB Output is correct
69 Correct 4168 ms 150440 KB Output is correct
70 Correct 2901 ms 102820 KB Output is correct
71 Execution timed out 5091 ms 190472 KB Time limit exceeded
72 Halted 0 ms 0 KB -