oj.uz

Submission #478136

# Submission time Handle Problem Language Result Execution time Memory
478136 2021-10-05T19:40:24 Z bonopo Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 244164 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target ("avx2")
#define pb push_back
#define rc (i<<1)|1
#define lc (i<<1)
#define el "\n"
#define f first
#define s second

typedef long long ll;
const int MM=1e5+5, MOD=1e9+7, LOG=19;
int N, Q, sz[MM], bk[MM], pa[MM], in[LOG][MM], ot[LOG][MM], cp[LOG][MM], tp[LOG][MM], ct;
vector<int> adj[MM]; ll av[MM], W;
gp_hash_table<int,int> mp[MM];
multiset<ll> ast;

struct node {
    ll lz;
    pair<ll,int> mx;
};

struct tree {
    vector<node> seg;
    int wt;

    inline void prop(int i, int &l, int &r) {
        if(l!=r) {
            seg[lc].lz+=seg[i].lz;
            seg[rc].lz+=seg[i].lz; }
        seg[i].mx.f+=seg[i].lz;
        seg[i].lz=0;
    }

    void build(int i, int sl, int sr) {
        if(sl==sr) {
            seg[i].mx=make_pair(0,sl);
            return; }
        int m=sl+sr>>1;
        build(rc, m+1, sr);
        build(lc, sl, m);
        calc(i);
    }

    inline void calc(int i) {
        seg[i].mx=max(seg[lc].mx, seg[rc].mx);
    }

    void upd(int i, int sl, int sr, int l, int r, ll v) {
        prop(i, sl, sr);
        if(l>sr || r<sl) return;
        if(l<=sl&&sr<=r) {
            seg[i].lz+=v;
            prop(i, sl, sr); return; }
        int m=sl+sr>>1;
        upd(rc, m+1, sr, l, r, v);
        upd(lc, sl, m, l, r, v);
        calc(i);
    }

    pair<ll,int> rmq(int i, int sl, int sr, int l, int r) {
        if(l>sr || r<sl) return make_pair(0,0);
        prop(i, sl, sr);
        if(l<=sl&&sr<=r) return seg[i].mx;
        int m=sl+sr>>1;
        return max(rmq(lc, sl, m, l, r), rmq(rc, m+1, sr, l, r));
    }

    inline void init(int n) {
        wt=n; seg.resize(4*n+4);
        build(1, 1, n);
    }
} st[MM];

int crt(int u, int th, int fa) {
    for(int &v:adj[u]) if(v!=fa&&!bk[v]&&sz[v]>th) {
        return crt(v, th, u); }
    return u;
}

void dfs(int u, int fa) {
    sz[u]=1;
    for(int &v:adj[u]) if(v!=fa&&!bk[v]) {
        dfs(v, u);
        sz[u]+=sz[v];
    }
}

void etr(int u, int fa, int lvl, int rt, int tv) {
    in[lvl][u]=++ct; cp[lvl][u]=rt; tp[lvl][u]=tv; mp[rt][ct]=u;
    for(int &v:adj[u]) if(v!=fa&&!bk[v]) {
        etr(v, u, lvl, rt, tv); }
    ot[lvl][u]=ct;
}

void rec(int rt, int nds, int fa=-1, int lvl=0) {
    if(nds<=1) return; dfs(rt, 0);
    rt=crt(rt, nds/2, 0); pa[rt]=fa;
    //  cout<<rt<<el;
    bk[rt]=true; ct=0;

    // get ett
    cp[lvl][rt]=tp[lvl][rt]=rt;
    for(int &v:adj[rt]) if(!bk[v]) etr(v, rt, lvl, rt, v);
    if(ct==0) return;

    // construct tree
    st[rt].init(nds);
    int tally=0, lv=-1;
    for(int &v:adj[rt]) if(!bk[v]) {
        if(sz[v]<sz[rt]) {
            tally+=sz[v];
            rec(v, sz[v], rt, lvl+1); }
        else lv=v; }
    if(~lv) rec(lv, nds-tally-1, rt, lvl+1);
}

void qry(int u, int v, ll val) {

    // find smallest component
    int cur=0;
    while(cur<LOG-1&&cp[cur+1][u]==cp[cur+1][v]&&cp[cur+1][u]!=0) ++cur;
    //  cout<<"iterating on "<<u<<" starting with "<<cur<<" delta "<<val<<el;

    int crt=cp[cur][u];
    while(cur>=0) {
        // cout<<"crt "<<crt<<el;
        int w=(in[cur][u]>in[cur][v]?u:v);

        // cout<<"level "<<cur<<" w "<<w<<" cent "<<crt<<" updating "<<in[cur][w]<<" "<<ot[cur][w]<<el;
        st[crt].upd(1, 1, st[crt].wt, in[cur][w], ot[cur][w], val);

        // query max
        auto x=st[crt].rmq(1, 1, st[crt].wt, 1, st[crt].wt);
        x.s=mp[crt][x.s];
        // cout<<"x value "<<x.f<<" "<<x.s<<" "<<tp[cur][x.s]<<" "<<in[cur][tp[cur][x.s]]<<" "<<ot[cur][tp[cur][x.s]]<<el;
        auto y=max(st[crt].rmq(1, 1, st[crt].wt, 1, in[cur][tp[cur][x.s]]-1), st[crt].rmq(1, 1, st[crt].wt, ot[cur][tp[cur][x.s]]+1, st[crt].wt));
        //cout<<"y value "<<y.f<<" "<<x.s<<el;

        ll cnd=x.f+y.f;
        if(cnd!=av[crt]) {
            ast.erase(ast.find(av[crt]));
            ast.insert(av[crt]=cnd);
        }

        crt=pa[crt]; cur--;
    }

}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin>>N>>Q>>W;
    vector<pair<ll,pair<int,int>>> edg;
    for(int i=1; i<N; ++i) {
        ll u, v, w; cin>>u>>v>>w;
        adj[u].pb(v); adj[v].pb(u);
        edg.pb({w,{u,v}});
    }

    // preprocess
    rec(1, N);
    for(int i=1; i<=N; ++i) ast.insert(0);
    for(auto &e:edg) qry(e.s.f, e.s.s, e.f);

    ll last=0, e, w;
    for(int q=1; q<=Q; ++q) {
        cin>>e>>w;
        e=(e+last)%(N-1);
        w=(w+last)%W;

        qry(edg[e].s.f, edg[e].s.s, w-edg[e].f);
        last=*ast.rbegin(); edg[e].f=w;
        cout<<last<<el;
    }
}

Compilation message

diameter.cpp: In member function 'void tree::build(int, int, int)':
diameter.cpp:43:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |         int m=sl+sr>>1;
      |               ~~^~~
diameter.cpp: In member function 'void tree::upd(int, int, int, int, int, ll)':
diameter.cpp:59:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |         int m=sl+sr>>1;
      |               ~~^~~
diameter.cpp: In member function 'std::pair<long long int, int> tree::rmq(int, int, int, int, int)':
diameter.cpp:69:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   69 |         int m=sl+sr>>1;
      |               ~~^~~
diameter.cpp: In function 'void rec(int, int, int, int)':
diameter.cpp:101:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  101 |     if(nds<=1) return; dfs(rt, 0);
      |     ^~
diameter.cpp:101:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  101 |     if(nds<=1) return; dfs(rt, 0);
      |                        ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 26956 KB Output is correct
2 Correct 21 ms 26944 KB Output is correct
3 Correct 21 ms 26996 KB Output is correct
4 Correct 23 ms 26956 KB Output is correct
5 Correct 22 ms 27020 KB Output is correct
6 Correct 22 ms 26992 KB Output is correct
7 Correct 22 ms 27028 KB Output is correct
8 Correct 21 ms 27084 KB Output is correct
9 Correct 22 ms 27084 KB Output is correct
10 Correct 23 ms 27088 KB Output is correct
11 Correct 23 ms 27072 KB Output is correct
12 Correct 22 ms 27084 KB Output is correct
13 Correct 24 ms 27100 KB Output is correct
14 Correct 27 ms 27088 KB Output is correct
15 Correct 23 ms 27052 KB Output is correct
16 Correct 24 ms 27128 KB Output is correct
17 Correct 24 ms 27144 KB Output is correct
18 Correct 23 ms 27076 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 26956 KB Output is correct
2 Correct 21 ms 26944 KB Output is correct
3 Correct 21 ms 26996 KB Output is correct
4 Correct 23 ms 26956 KB Output is correct
5 Correct 22 ms 27020 KB Output is correct
6 Correct 22 ms 26992 KB Output is correct
7 Correct 22 ms 27028 KB Output is correct
8 Correct 21 ms 27084 KB Output is correct
9 Correct 22 ms 27084 KB Output is correct
10 Correct 23 ms 27088 KB Output is correct
11 Correct 23 ms 27072 KB Output is correct
12 Correct 22 ms 27084 KB Output is correct
13 Correct 24 ms 27100 KB Output is correct
14 Correct 27 ms 27088 KB Output is correct
15 Correct 23 ms 27052 KB Output is correct
16 Correct 24 ms 27128 KB Output is correct
17 Correct 24 ms 27144 KB Output is correct
18 Correct 23 ms 27076 KB Output is correct
19 Correct 43 ms 28040 KB Output is correct
20 Correct 44 ms 28076 KB Output is correct
21 Correct 47 ms 28300 KB Output is correct
22 Correct 57 ms 28408 KB Output is correct
23 Correct 72 ms 32468 KB Output is correct
24 Correct 93 ms 34092 KB Output is correct
25 Correct 99 ms 35004 KB Output is correct
26 Correct 121 ms 36248 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 26988 KB Output is correct
2 Correct 26 ms 27040 KB Output is correct
3 Correct 26 ms 26892 KB Output is correct
4 Correct 31 ms 26964 KB Output is correct
5 Correct 68 ms 27308 KB Output is correct
6 Correct 23 ms 26948 KB Output is correct
7 Correct 24 ms 27084 KB Output is correct
8 Correct 24 ms 27084 KB Output is correct
9 Correct 29 ms 27084 KB Output is correct
10 Correct 40 ms 27136 KB Output is correct
11 Correct 102 ms 27544 KB Output is correct
12 Correct 28 ms 28168 KB Output is correct
13 Correct 28 ms 28220 KB Output is correct
14 Correct 32 ms 28264 KB Output is correct
15 Correct 52 ms 28340 KB Output is correct
16 Correct 130 ms 28636 KB Output is correct
17 Correct 159 ms 51100 KB Output is correct
18 Correct 156 ms 51116 KB Output is correct
19 Correct 161 ms 51312 KB Output is correct
20 Correct 197 ms 51208 KB Output is correct
21 Correct 304 ms 51880 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 28248 KB Output is correct
2 Correct 55 ms 28284 KB Output is correct
3 Correct 158 ms 28404 KB Output is correct
4 Correct 302 ms 28964 KB Output is correct
5 Correct 105 ms 43072 KB Output is correct
6 Correct 158 ms 43200 KB Output is correct
7 Correct 368 ms 43552 KB Output is correct
8 Correct 625 ms 43684 KB Output is correct
9 Correct 525 ms 122676 KB Output is correct
10 Correct 605 ms 122804 KB Output is correct
11 Correct 978 ms 122832 KB Output is correct
12 Correct 1526 ms 123196 KB Output is correct
13 Correct 1062 ms 231300 KB Output is correct
14 Correct 1203 ms 231356 KB Output is correct
15 Correct 1712 ms 231484 KB Output is correct
16 Correct 2308 ms 231920 KB Output is correct
17 Correct 3087 ms 231928 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3697 ms 194652 KB Output is correct
2 Correct 3822 ms 200292 KB Output is correct
3 Correct 3854 ms 197420 KB Output is correct
4 Correct 3861 ms 201088 KB Output is correct
5 Correct 3732 ms 190296 KB Output is correct
6 Correct 2699 ms 140244 KB Output is correct
7 Execution timed out 5108 ms 244164 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 26956 KB Output is correct
2 Correct 21 ms 26944 KB Output is correct
3 Correct 21 ms 26996 KB Output is correct
4 Correct 23 ms 26956 KB Output is correct
5 Correct 22 ms 27020 KB Output is correct
6 Correct 22 ms 26992 KB Output is correct
7 Correct 22 ms 27028 KB Output is correct
8 Correct 21 ms 27084 KB Output is correct
9 Correct 22 ms 27084 KB Output is correct
10 Correct 23 ms 27088 KB Output is correct
11 Correct 23 ms 27072 KB Output is correct
12 Correct 22 ms 27084 KB Output is correct
13 Correct 24 ms 27100 KB Output is correct
14 Correct 27 ms 27088 KB Output is correct
15 Correct 23 ms 27052 KB Output is correct
16 Correct 24 ms 27128 KB Output is correct
17 Correct 24 ms 27144 KB Output is correct
18 Correct 23 ms 27076 KB Output is correct
19 Correct 43 ms 28040 KB Output is correct
20 Correct 44 ms 28076 KB Output is correct
21 Correct 47 ms 28300 KB Output is correct
22 Correct 57 ms 28408 KB Output is correct
23 Correct 72 ms 32468 KB Output is correct
24 Correct 93 ms 34092 KB Output is correct
25 Correct 99 ms 35004 KB Output is correct
26 Correct 121 ms 36248 KB Output is correct
27 Correct 21 ms 26988 KB Output is correct
28 Correct 26 ms 27040 KB Output is correct
29 Correct 26 ms 26892 KB Output is correct
30 Correct 31 ms 26964 KB Output is correct
31 Correct 68 ms 27308 KB Output is correct
32 Correct 23 ms 26948 KB Output is correct
33 Correct 24 ms 27084 KB Output is correct
34 Correct 24 ms 27084 KB Output is correct
35 Correct 29 ms 27084 KB Output is correct
36 Correct 40 ms 27136 KB Output is correct
37 Correct 102 ms 27544 KB Output is correct
38 Correct 28 ms 28168 KB Output is correct
39 Correct 28 ms 28220 KB Output is correct
40 Correct 32 ms 28264 KB Output is correct
41 Correct 52 ms 28340 KB Output is correct
42 Correct 130 ms 28636 KB Output is correct
43 Correct 159 ms 51100 KB Output is correct
44 Correct 156 ms 51116 KB Output is correct
45 Correct 161 ms 51312 KB Output is correct
46 Correct 197 ms 51208 KB Output is correct
47 Correct 304 ms 51880 KB Output is correct
48 Correct 29 ms 28248 KB Output is correct
49 Correct 55 ms 28284 KB Output is correct
50 Correct 158 ms 28404 KB Output is correct
51 Correct 302 ms 28964 KB Output is correct
52 Correct 105 ms 43072 KB Output is correct
53 Correct 158 ms 43200 KB Output is correct
54 Correct 368 ms 43552 KB Output is correct
55 Correct 625 ms 43684 KB Output is correct
56 Correct 525 ms 122676 KB Output is correct
57 Correct 605 ms 122804 KB Output is correct
58 Correct 978 ms 122832 KB Output is correct
59 Correct 1526 ms 123196 KB Output is correct
60 Correct 1062 ms 231300 KB Output is correct
61 Correct 1203 ms 231356 KB Output is correct
62 Correct 1712 ms 231484 KB Output is correct
63 Correct 2308 ms 231920 KB Output is correct
64 Correct 3087 ms 231928 KB Output is correct
65 Correct 3697 ms 194652 KB Output is correct
66 Correct 3822 ms 200292 KB Output is correct
67 Correct 3854 ms 197420 KB Output is correct
68 Correct 3861 ms 201088 KB Output is correct
69 Correct 3732 ms 190296 KB Output is correct
70 Correct 2699 ms 140244 KB Output is correct
71 Execution timed out 5108 ms 244164 KB Time limit exceeded
72 Halted 0 ms 0 KB -