Test/Library Checker/Data Structure/persistent_unionfind_rollbackuf.test.cpp.cpp

• View this file on GitHub
• Last update: 2024-01-07 20:45:12+09:00
• Problem: https://judge.yosupo.jp/problem/persistent_unionfind

Depends on

• Rollback付きUnion Find (Graph/dsu_03_rollback.hpp)

Code

#define PROBLEM "https://judge.yosupo.jp/problem/persistent_unionfind"

#include <bits/stdc++.h>

#include "Graph/dsu_03_rollback.hpp"

using namespace std;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    cin >> N >> Q;
    vector<vector<int>> tree(Q + 1);
    vector<pair<int,int>> edge(Q + 1);
    vector<int> ans(Q);
    vector<vector<tuple<int,int,int>>> query(Q + 1);
    auto g = tree.begin() + 1;
    auto e = edge.begin() + 1;
    auto q = query.begin() + 1;
    for(int i = 0; i < Q; i++){
        int t, k, u, v;
        cin >> t >> k >> u >> v;
        if(t == 0){
            g[k].emplace_back(i);
            e[i] = make_pair(u, v);
        }else{
            ans[i] |= 2;
            q[k].emplace_back(u, v, i);
        }
    }
    rollback_dsu uf(N);
    
    auto dfs = [&](auto dfs, int v) -> void {
        uf.merge(e[v].first, e[v].second);
        for(auto &&[x, y, id] : q[v]) ans[id] |= uf.same(x, y);
        for(auto &&u : g[v]) dfs(dfs, u);
        uf.undo();
    };

    dfs(dfs, -1);

    for(auto &&v : ans){
        if(~v & 2) continue;
        cout << (v & 1) << '\n';
    }
}

#line 1 "Test/Library Checker/Data Structure/persistent_unionfind_rollbackuf.test.cpp.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/persistent_unionfind"

#include <bits/stdc++.h>

#line 1 "Graph/dsu_03_rollback.hpp"
struct rollback_dsu {
    public:
    rollback_dsu() : _n(0) {}
    rollback_dsu(int n) : _n(n), num_component(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) {
            history.emplace_back(-1, -1);
            return x;
        }
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        history.emplace_back(y, parent_or_size[y]);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        num_component--;
        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);
        while(parent_or_size[a] >= 0) a = parent_or_size[a];
        return a;
    }

    int size() { 
        return num_component;
    }

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

    void undo(){
        if(history.empty()) return;
        int v, sz, par;
        std::tie(v, sz) = history.back();
        history.pop_back();
        if(v == -1) return;
        par = parent_or_size[v];
        parent_or_size[v] = sz;
        parent_or_size[par] -= sz;
        num_component++;
    }

    void rollback(int cnt = -1){
        if(cnt == -1) cnt = history.size();
        while(cnt--) undo();
    }

    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, num_component;
    std::vector<int> parent_or_size;
    std::vector<std::pair<int,int>> history;
};
#line 5 "Test/Library Checker/Data Structure/persistent_unionfind_rollbackuf.test.cpp.cpp"
using namespace std;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    cin >> N >> Q;
    vector<vector<int>> tree(Q + 1);
    vector<pair<int,int>> edge(Q + 1);
    vector<int> ans(Q);
    vector<vector<tuple<int,int,int>>> query(Q + 1);
    auto g = tree.begin() + 1;
    auto e = edge.begin() + 1;
    auto q = query.begin() + 1;
    for(int i = 0; i < Q; i++){
        int t, k, u, v;
        cin >> t >> k >> u >> v;
        if(t == 0){
            g[k].emplace_back(i);
            e[i] = make_pair(u, v);
        }else{
            ans[i] |= 2;
            q[k].emplace_back(u, v, i);
        }
    }
    rollback_dsu uf(N);
    
    auto dfs = [&](auto dfs, int v) -> void {
        uf.merge(e[v].first, e[v].second);
        for(auto &&[x, y, id] : q[v]) ans[id] |= uf.same(x, y);
        for(auto &&u : g[v]) dfs(dfs, u);
        uf.undo();
    };

    dfs(dfs, -1);

    for(auto &&v : ans){
        if(~v & 2) continue;
        cout << (v & 1) << '\n';
    }
}

Back to top page