oj.uz

Submission #446281

# Submission time Handle Problem Language Result Execution time Memory
446281 2021-07-21T13:01:49 Z qwerasdfzxcl Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 425100 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;
struct Node{
    int x, y, w, nxt, ver;
    Node(){}
    Node(int _x, int _y, int _w, int _nxt, int _ver):x(_x), y(_y), w(_w), nxt(_nxt), ver(_ver){}
};
Node combine(Node x, Node y){
    if (x.w>=y.w) return x;
    return y;
}
struct Seg{
    vector<Node> tree;
    vector<int> lazy;
    int sz;
    void make_tree(int n){
        sz = n;
        tree.resize(sz*4+4);
        lazy.resize(sz*4+4, 0);
    }
    void init(int i, int l, int r, vector<Node> &vec){
        if (l==r){
            tree[i] = vec[l];
            return;
        }
        int m = (l+r)>>1;
        init(i<<1, l, m, vec); init(i<<1|1, m+1, r, vec);
        tree[i] = combine(tree[i<<1], tree[i<<1|1]);
    }
    void propagate(int i, int l, int r){
        tree[i].w += lazy[i];
        if (l!=r){
            lazy[i<<1] += lazy[i];
            lazy[i<<1|1] += lazy[i];
        }
        lazy[i] = 0;
    }
    void update(int i, int l, int r, int s, int e, int val){
        propagate(i, l, r);
        if (r<s || e<l) return;
        if (s<=l && r<=e){
            lazy[i] += val; propagate(i, l, r); return;
        }
        int m = (l+r)>>1;
        update(i<<1, l, m, s, e, val); update(i<<1|1, m+1, r, s, e, val);
        tree[i] = combine(tree[i<<1], tree[i<<1|1]);
    }
    Node query(int i, int l, int r, int s, int e){
        if (s>e) return Node(0, 0, -9e18, 0, 0);
        propagate(i, l, r);
        if (r<s || e<l) return Node(0, 0, -9e18, 0, 0);
        if (s<=l && r<=e) return tree[i];
        int m = (l+r)>>1;
        Node ret = query(i<<1, l, m, s, e);
        ret = combine(ret, query(i<<1|1, m+1, r, s, e));
        return ret;
    }
}tree[100100];
struct Edge{
    int s, e, x;
    Edge(){}
    Edge(int _s, int _e, int _x): s(_s), e(_e), x(_x){}
    int nxt(int val){
        if (s==val) return e;
        return s;
    }
}e[100100];
vector<int> adj[100100], g[100100];
int sz[100100];
bool cent_visited[100100];

void getsz(int s, int pa){
    sz[s] = 1;
    for (auto &v:adj[s]){
        int nxt = e[v].nxt(s);
        if (nxt==pa || cent_visited[nxt]) continue;
        getsz(nxt, s);
        sz[s] += sz[nxt];
    }
}

int getcent(int s, int pa, int mx){
    for (auto &v:adj[s]){
        int nxt = e[v].nxt(s);
        if (nxt==pa || cent_visited[nxt]) continue;
        if (sz[nxt]*2>mx) return getcent(nxt, s, mx);
    }
    return s;
}

int cnt;
vector<Node> vec;
map<int, pair<int, int>> mp[100100];
map<int, int> mp2[100100], mp3[100100], mp4[100100];
vector<pair<int, int>> ran[100100];

pair<int, int> dfs(int s, int pa, int val, int cent){
    pair<int, int> ret = {9e18, -9e18};
    for (auto &v:adj[s]){
        int nxt = e[v].nxt(s);
        if (nxt==pa || cent_visited[nxt]) continue;
        auto p = dfs(nxt, s, val+e[v].x, cent);
        ret.first = min(ret.first, p.first);
        ret.second = max(ret.second, p.second);

        mp[cent][v] = p;
        if (cent==s){
            ran[cent].push_back(p);
            cnt++;
        }
        else{
            mp2[cent][v] = cnt;
        }
    }
    if (ret.first==9e18){
        vec.emplace_back(0, 0, val, cnt, s);
        mp3[cent][s] = cnt;
        mp4[cent][s] = (int)vec.size()-1;
        return make_pair((int)vec.size()-1, (int)vec.size()-1);
    }
    return ret;
}

int getcentree(int s){
    getsz(s, -1);
    if (sz[s]==1) return s;
    int cent = getcent(s, -1, sz[s]);
    cnt = 0;
    vec.clear();
    auto p = dfs(cent, -1, 0, cent);
    for (auto &N:vec) N.x = ran[cent][N.nxt].first, N.y = ran[cent][N.nxt].second;
    //for (auto &N:vec) printf("%lld %lld %lld %lld\n", N.x, N.y, N.w, N.nxt);
    //printf("%lld %lld\n", p.first, p.second);
    tree[cent].make_tree((int)vec.size());
    tree[cent].init(1, 0, p.second, vec);

    cent_visited[cent] = 1;
    for (auto &v:adj[cent]){
        int nxt = e[v].nxt(cent);
        if (cent_visited[nxt]) continue;
        int x = getcentree(nxt);
        g[cent].push_back(x);
    }
    return cent;
}

signed main(){
    int n, q, w;
    scanf("%lld %lld %lld", &n, &q, &w);
    for (int i=0;i<n-1;i++){
        scanf("%lld %lld %lld", &e[i].s, &e[i].e, &e[i].x);
        adj[e[i].s].push_back(i);
        adj[e[i].e].push_back(i);
    }

    int CENT = getcentree(1);
    /*for (int i=0;i<3;i++){
        Node tmp2 = tree[2].query(1, 0, 2, i, i);
        printf("%lld %lld %lld %lld\n", tmp2.x, tmp2.y, tmp2.w, tmp2.nxt);
    }*/
    /*printf("CENT: %lld\n", CENT);
    for (int i=1;i<=n;i++){
        printf("%lld:", i);
        for (auto &v:g[i]) printf(" %lld", v);
        printf("\n");
    }*/

    int last = 0;
    while(q--){
        int x, y;
        scanf("%lld %lld", &x, &y);
        x = (x+last)%(n-1);
        y = (y+last)%w;
        int org = e[x].x;
        e[x].x = y;
        //printf(" %lld %lld %lld\n", y, org, e[x].x);

        int pos = CENT;
        while(true){
            if (g[pos].empty()) break;
            assert(mp[pos].find(x)!=mp[pos].end());
            auto p = mp[pos][x];
            //printf("%lld %lld\n", p.first, p.second);
            tree[pos].update(1, 0, tree[pos].sz-1, p.first, p.second, y-org);
            if (mp2[pos].find(x)==mp2[pos].end()) break;
            pos = g[pos][mp2[pos][x]];
        }

        int ans = 0;
        pos = CENT;
        int dend = -1;
        while(true){
            if (g[pos].empty()) break;
            //printf(" %lld: ", pos);
            if (pos==CENT){
                auto tmp = tree[pos].query(1, 0, tree[pos].sz-1, 0, tree[pos].sz-1);
                auto tmp2 = tree[pos].query(1, 0, tree[pos].sz-1, 0, tmp.x-1);
                auto tmp3 = tree[pos].query(1, 0, tree[pos].sz-1, tmp.y+1, tree[pos].sz-1);
                int val = max(tmp.w, tmp.w+max(tmp2.w, tmp3.w));
                /*printf("%lld %lld %lld %lld %lld\n", tmp.x, tmp.y, tmp.w, tmp.nxt, tmp.ver);
                printf("%lld %lld %lld %lld %lld\n", tmp2.x, tmp2.y, tmp2.w, tmp2.nxt, tmp2.ver);
                printf("%lld %lld %lld %lld %lld\n", tmp3.x, tmp3.y, tmp3.w, tmp3.nxt, tmp3.ver);*/
                ans = max(ans, val);
                dend = tmp.ver;
                pos = g[pos][tmp.nxt];
            }
            else{
                int tmpval = mp3[pos][dend], val2 = mp4[pos][dend];
                auto p = ran[pos][tmpval];
                auto tmp = tree[pos].query(1, 0, tree[pos].sz-1, val2, val2);
                auto tmp2 = tree[pos].query(1, 0, tree[pos].sz-1, 0, p.first-1);
                auto tmp3 = tree[pos].query(1, 0, tree[pos].sz-1, p.second+1, tree[pos].sz-1);
                int val = max(tmp.w, tmp.w+max(tmp2.w, tmp3.w));
                ans = max(ans, val);
                pos = g[pos][tmpval];
            }
            //printf(" %lld %lld %lld\n", pos, dend, ans);
        }
        printf("%lld\n", ans);
        last = ans;
    }
    return 0;
}

Compilation message

diameter.cpp: In function 'int main()':
diameter.cpp:151:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  151 |     scanf("%lld %lld %lld", &n, &q, &w);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:153:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  153 |         scanf("%lld %lld %lld", &e[i].s, &e[i].e, &e[i].x);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:173:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  173 |         scanf("%lld %lld", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31692 KB Output is correct
2 Correct 17 ms 31636 KB Output is correct
3 Correct 18 ms 31652 KB Output is correct
4 Correct 17 ms 31564 KB Output is correct
5 Correct 19 ms 31564 KB Output is correct
6 Correct 17 ms 31616 KB Output is correct
7 Correct 17 ms 31692 KB Output is correct
8 Correct 20 ms 31636 KB Output is correct
9 Correct 17 ms 31692 KB Output is correct
10 Correct 17 ms 31632 KB Output is correct
11 Correct 17 ms 31592 KB Output is correct
12 Correct 18 ms 31632 KB Output is correct
13 Correct 18 ms 31672 KB Output is correct
14 Correct 18 ms 31760 KB Output is correct
15 Correct 18 ms 31676 KB Output is correct
16 Correct 17 ms 31684 KB Output is correct
17 Correct 18 ms 31732 KB Output is correct
18 Correct 19 ms 31644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31692 KB Output is correct
2 Correct 17 ms 31636 KB Output is correct
3 Correct 18 ms 31652 KB Output is correct
4 Correct 17 ms 31564 KB Output is correct
5 Correct 19 ms 31564 KB Output is correct
6 Correct 17 ms 31616 KB Output is correct
7 Correct 17 ms 31692 KB Output is correct
8 Correct 20 ms 31636 KB Output is correct
9 Correct 17 ms 31692 KB Output is correct
10 Correct 17 ms 31632 KB Output is correct
11 Correct 17 ms 31592 KB Output is correct
12 Correct 18 ms 31632 KB Output is correct
13 Correct 18 ms 31672 KB Output is correct
14 Correct 18 ms 31760 KB Output is correct
15 Correct 18 ms 31676 KB Output is correct
16 Correct 17 ms 31684 KB Output is correct
17 Correct 18 ms 31732 KB Output is correct
18 Correct 19 ms 31644 KB Output is correct
19 Correct 48 ms 33220 KB Output is correct
20 Correct 55 ms 33356 KB Output is correct
21 Correct 57 ms 33584 KB Output is correct
22 Correct 41 ms 33256 KB Output is correct
23 Correct 94 ms 40936 KB Output is correct
24 Correct 126 ms 42468 KB Output is correct
25 Correct 135 ms 43676 KB Output is correct
26 Correct 92 ms 41120 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 31596 KB Output is correct
2 Correct 18 ms 31564 KB Output is correct
3 Correct 18 ms 31656 KB Output is correct
4 Correct 32 ms 31868 KB Output is correct
5 Correct 88 ms 32104 KB Output is correct
6 Correct 17 ms 31564 KB Output is correct
7 Correct 18 ms 31780 KB Output is correct
8 Correct 18 ms 31876 KB Output is correct
9 Correct 20 ms 31792 KB Output is correct
10 Correct 41 ms 31996 KB Output is correct
11 Correct 137 ms 32540 KB Output is correct
12 Correct 25 ms 34088 KB Output is correct
13 Correct 24 ms 34180 KB Output is correct
14 Correct 26 ms 34216 KB Output is correct
15 Correct 62 ms 34284 KB Output is correct
16 Correct 192 ms 34732 KB Output is correct
17 Correct 163 ms 78272 KB Output is correct
18 Correct 162 ms 78232 KB Output is correct
19 Correct 163 ms 78296 KB Output is correct
20 Correct 218 ms 78632 KB Output is correct
21 Correct 479 ms 78988 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 33884 KB Output is correct
2 Correct 72 ms 33984 KB Output is correct
3 Correct 273 ms 34524 KB Output is correct
4 Correct 515 ms 35180 KB Output is correct
5 Correct 134 ms 62816 KB Output is correct
6 Correct 230 ms 62844 KB Output is correct
7 Correct 720 ms 63620 KB Output is correct
8 Correct 1244 ms 63948 KB Output is correct
9 Correct 675 ms 215928 KB Output is correct
10 Correct 861 ms 216224 KB Output is correct
11 Correct 1662 ms 216364 KB Output is correct
12 Correct 2664 ms 216656 KB Output is correct
13 Correct 1448 ms 424156 KB Output is correct
14 Correct 1674 ms 424768 KB Output is correct
15 Correct 2757 ms 424796 KB Output is correct
16 Correct 3908 ms 425100 KB Output is correct
17 Execution timed out 5108 ms 425076 KB Time limit exceeded

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5023 ms 305492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31692 KB Output is correct
2 Correct 17 ms 31636 KB Output is correct
3 Correct 18 ms 31652 KB Output is correct
4 Correct 17 ms 31564 KB Output is correct
5 Correct 19 ms 31564 KB Output is correct
6 Correct 17 ms 31616 KB Output is correct
7 Correct 17 ms 31692 KB Output is correct
8 Correct 20 ms 31636 KB Output is correct
9 Correct 17 ms 31692 KB Output is correct
10 Correct 17 ms 31632 KB Output is correct
11 Correct 17 ms 31592 KB Output is correct
12 Correct 18 ms 31632 KB Output is correct
13 Correct 18 ms 31672 KB Output is correct
14 Correct 18 ms 31760 KB Output is correct
15 Correct 18 ms 31676 KB Output is correct
16 Correct 17 ms 31684 KB Output is correct
17 Correct 18 ms 31732 KB Output is correct
18 Correct 19 ms 31644 KB Output is correct
19 Correct 48 ms 33220 KB Output is correct
20 Correct 55 ms 33356 KB Output is correct
21 Correct 57 ms 33584 KB Output is correct
22 Correct 41 ms 33256 KB Output is correct
23 Correct 94 ms 40936 KB Output is correct
24 Correct 126 ms 42468 KB Output is correct
25 Correct 135 ms 43676 KB Output is correct
26 Correct 92 ms 41120 KB Output is correct
27 Correct 17 ms 31596 KB Output is correct
28 Correct 18 ms 31564 KB Output is correct
29 Correct 18 ms 31656 KB Output is correct
30 Correct 32 ms 31868 KB Output is correct
31 Correct 88 ms 32104 KB Output is correct
32 Correct 17 ms 31564 KB Output is correct
33 Correct 18 ms 31780 KB Output is correct
34 Correct 18 ms 31876 KB Output is correct
35 Correct 20 ms 31792 KB Output is correct
36 Correct 41 ms 31996 KB Output is correct
37 Correct 137 ms 32540 KB Output is correct
38 Correct 25 ms 34088 KB Output is correct
39 Correct 24 ms 34180 KB Output is correct
40 Correct 26 ms 34216 KB Output is correct
41 Correct 62 ms 34284 KB Output is correct
42 Correct 192 ms 34732 KB Output is correct
43 Correct 163 ms 78272 KB Output is correct
44 Correct 162 ms 78232 KB Output is correct
45 Correct 163 ms 78296 KB Output is correct
46 Correct 218 ms 78632 KB Output is correct
47 Correct 479 ms 78988 KB Output is correct
48 Correct 28 ms 33884 KB Output is correct
49 Correct 72 ms 33984 KB Output is correct
50 Correct 273 ms 34524 KB Output is correct
51 Correct 515 ms 35180 KB Output is correct
52 Correct 134 ms 62816 KB Output is correct
53 Correct 230 ms 62844 KB Output is correct
54 Correct 720 ms 63620 KB Output is correct
55 Correct 1244 ms 63948 KB Output is correct
56 Correct 675 ms 215928 KB Output is correct
57 Correct 861 ms 216224 KB Output is correct
58 Correct 1662 ms 216364 KB Output is correct
59 Correct 2664 ms 216656 KB Output is correct
60 Correct 1448 ms 424156 KB Output is correct
61 Correct 1674 ms 424768 KB Output is correct
62 Correct 2757 ms 424796 KB Output is correct
63 Correct 3908 ms 425100 KB Output is correct
64 Execution timed out 5108 ms 425076 KB Time limit exceeded