結果

問題 No.2296 Union Path Query (Hard)
ユーザー t98slidert98slider
提出日時 2023-03-20 20:19:32
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 576 ms / 7,000 ms
コード長 7,413 bytes
コンパイル時間 2,897 ms
コンパイル使用メモリ 208,520 KB
実行使用メモリ 42,296 KB
最終ジャッジ日時 2024-11-23 04:49:56
合計ジャッジ時間 20,822 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 23 ms
21,072 KB
testcase_02 AC 22 ms
21,200 KB
testcase_03 AC 21 ms
21,072 KB
testcase_04 AC 218 ms
42,296 KB
testcase_05 AC 207 ms
42,296 KB
testcase_06 AC 291 ms
42,296 KB
testcase_07 AC 340 ms
42,296 KB
testcase_08 AC 318 ms
42,296 KB
testcase_09 AC 299 ms
35,584 KB
testcase_10 AC 355 ms
35,584 KB
testcase_11 AC 330 ms
35,584 KB
testcase_12 AC 338 ms
34,304 KB
testcase_13 AC 197 ms
27,392 KB
testcase_14 AC 177 ms
27,008 KB
testcase_15 AC 341 ms
42,292 KB
testcase_16 AC 344 ms
38,272 KB
testcase_17 AC 284 ms
30,592 KB
testcase_18 AC 558 ms
42,296 KB
testcase_19 AC 509 ms
34,432 KB
testcase_20 AC 531 ms
42,168 KB
testcase_21 AC 565 ms
42,296 KB
testcase_22 AC 576 ms
42,240 KB
testcase_23 AC 268 ms
42,240 KB
testcase_24 AC 260 ms
34,432 KB
testcase_25 AC 230 ms
42,296 KB
testcase_26 AC 226 ms
42,292 KB
testcase_27 AC 299 ms
42,296 KB
testcase_28 AC 308 ms
42,296 KB
testcase_29 AC 252 ms
42,292 KB
testcase_30 AC 254 ms
42,296 KB
testcase_31 AC 257 ms
42,292 KB
testcase_32 AC 288 ms
42,292 KB
testcase_33 AC 350 ms
42,296 KB
testcase_34 AC 209 ms
42,296 KB
testcase_35 AC 244 ms
42,240 KB
testcase_36 AC 466 ms
42,240 KB
testcase_37 AC 312 ms
36,736 KB
testcase_38 AC 309 ms
36,864 KB
testcase_39 AC 301 ms
36,736 KB
testcase_40 AC 302 ms
36,864 KB
testcase_41 AC 2 ms
5,248 KB
testcase_42 AC 2 ms
5,248 KB
testcase_43 AC 2 ms
5,248 KB
testcase_44 AC 318 ms
42,168 KB
testcase_45 AC 337 ms
42,164 KB
testcase_46 AC 348 ms
42,296 KB
testcase_47 AC 373 ms
42,292 KB
testcase_48 AC 345 ms
42,296 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template <class S, S (*op)(S, S), S (*e)()> class LinkCutTree {
    struct Node {
        Node *l, *r, *p;
        S key, sum;
        bool rev;
        int sz;

        explicit Node(const S &v) : key(v), sum(v), sz(1), rev(false),
                                    l(nullptr), r(nullptr), p(nullptr) {}

        bool is_root() const { return not p or (p->l != this and p->r != this); }
    };

    void update(Node* t) {
        t->sz = 1;
        t->sum = t->key;
        if(t->l) t->sz += t->l->sz, t->sum = op(t->l->sum, t->sum);
        if(t->r) t->sz += t->r->sz, t->sum = op(t->sum, t->r->sum);
    }

    void rotate_right(Node* t) {
        Node *x = t->p, *y = x->p;
        if((x->l = t->r)) t->r->p = x;
        t->r = x, x->p = t;
        update(x), update(t);
        if((t->p = y)) {
            if(y->l == x) y->l = t;
            if(y->r == x) y->r = t;
            update(y);
        }
    }

    void rotate_left(Node* t) {
        Node *x = t->p, *y = x->p;
        if((x->r = t->l)) t->l->p = x;
        t->l = x, x->p = t;
        update(x), update(t);
        if((t->p = y)) {
            if(y->l == x) y->l = t;
            if(y->r == x) y->r = t;
            update(y);
        }
    }

    void toggle(Node* t) {
        std::swap(t->l, t->r);
        //t->sum = s(t->sum);
        t->rev ^= true;
    }

    void push(Node* t) {
        if(t->rev) {
            if(t->l) toggle(t->l);
            if(t->r) toggle(t->r);
            t->rev = false;
        }
    }

    void splay(Node *t) {
        push(t);
        while(not t->is_root()) {
            Node* q = t->p;
            if(q->is_root()) {
                push(q), push(t);
                q->l == t ? rotate_right(t) : rotate_left(t);
            } else {
                Node* r = q->p;
                push(r), push(q), push(t);
                if(r->l == q) {
                if(q->l == t) rotate_right(q), rotate_right(t);
                else rotate_left(t), rotate_right(t);
                } else {
                if(q->r == t) rotate_left(q), rotate_left(t);
                else rotate_right(t), rotate_left(t);
                }
            }
        }
    }

    std::vector<Node*> Node_info;

    public:
    int N;
    LinkCutTree(int n) : LinkCutTree(std::vector<S>(n, e())) {}
    LinkCutTree(const std::vector<S> &vec) : N(vec.size()), Node_info(vec.size()){
        for(int i = 0; i < N; i++) {
            Node_info[i] = new Node(vec[i]);
        }
    }

    //vと根との間を Heavy-edge で繋げてvを木の根にする
    Node* expose(int v) {
        Node* t = Node_info[v];
        Node* rp = nullptr;
        for(Node* cur = t; cur; cur = cur->p) {
            splay(cur);
            cur->r = rp;
            update(cur);
            rp = cur;
        }
        splay(t);
        return rp;
    }

    //vをもともの木の根にする
    void evert(int v) {
        expose(v);
        toggle(Node_info[v]);
        push(Node_info[v]);
    }

    void link(int _child, int _parent) {
        evert(_child);
        Node *child = Node_info[_child], *parent = Node_info[_parent];
        if(is_connected(_child, _parent)) {
            throw runtime_error("child and parent must be different connected components");
        }
        child->p = parent;
        parent->r = child;
        update(parent);
    }

    void cut(int _child) {
        Node *child = Node_info[_child];
        expose(_child);
        auto *parent = child->l;
        child->l = nullptr;
        parent->p = nullptr;
    }

    Node *lca(int u, int v) {
        expose(u);
        return expose(v);
    }

    bool is_connected(int u, int v) {
        expose(u), expose(v);
        return Node_info[u] == Node_info[v] or Node_info[u]->p;
    }

    const S &query(int u, int v) {
        evert(u);
        expose(v);
        return Node_info[v]->sum;
    }

    void set(int p, S v) {
        expose(p);
        Node_info[p]->key = v;
        update(Node_info[p]);
    }
};

ll op(ll lhs, ll rhs){return lhs + rhs;}
ll e(){return 0;}

struct dsu {
    public:
    int csz;
    dsu() : _n(0) {}
    dsu(int n) : _n(n), csz(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        csz--;
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    ll X;
    cin >> N >> X >> Q;
    LinkCutTree<ll, op, e> LCT(N + Q);

    dsu uf(N);
    vector<ll> dia(N);
    vector<array<int,2>> sv(N);
    for(int i = 0; i < N; i++) sv[i] = {i, i};

    auto update_diameter = [&](int x, int y){
        ll mx;
        int u, v;
        if(dia[x] >= dia[y]){
            mx = dia[x], u = sv[x][0], v = sv[x][1];
        }else{
            mx = dia[y], u = sv[y][0], v = sv[y][1];
        }
        for(int i = 0; i < 2; i++){
            for(int j = 0; j < 2; j++){
                ll d = LCT.query(sv[x][i], sv[y][j]);
                if(d > mx){
                    mx = d, u = sv[x][i], v = sv[y][j];
                }
            }
        }
        int r = uf.merge(x, y);
        dia[r] = mx;
        sv[r] = {u, v};
    };

    int type, v, u, w;
    for(int i = 0; i < Q; i++){
        cin >> type;
        if(type == 1){
            cin >> v >> w;
            LCT.link(v, i + N);
            LCT.link(X, i + N);
            LCT.set(i + N, w);
            update_diameter(uf.leader(v), uf.leader(X));
        }else if(type == 2){
            cin >> v >> u;
            if(!uf.same(v, u)){
                cout << -1 << '\n';
                continue;
            }
            ll d = LCT.query(v, u);
            (X += d) %= N;
            cout << d << '\n';
        }else if(type == 3){
            cin >> v;
            cout << dia[uf.leader(v)] << '\n';
        }else{
            cin >> v;
            X += v;
            if(X >= N) X -= N;
        }
    }
}
0