oj.uz

Submission #895913

# Submission time Handle Problem Language Result Execution time Memory
895913 2023-12-31T04:38:27 Z math_rabbit_1028 Dynamic Diameter (CEOI19_diameter) C++14
31 / 100
 5000 ms 487680 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef struct {
    int idx;
    ll val;
} pil;

int n, q;
ll w;
ll edges[101010][3];
vector<pil> adj[101010];
int ch[101010], sz[101010];

struct subtree {
    int cent, tot, r, d;
    vector<pil> ord;
    map<int, int> in, out, depth, dir, child;

    void ett(int v, ll dis, int par = -1) {
        ord[++r] = {v, dis}; in[v] = r;
        if (par != -1) dir[v] = d;
        for (int i = 0; i < adj[v].size(); i++) {
            int u = adj[v][i].idx;
            if (u == par) continue;
            if (ch[u] == 1) continue;
            depth[u] = depth[v] + 1;
            if (par == -1) d = u;
            ett(u, dis + adj[v][i].val, v);
        }
        out[v] = r;
    }

    struct maxseg {
        vector<pil> tree;
        vector<ll> lazy;

        pil mer(pil lt, pil rt) {
            if (lt.val > rt.val) return lt;
            if (lt.val < rt.val) return rt;
            if (lt.val == rt.val) {
                if (lt.idx > rt.idx) return lt;
                else return rt;
            }
        }

        void prop(int v, int st, int ed) {
            tree[v].val += lazy[v];
            if (st != ed) {
                lazy[2*v] += lazy[v];
                lazy[2*v+1] += lazy[v];
            }
            lazy[v] = 0;
        }

        void init(int v, int st, int ed, vector<pil>* ord) {
            if (st == ed) {
                tree[v] = (*ord)[st];
                lazy[v] = 0;
                return;
            }
            int mid = (st + ed) / 2;
            init(2*v, st, mid, ord);
            init(2*v+1, mid+1, ed, ord);
            tree[v] = mer(tree[2*v], tree[2*v+1]);
        }

        void upd(int v, int st, int ed, int lt, int rt, ll diff) {
            prop(v, st, ed);
            if (lt <= st && ed <= rt) {
                lazy[v] = diff;
                prop(v, st, ed);
                return;
            }
            if (st > rt || lt > ed) return;
            int mid = (st + ed) / 2;
            upd(2*v, st, mid, lt, rt, diff);
            upd(2*v+1, mid+1, ed, lt, rt, diff);
            tree[v] = mer(tree[2*v], tree[2*v+1]);
        }

        pil get(int v, int st, int ed, int lt, int rt) {
            prop(v, st, ed);
            if (lt <= st && ed <= rt) return tree[v];
            if (st > rt || lt > ed) return {0, 0};
            int mid = (st + ed) / 2;
            return mer(get(2*v, st, mid, lt, rt), get(2*v+1, mid+1, ed, lt, rt));
        }
    } seg;

    void init() {
        r = 0;
        for (int i = 0; i <= tot; i++) ord.push_back({0, 0});
        seg.tree.resize(4*tot);
        seg.lazy.resize(4*tot);

        ett(cent, 0);

        seg.init(1, 1, tot, &ord);
    }

    int update(int d, ll e) {
        int v = (depth[edges[d][0]] > depth[edges[d][1]] ? edges[d][0] : edges[d][1]);
        int u = (depth[edges[d][0]] < depth[edges[d][1]] ? edges[d][0] : edges[d][1]);
        seg.upd(1, 1, tot, in[v], out[v], e - edges[d][2]);
        return (u != cent ? child[dir[v]] : 0);
    }

    int get(ll* dst) {
        pil x = seg.get(1, 1, tot, 1, tot);
        int u = dir[x.idx];
        pil y = seg.get(1, 1, tot, 1, in[u]-1);
        pil z = seg.get(1, 1, tot, out[u]+1, tot);
        *dst = max(*dst, x.val + max(y.val, z.val));
        return child[u];
    }

} sub[101010];

void get_sz(int v, int par = -1) {
    sz[v] = 1;
    for (int i = 0; i < adj[v].size(); i++) {
        int u = adj[v][i].idx;
        if (ch[u] == 1) continue;
        if (u == par) continue;
        get_sz(u, v);
        sz[v] += sz[u];
    }
}

int get_cent(int tot, int v, int par = -1) {
    for (int i = 0; i < adj[v].size(); i++) {
        int u = adj[v][i].idx;
        if (ch[u] == 1) continue;
        if (u == par) continue;
        if (sz[u] * 2 > tot) return get_cent(tot, u, v);
    }
    return v;
}

int cent(int v, int tot) {
    get_sz(v);
    v = get_cent(tot, v);
    get_sz(v);

    sub[v].tot = tot;
    sub[v].cent = v;
    sub[v].init();

    ch[v] = 1;
    for (int i = 0; i < adj[v].size(); i++) {
        int u = adj[v][i].idx;
        if (ch[u] == 1) continue;
        sub[v].child[u] = cent(u, sz[u]);
    }

    return v;
}

void update(int cent, int d, ll e) {
    while (sub[cent].tot > 1) {
        cent = sub[cent].update(d, e);
    }
}

void get(int cent, ll* dst) {
    while (sub[cent].tot > 1) {
        cent = sub[cent].get(dst);
    }
}

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

    cin >> n >> q >> w;

    for (int i = 1; i < n; i++) {
        int a, b; ll c;
        cin >> a >> b >> c;
        edges[i][0] = a;
        edges[i][1] = b;
        edges[i][2] = c;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }

    int CENT = cent(1, n);

    ll last = 0;
    while (q--) {
        int d; ll e;
        cin >> d >> e;

        d = (d + last) % (n - 1) + 1;
        e = (e + last) % w;

        update(CENT, d, e);
        edges[d][2] = e;

        last = -1;
        get(CENT, &last);
        cout << last << "\n";
    }

    return 0;
}

Compilation message

diameter.cpp: In member function 'void subtree::ett(int, ll, int)':
diameter.cpp:23:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pil>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int i = 0; i < adj[v].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void get_sz(int, int)':
diameter.cpp:122:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pil>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for (int i = 0; i < adj[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'int get_cent(int, int, int)':
diameter.cpp:132:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pil>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for (int i = 0; i < adj[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'int cent(int, int)':
diameter.cpp:151:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pil>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |     for (int i = 0; i < adj[v].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
diameter.cpp: In member function 'pil subtree::maxseg::mer(pil, pil)':
diameter.cpp:45:9: warning: control reaches end of non-void function [-Wreturn-type]
   45 |         }
      |         ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37468 KB Output is correct
2 Correct 8 ms 37492 KB Output is correct
3 Correct 7 ms 37468 KB Output is correct
4 Correct 7 ms 37468 KB Output is correct
5 Correct 7 ms 37468 KB Output is correct
6 Correct 7 ms 37468 KB Output is correct
7 Correct 7 ms 37468 KB Output is correct
8 Correct 7 ms 37524 KB Output is correct
9 Correct 7 ms 37620 KB Output is correct
10 Correct 8 ms 37492 KB Output is correct
11 Correct 7 ms 37468 KB Output is correct
12 Correct 7 ms 37468 KB Output is correct
13 Correct 8 ms 37468 KB Output is correct
14 Correct 7 ms 37484 KB Output is correct
15 Correct 7 ms 37516 KB Output is correct
16 Correct 8 ms 37464 KB Output is correct
17 Correct 7 ms 37464 KB Output is correct
18 Correct 8 ms 37724 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37468 KB Output is correct
2 Correct 8 ms 37492 KB Output is correct
3 Correct 7 ms 37468 KB Output is correct
4 Correct 7 ms 37468 KB Output is correct
5 Correct 7 ms 37468 KB Output is correct
6 Correct 7 ms 37468 KB Output is correct
7 Correct 7 ms 37468 KB Output is correct
8 Correct 7 ms 37524 KB Output is correct
9 Correct 7 ms 37620 KB Output is correct
10 Correct 8 ms 37492 KB Output is correct
11 Correct 7 ms 37468 KB Output is correct
12 Correct 7 ms 37468 KB Output is correct
13 Correct 8 ms 37468 KB Output is correct
14 Correct 7 ms 37484 KB Output is correct
15 Correct 7 ms 37516 KB Output is correct
16 Correct 8 ms 37464 KB Output is correct
17 Correct 7 ms 37464 KB Output is correct
18 Correct 8 ms 37724 KB Output is correct
19 Correct 31 ms 39260 KB Output is correct
20 Correct 33 ms 39516 KB Output is correct
21 Correct 39 ms 39772 KB Output is correct
22 Correct 42 ms 40420 KB Output is correct
23 Correct 66 ms 48212 KB Output is correct
24 Correct 88 ms 51240 KB Output is correct
25 Correct 105 ms 53224 KB Output is correct
26 Correct 111 ms 55744 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37468 KB Output is correct
2 Correct 7 ms 37468 KB Output is correct
3 Correct 8 ms 37572 KB Output is correct
4 Correct 16 ms 37464 KB Output is correct
5 Correct 62 ms 37808 KB Output is correct
6 Correct 7 ms 37464 KB Output is correct
7 Correct 7 ms 37720 KB Output is correct
8 Correct 7 ms 37724 KB Output is correct
9 Correct 9 ms 37724 KB Output is correct
10 Correct 24 ms 37968 KB Output is correct
11 Correct 91 ms 38128 KB Output is correct
12 Correct 16 ms 40780 KB Output is correct
13 Correct 14 ms 40796 KB Output is correct
14 Correct 17 ms 40796 KB Output is correct
15 Correct 39 ms 40796 KB Output is correct
16 Correct 140 ms 41300 KB Output is correct
17 Correct 184 ms 104000 KB Output is correct
18 Correct 181 ms 104136 KB Output is correct
19 Correct 180 ms 104152 KB Output is correct
20 Correct 228 ms 104236 KB Output is correct
21 Correct 414 ms 104704 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 40028 KB Output is correct
2 Correct 44 ms 40028 KB Output is correct
3 Correct 176 ms 40168 KB Output is correct
4 Correct 339 ms 40708 KB Output is correct
5 Correct 87 ms 72404 KB Output is correct
6 Correct 173 ms 72560 KB Output is correct
7 Correct 505 ms 72740 KB Output is correct
8 Correct 962 ms 73072 KB Output is correct
9 Correct 494 ms 246820 KB Output is correct
10 Correct 663 ms 246976 KB Output is correct
11 Correct 1433 ms 247240 KB Output is correct
12 Correct 2393 ms 247564 KB Output is correct
13 Correct 1142 ms 486780 KB Output is correct
14 Correct 1314 ms 487132 KB Output is correct
15 Correct 2372 ms 487284 KB Output is correct
16 Correct 3766 ms 487668 KB Output is correct
17 Execution timed out 5119 ms 487680 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4886 ms 375520 KB Output is correct
2 Execution timed out 5017 ms 387372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 37468 KB Output is correct
2 Correct 8 ms 37492 KB Output is correct
3 Correct 7 ms 37468 KB Output is correct
4 Correct 7 ms 37468 KB Output is correct
5 Correct 7 ms 37468 KB Output is correct
6 Correct 7 ms 37468 KB Output is correct
7 Correct 7 ms 37468 KB Output is correct
8 Correct 7 ms 37524 KB Output is correct
9 Correct 7 ms 37620 KB Output is correct
10 Correct 8 ms 37492 KB Output is correct
11 Correct 7 ms 37468 KB Output is correct
12 Correct 7 ms 37468 KB Output is correct
13 Correct 8 ms 37468 KB Output is correct
14 Correct 7 ms 37484 KB Output is correct
15 Correct 7 ms 37516 KB Output is correct
16 Correct 8 ms 37464 KB Output is correct
17 Correct 7 ms 37464 KB Output is correct
18 Correct 8 ms 37724 KB Output is correct
19 Correct 31 ms 39260 KB Output is correct
20 Correct 33 ms 39516 KB Output is correct
21 Correct 39 ms 39772 KB Output is correct
22 Correct 42 ms 40420 KB Output is correct
23 Correct 66 ms 48212 KB Output is correct
24 Correct 88 ms 51240 KB Output is correct
25 Correct 105 ms 53224 KB Output is correct
26 Correct 111 ms 55744 KB Output is correct
27 Correct 7 ms 37468 KB Output is correct
28 Correct 7 ms 37468 KB Output is correct
29 Correct 8 ms 37572 KB Output is correct
30 Correct 16 ms 37464 KB Output is correct
31 Correct 62 ms 37808 KB Output is correct
32 Correct 7 ms 37464 KB Output is correct
33 Correct 7 ms 37720 KB Output is correct
34 Correct 7 ms 37724 KB Output is correct
35 Correct 9 ms 37724 KB Output is correct
36 Correct 24 ms 37968 KB Output is correct
37 Correct 91 ms 38128 KB Output is correct
38 Correct 16 ms 40780 KB Output is correct
39 Correct 14 ms 40796 KB Output is correct
40 Correct 17 ms 40796 KB Output is correct
41 Correct 39 ms 40796 KB Output is correct
42 Correct 140 ms 41300 KB Output is correct
43 Correct 184 ms 104000 KB Output is correct
44 Correct 181 ms 104136 KB Output is correct
45 Correct 180 ms 104152 KB Output is correct
46 Correct 228 ms 104236 KB Output is correct
47 Correct 414 ms 104704 KB Output is correct
48 Correct 15 ms 40028 KB Output is correct
49 Correct 44 ms 40028 KB Output is correct
50 Correct 176 ms 40168 KB Output is correct
51 Correct 339 ms 40708 KB Output is correct
52 Correct 87 ms 72404 KB Output is correct
53 Correct 173 ms 72560 KB Output is correct
54 Correct 505 ms 72740 KB Output is correct
55 Correct 962 ms 73072 KB Output is correct
56 Correct 494 ms 246820 KB Output is correct
57 Correct 663 ms 246976 KB Output is correct
58 Correct 1433 ms 247240 KB Output is correct
59 Correct 2393 ms 247564 KB Output is correct
60 Correct 1142 ms 486780 KB Output is correct
61 Correct 1314 ms 487132 KB Output is correct
62 Correct 2372 ms 487284 KB Output is correct
63 Correct 3766 ms 487668 KB Output is correct
64 Execution timed out 5119 ms 487680 KB Time limit exceeded
65 Halted 0 ms 0 KB -