結果

問題 No.2290 UnUnion Find
ユーザー sten_san
提出日時 2023-05-05 21:27:33
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 3,532 bytes
コンパイル時間 2,278 ms
コンパイル使用メモリ 204,400 KB
最終ジャッジ日時 2025-02-12 17:33:25
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/dsu>

int main() {
    int n, q; cin >> n >> q;

    set<int> rem;
    for (int i = 0; i < n; ++i) {
        rem.insert(i);
    }

    atcoder::dsu dsu(n);

    auto merge = [&](int u, int v) {
        if (dsu.same(u, v)) {
            return;
        }

        u = dsu.leader(u);
        v = dsu.leader(v);

        int x = dsu.merge(u, v);

        if (u != x) {
            rem.erase(u);
        }
        if (v != x) {
            rem.erase(v);
        }
    };

    while (q--) {
        int t; cin >> t;

        if (t == 1) {
            int u, v; cin >> u >> v; --u; --v;

            merge(u, v);
        }

        if (t == 2) {
            int u; cin >> u; --u;

            u = dsu.leader(u);

            auto iter = begin(rem);
            while (iter != end(rem) && *iter == u) {
                ++iter;
            }

            if (iter != end(rem)) {
                cout << *iter + 1 << '\n';
            }
            else {
                cout << -1 << '\n';
            }
        }
    }

    cout << flush;
}
0