oj.uz

Submission #703168

# Submission time Handle Problem Language Result Execution time Memory
703168 2023-02-26T10:29:25 Z Cyanmond Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 280392 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using i64 = long long;
struct Edge {
    int to;
    i64 w;
};

using T = std::pair<i64, int>;
T op(T a, T b) {
    return std::max(a, b);
}
T e() {
    return {0, 0};
}
using U = i64;
T map(i64 a, T b) {
    return {b.first + a, b.second};
}
i64 composite(i64 a, i64 b) {
    return a + b;
}
i64 id() {
    return 0;
}

class lazySegtree {
    int n, logn, size;
    std::vector<T> node;
    std::vector<U> lazy;

    void update(int i) {
        node[i] = op(node[2 * i], node[2 * i + 1]);
    }

    void all_apply(int i, U f) {
        node[i] = map(f, node[i]);
        if (i < size) lazy[i] = composite(f, lazy[i]);
    }

    void push(int i) {
        all_apply(2 * i, lazy[i]);
        all_apply(2 * i + 1, lazy[i]);
        lazy[i] = id();
    }

    public:
    lazySegtree() {}

    lazySegtree(std::vector<T> initVec) {
        n = (int)initVec.size();
        logn = 0;
        while ((1 << logn) < n) {
            ++logn;
        }
        size = 1 << logn;
        node.assign(2 * size, e());
        lazy.assign(size, id());
        std::copy(initVec.begin(), initVec.end(), node.begin() + size);
        for (int i = size - 1; i >= 1; --i) {
            update(i);
        }
    }

    void apply(int l, int r, U f) {
        l += size, r += size;
        for (int d = logn; d >= 1; --d) {
            if (((l >> d) << d) != l) push(l >> d);
            if (((r >> d) << d) != r) push((r - 1) >> d);
        }
        int l2 = l, r2 = r;
        while (l < r) {
            if (l & 1) all_apply(l++, f);
            if (r & 1) all_apply(--r, f);
            l /= 2;
            r /= 2;
        }
        l = l2, r = r2;
        for (int d = 1; d <= logn; ++d) {
            if (((l >> d) << d) != l) update(l >> d);
            if (((r >> d) << d) != r) update((r - 1) >> d);
        }
    }

    T fold(int l, int r) {
        l += size, r += size;
        for (int d = logn; d >= 1; --d) {
            if (((l >> d) << d) != l) push(l >> d);
            if (((r >> d) << d) != r) push((r - 1) >> d);
        }
        T pl = e(), pr = e();
        while (l < r) {
            if (l & 1) pl = op(pl, node[l++]);
            if (r & 1) pr = op(node[--r], pr);
            l /= 2;
            r /= 2;
        }
        return op(pl, pr);
    }
};

struct TreeManager {
    int n;
    std::vector<std::vector<Edge>> tree;
    std::vector<bool> isOn, isCentroid;
    std::vector<int> size, in, out, fe, cen;
    std::vector<int> revIn;
    std::vector<i64> depth;

    TreeManager() {}

    TreeManager(const std::vector<std::vector<Edge>> &tree_, std::vector<bool> ison, std::vector<int> roots) {
        isOn = ison;
        tree = tree_;
        n = tree.size();
        isCentroid.assign(n, false);
        size.assign(n, -1);
        in.assign(n, -1);
        out.assign(n, -1);
        depth.assign(n, 0);
        fe.assign(n, 0);
        cen.assign(n, 0);
        int id = 0;
        for (const int v : roots) {
            dfs1(v, -1);
            int x = findCentroid(v, -1, size[v]);
            dfs2(x, -1, id, 0, -1, x);
        }
        revIn.resize(n);
        for (int i = 0; i < n; ++i) {
            if (in[i] >= 0) {
                revIn[in[i]] = i;
            }
        }
    }

    void dfs1(int v, int p) {
        size[v] = 1;
        for (const auto &[t, w] : tree[v]) {
            if (t == p or (not isOn[t])) {
                continue;
            }
            dfs1(t, v);
            size[v] += size[t];
        }
    }

    int findCentroid(int v, int p, int as) {
        bool isCent = true;
        for (const auto &[t, w] : tree[v]) {
            if (t == p or (not isOn[t])) {
                continue;
            }
            int res = findCentroid(t, v, as);
            if (res != -1) {
                return res;
            }
            if (size[t] > as / 2) {
                isCent = false;
            }
        }
        if ((as - size[v]) > as / 2) {
            isCent = false;
        }
        isCentroid[v] = isCent;
        return isCent ? v : -1;
    }

    void dfs2(int v, int p, int &id, i64 d, int f, int ce) {
        fe[v] = f;
        in[v] = id++;
        cen[v] = ce;
        depth[v] = d;
        size[v] = 1;
        for (const auto &[t, w] : tree[v]) {
            if (t == p or (not isOn[t])) {
                continue;
            }
            dfs2(t, v, id, d + w, (f == -1 ? t : f), ce);
            size[v] += size[t];
        }
        out[v] = id;
    }
};

int main() {
    int N, Q;
    i64 W;
    std::cin >> N >> Q >> W;
    std::vector<int> A(N - 1), B(N - 1);
    std::vector<i64> C(N - 1);
    std::vector<std::vector<Edge>> tree(N);
    for (int i = 0; i < N - 1; ++i) {
        std::cin >> A[i] >> B[i] >> C[i];
        --A[i], --B[i];
        tree[A[i]].push_back({B[i], C[i]});
        tree[B[i]].push_back({A[i], C[i]});
    }

    std::vector<bool> isOn(N, true);
    std::vector<int> roots = {0};
    std::vector<TreeManager> managers;
    while (true) {
        TreeManager mng(tree, isOn, roots);
        roots.clear();
        for (int i = 0; i < N; ++i) {
            if (not mng.isCentroid[i]) {
                continue;
            }
            isOn[i] = false;
            for (const auto &[t, w] : tree[i]) {
                if (not isOn[t]) {
                    continue;
                }
                roots.push_back(t);
            }
        }
        managers.push_back(std::move(mng));
        if (std::none_of(isOn.begin(), isOn.end(), [](bool b) {
            return b;
        })) {
            break;
        }
    }
    const int m = (int)managers.size();
    std::vector<lazySegtree> segs(m);
    std::multiset<i64> diameters;
    for (int x = 0; x < m; ++x) {
        auto &mng = managers[x];
        std::vector<std::pair<i64, int>> weighVec(N);
        for (int i = 0; i < N; ++i) {
            if (mng.in[i] == -1) {
                continue;
            }
            weighVec[mng.in[i]].first = mng.depth[i];
        }
        for (int i = 0; i < N; ++i) {
            weighVec[i].second = i;
        }
        segs[x] = lazySegtree(weighVec);

        for (int i = 0; i < N; ++i) {
            if (not mng.isCentroid[i]) {
                continue;
            }
            if (mng.size[i] == 1) {
                continue;
            }
            const int bl = mng.in[i], br = mng.out[i];
            const auto [v, p] = segs[x].fold(bl, br);
            const int l = mng.in[mng.fe[mng.revIn[p]]], r = mng.out[mng.fe[mng.revIn[p]]];
            const auto v2 = std::max(segs[x].fold(bl, l).first, segs[x].fold(r, br).first);
            diameters.insert(v + v2);
        }
    }

    i64 last = 0;
    while (Q--) {
        int d;
        i64 e;
        std::cin >> d >> e;
        i64 i = (last + d) % (N - 1);
        i64 w = (last + e) % W;
        // int i = d;
        // i64 w = e;
        int a = A[i], b = B[i];
        for (int x = 0; x < m; ++x) {
            auto &mng = managers[x];
            if ((not mng.isOn[a]) or (not mng.isOn[b])) {
                break;
            }
            if (mng.depth[a] > mng.depth[b]) {
                std::swap(a, b);
            }
            const int c = mng.cen[a];
            if (mng.size[c] == 1) {
                break;
            }
            const int bl = mng.in[c], br = mng.out[c];
            const auto [v, p] = segs[x].fold(bl, br);
            const int l = mng.in[mng.fe[mng.revIn[p]]], r = mng.out[mng.fe[mng.revIn[p]]];
            const auto v2 = std::max(segs[x].fold(bl, l).first, segs[x].fold(r, br).first);
            diameters.erase(diameters.find(v + v2));

            segs[x].apply(mng.in[b], mng.out[b], (w - C[i]));
            const auto [v3, p3] = segs[x].fold(bl, br);
            const int l2 = mng.in[mng.fe[mng.revIn[p3]]], r2 = mng.out[mng.fe[mng.revIn[p3]]];
            const auto v4 = std::max(segs[x].fold(bl, l2).first, segs[x].fold(r2, br).first);
            diameters.insert(v3 + v4);
        }
        C[i] = w;
        last = *diameters.rbegin();
        std::cout << last << std::endl;
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 50 ms 1808 KB Output is correct
20 Correct 41 ms 1796 KB Output is correct
21 Correct 48 ms 1944 KB Output is correct
22 Correct 52 ms 1968 KB Output is correct
23 Correct 69 ms 9536 KB Output is correct
24 Correct 87 ms 11244 KB Output is correct
25 Correct 101 ms 12048 KB Output is correct
26 Correct 109 ms 12288 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 212 KB Output is correct
4 Correct 46 ms 652 KB Output is correct
5 Correct 200 ms 1388 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 52 ms 732 KB Output is correct
11 Correct 245 ms 1856 KB Output is correct
12 Correct 6 ms 2644 KB Output is correct
13 Correct 9 ms 2540 KB Output is correct
14 Correct 12 ms 2684 KB Output is correct
15 Correct 62 ms 2892 KB Output is correct
16 Correct 310 ms 4020 KB Output is correct
17 Correct 102 ms 44644 KB Output is correct
18 Correct 104 ms 44700 KB Output is correct
19 Correct 113 ms 44740 KB Output is correct
20 Correct 173 ms 45044 KB Output is correct
21 Correct 411 ms 46340 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1748 KB Output is correct
2 Correct 66 ms 1848 KB Output is correct
3 Correct 334 ms 2520 KB Output is correct
4 Correct 636 ms 3220 KB Output is correct
5 Correct 45 ms 23532 KB Output is correct
6 Correct 149 ms 23880 KB Output is correct
7 Correct 585 ms 24392 KB Output is correct
8 Correct 1210 ms 25300 KB Output is correct
9 Correct 199 ms 123944 KB Output is correct
10 Correct 356 ms 124224 KB Output is correct
11 Correct 1156 ms 125024 KB Output is correct
12 Correct 1997 ms 125616 KB Output is correct
13 Correct 419 ms 263112 KB Output is correct
14 Correct 609 ms 263220 KB Output is correct
15 Correct 1473 ms 263920 KB Output is correct
16 Correct 2566 ms 264132 KB Output is correct
17 Correct 4969 ms 264232 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3739 ms 262884 KB Output is correct
2 Correct 3903 ms 262976 KB Output is correct
3 Correct 3827 ms 247636 KB Output is correct
4 Correct 4002 ms 278180 KB Output is correct
5 Correct 4059 ms 262956 KB Output is correct
6 Correct 3525 ms 261336 KB Output is correct
7 Correct 4980 ms 280384 KB Output is correct
8 Execution timed out 5019 ms 280392 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 50 ms 1808 KB Output is correct
20 Correct 41 ms 1796 KB Output is correct
21 Correct 48 ms 1944 KB Output is correct
22 Correct 52 ms 1968 KB Output is correct
23 Correct 69 ms 9536 KB Output is correct
24 Correct 87 ms 11244 KB Output is correct
25 Correct 101 ms 12048 KB Output is correct
26 Correct 109 ms 12288 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 5 ms 212 KB Output is correct
30 Correct 46 ms 652 KB Output is correct
31 Correct 200 ms 1388 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 6 ms 468 KB Output is correct
36 Correct 52 ms 732 KB Output is correct
37 Correct 245 ms 1856 KB Output is correct
38 Correct 6 ms 2644 KB Output is correct
39 Correct 9 ms 2540 KB Output is correct
40 Correct 12 ms 2684 KB Output is correct
41 Correct 62 ms 2892 KB Output is correct
42 Correct 310 ms 4020 KB Output is correct
43 Correct 102 ms 44644 KB Output is correct
44 Correct 104 ms 44700 KB Output is correct
45 Correct 113 ms 44740 KB Output is correct
46 Correct 173 ms 45044 KB Output is correct
47 Correct 411 ms 46340 KB Output is correct
48 Correct 9 ms 1748 KB Output is correct
49 Correct 66 ms 1848 KB Output is correct
50 Correct 334 ms 2520 KB Output is correct
51 Correct 636 ms 3220 KB Output is correct
52 Correct 45 ms 23532 KB Output is correct
53 Correct 149 ms 23880 KB Output is correct
54 Correct 585 ms 24392 KB Output is correct
55 Correct 1210 ms 25300 KB Output is correct
56 Correct 199 ms 123944 KB Output is correct
57 Correct 356 ms 124224 KB Output is correct
58 Correct 1156 ms 125024 KB Output is correct
59 Correct 1997 ms 125616 KB Output is correct
60 Correct 419 ms 263112 KB Output is correct
61 Correct 609 ms 263220 KB Output is correct
62 Correct 1473 ms 263920 KB Output is correct
63 Correct 2566 ms 264132 KB Output is correct
64 Correct 4969 ms 264232 KB Output is correct
65 Correct 3739 ms 262884 KB Output is correct
66 Correct 3903 ms 262976 KB Output is correct
67 Correct 3827 ms 247636 KB Output is correct
68 Correct 4002 ms 278180 KB Output is correct
69 Correct 4059 ms 262956 KB Output is correct
70 Correct 3525 ms 261336 KB Output is correct
71 Correct 4980 ms 280384 KB Output is correct
72 Execution timed out 5019 ms 280392 KB Time limit exceeded
73 Halted 0 ms 0 KB -