結果

問題 No.2290 UnUnion Find
ユーザー nok0
提出日時 2023-05-05 21:36:16
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 451 ms / 2,000 ms
コード長 21,468 bytes
コンパイル時間 2,298 ms
コンパイル使用メモリ 224,856 KB
最終ジャッジ日時 2025-02-12 17:42:30
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 46
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/nok0/documents/programming/library/template/input.hpp: In function ‘void scanner::scan(char*)’:
/home/nok0/documents/programming/library/template/input.hpp:29:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]

ソースコード

diff #
プレゼンテーションモードにする

#line 1 "/home/nok0/documents/programming/library/atcoder/dsu.hpp"
#include <algorithm>
#include <cassert>
#include <vector>
namespace atcoder {
// Implement (union by size) + (path compression)
// Reference:
// Zvi Galil and Giuseppe F. Italiano,
// Data structures and algorithms for disjoint set union problems
struct dsu {
  public:
    dsu() : _n(0) {}
    explicit dsu(int n) : _n(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);
        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;
};
}  // namespace atcoder
#line 2 "/home/nok0/documents/programming/library/template/header.hpp"
#include <bits/stdc++.h>
#line 3 "/home/nok0/documents/programming/library/data_structure/range_set.hpp"
template <class T>
struct range_set {
   private:
    const T TINF = std::numeric_limits<T>::max() / 2;
    T sum;
    std::set<std::pair<T, T>> st;
   public:
    range_set() : sum(0) {
        st.emplace(-TINF, -TINF);
        st.emplace(TINF, TINF);
    }
    //[l, r) is covered?
    bool covered(const T l, const T r) {
        assert(l <= r);
        if(l == r) return true;
        auto itr = prev(st.upper_bound({l, TINF}));
        return itr->first <= l and r <= itr->second;
    }
    //[x, x + 1) is covered?
    bool covered(const T x) { return covered(x, x + 1); }
    // return section which covers[l, r)
    // if not exists, return[-TINF, -TINF)
    std::pair<T, T> covered_by(const T l, const T r) {
        assert(l <= r);
        if(l == r) return {-TINF, -TINF};
        auto itr = prev(st.upper_bound({l, TINF}));
        if(itr->first <= l and r <= itr->second) return *itr;
        return {-TINF, -TINF};
    }
    // return section which covers[x, x + 1)
    // if not exists, return[-TINF, -TINF)
    std::pair<T, T> covered_by(const T x) { return covered_by(x, x + 1); }
    // insert[l, r), and return increment
    T insert(T l, T r) {
        assert(l <= r);
        if(l == r) return T(0);
        auto itr = prev(st.upper_bound({l, TINF}));
        if(itr->first <= l and r <= itr->second) return T(0);
        T sum_erased = T(0);
        if(itr->first <= l and l <= itr->second) {
            l = itr->first;
            sum_erased += itr->second - itr->first;
            itr = st.erase(itr);
        } else
            itr = next(itr);
        while(r > itr->second) {
            sum_erased += itr->second - itr->first;
            itr = st.erase(itr);
        }
        if(itr->first <= r) {
            sum_erased += itr->second - itr->first;
            r = itr->second;
            st.erase(itr);
        }
        st.emplace(l, r);
        sum += r - l - sum_erased;
        return r - l - sum_erased;
    }
    // insert[x, x + 1), and return increment
    T insert(const T x) { return insert(x, x + 1); }
    // erase [l, r), and return decrement
    T erase(const T l, const T r) {
        assert(l <= r);
        if(l == r) return T(0);
        auto itr = prev(st.upper_bound({l, TINF}));
        if(itr->first <= l and r <= itr->second) {
            if(itr->first < l) st.emplace(itr->first, l);
            if(r < itr->second) st.emplace(r, itr->second);
            st.erase(itr);
            sum -= r - l;
            return r - l;
        }
        T ret = T(0);
        if(itr->first <= l and l < itr->second) {
            ret += itr->second - l;
            if(itr->first < l) st.emplace(itr->first, l);
            itr = st.erase(itr);
        } else
            itr = next(itr);
        while(itr->second <= r) {
            ret += itr->second - itr->first;
            itr = st.erase(itr);
        }
        if(itr->first < r) {
            ret += r - itr->first;
            st.emplace(r, itr->second);
            st.erase(itr);
        }
        sum -= ret;
        return ret;
    }
    // erase [x, x + 1), and return decrement
    T erase(const T x) { return erase(x, x + 1); }
    int size() const { return (int)st.size() - 2; }
    T mex(const T x = 0) const {
        auto itr = prev(st.upper_bound({x, TINF}));
        if(itr->first <= x and x < itr->second)
            return itr->second;
        else
            return x;
    }
    T sum_all() const { return sum; }
    std::set<std::pair<T, T>> get() const {
        std::set<std::pair<T, T>> res;
        for(auto &p : st) {
            if(std::abs(p.first) == TINF) continue;
            res.emplace(p.first, p.second);
        }
        return res;
    }
    void dump() const {
        std::cout << "range_set:";
        for(auto &p : st) {
            if(std::abs(p.first) == TINF) continue;
            std::cout << "[" << p.first << "," << p.second << "),";
        }
        std::cout << '\n';
    }
};
#line 3 "/home/nok0/documents/programming/library/template/def_const.hpp"
const int inf = 1000000000;
const long long INF = 1000000000000000000ll;
#line 4 "/home/nok0/documents/programming/library/template/debug.hpp"
namespace viewer {
void view(const long long &e) {
    if(e == INF)
        std::cerr << "INF";
    else if(e == -INF)
        std::cerr << "-INF";
    else
        std::cerr << e;
}
void view(const int &e) {
    if(e == inf)
        std::cerr << "inf";
    else if(e == -inf)
        std::cerr << "-inf";
    else
        std::cerr << e;
}
template <typename T>
void view(const T &e) {
    std::cerr << e;
}
template <typename T, typename U>
void view(const std::pair<T, U> &p) {
    std::cerr << "(";
    view(p.first);
    std::cerr << ", ";
    view(p.second);
    std::cerr << ")";
}
template <class T0, class T1, class T2>
void view(const std::tuple<T0, T1, T2> &p) {
    std::cerr << "(";
    view(std::get<0>(p));
    std::cerr << ", ";
    view(std::get<1>(p));
    std::cerr << ", ";
    view(std::get<2>(p));
    std::cerr << ")";
}
template <class T0, class T1, class T2, class T3>
void view(const std::tuple<T0, T1, T2, T3> &p) {
    std::cerr << "(";
    view(std::get<0>(p));
    std::cerr << ", ";
    view(std::get<1>(p));
    std::cerr << ", ";
    view(std::get<2>(p));
    std::cerr << ", ";
    view(std::get<3>(p));
    std::cerr << ")";
}
template <typename T>
void view(const std::set<T> &s) {
    if(s.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << "{ ";
    for(auto &t : s) {
        view(t);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
template <typename T>
void view(const std::unordered_set<T> &s) {
    if(s.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << "{ ";
    for(auto &t : s) {
        view(t);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
template <typename T>
void view(const std::multiset<T> &s) {
    if(s.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << "{ ";
    for(auto &t : s) {
        view(t);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
template <typename T>
void view(const std::unordered_multiset<T> &s) {
    if(s.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << "{ ";
    for(auto &t : s) {
        view(t);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
template <typename T>
void view(const std::vector<T> &v) {
    if(v.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << "{ ";
    for(const auto &e : v) {
        view(e);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
template <typename T, std::size_t ary_size>
void view(const std::array<T, ary_size> &v) {
    if(v.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << "{ ";
    for(const auto &e : v) {
        view(e);
        std::cerr << ", ";
    }
    std::cerr << "\b\b }";
}
template <typename T>
void view(const std::vector<std::vector<T>> &vv) {
    std::cerr << "{\n";
    for(const auto &v : vv) {
        std::cerr << "\t";
        view(v);
        std::cerr << '\n';
    }
    std::cerr << "}";
}
template <typename T, typename U>
void view(const std::vector<std::pair<T, U>> &v) {
    std::cerr << "{\n";
    for(const auto &c : v) {
        std::cerr << "\t(";
        view(c.first);
        std::cerr << ", ";
        view(c.second);
        std::cerr << ")\n";
    }
    std::cerr << "}";
}
template <class T0, class T1, class T2>
void view(const std::vector<std::tuple<T0, T1, T2>> &v) {
    if(v.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << '{';
    for(const auto &t : v) {
        std::cerr << "\n\t";
        view(t);
        std::cerr << ",";
    }
    std::cerr << "\n}";
}
template <class T0, class T1, class T2, class T3>
void view(const std::vector<std::tuple<T0, T1, T2, T3>> &v) {
    if(v.empty()) {
        std::cerr << "{ }";
        return;
    }
    std::cerr << '{';
    for(const auto &t : v) {
        std::cerr << "\n\t";
        view(t);
        std::cerr << ",";
    }
    std::cerr << "\n}";
}
template <typename T, typename U>
void view(const std::map<T, U> &m) {
    std::cerr << "{\n";
    for(const auto &t : m) {
        std::cerr << "\t[";
        view(t.first);
        std::cerr << "] : ";
        view(t.second);
        std::cerr << '\n';
    }
    std::cerr << "}";
}
template <typename T, typename U>
void view(const std::unordered_map<T, U> &m) {
    std::cerr << "{\n";
    for(const auto &t : m) {
        std::cerr << "\t[";
        view(t.first);
        std::cerr << "] : ";
        view(t.second);
        std::cerr << '\n';
    }
    std::cerr << "}";
}
}  // namespace viewer
// when compiling : g++ foo.cpp -DLOCAL
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    viewer::view(H);
    std::cerr << ", ";
    debug_out(T...);
}
#define debug(...)                                                \
    do {                                                          \
        std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
        debug_out(__VA_ARGS__);                                   \
        std::cerr << "\b\b]\n";                                   \
    } while(0)
#define dump(x)                                      \
    do {                                             \
        std::cerr << __LINE__ << " " << #x << " : "; \
        viewer::view(x);                             \
        std::cerr << '\n';                           \
    } while(0)
#else
#define debug(...) (void(0))
#define dump(x)    (void(0))
#endif
#line 3 "/home/nok0/documents/programming/library/template/def_name.hpp"
#define pb        push_back
#define eb        emplace_back
#define fi        first
#define se        second
#define SZ(x)     ((int)(x).size())
#define all(x)    (x).begin(), (x).end()
#define rall(x)   (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int>
using V = std::vector<T>;
template <class T = int>
using VV = std::vector<std::vector<T>>;
template <class T>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
#line 3 "/home/nok0/documents/programming/library/template/fast_io.hpp"
struct fast_io {
    fast_io() {
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        std::cout << std::fixed << std::setprecision(15);
    }
} fast_io_;
#line 3 "/home/nok0/documents/programming/library/template/input.hpp"
template<class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}
template<class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
    for (T &i : v) is >> i;
    return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
    std::string s;
    is >> s;
    __int128_t ret = 0;
    for (int i = 0; i < (int)s.length(); i++)
        if ('0' <= s[i] and s[i] <= '9')
            ret = 10 * ret + s[i] - '0';
    a = ret * (s[0] == '-' ? -1 : 1);
    return is;
}
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template<class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template<class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template<class Head, class... Tail>
void INPUT(Head &head, Tail &...tail) {
    scan(head);
    INPUT(tail...);
}
}  // namespace scanner
#define VEC(type, name, size)     \
    std::vector<type> name(size); \
    scanner::INPUT(name)
#define VVEC(type, name, h, w)                                    \
    std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
    scanner::INPUT(name)
#define INT(...)     \
    int __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define LL(...)            \
    long long __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define STR(...)             \
    std::string __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define CHAR(...)     \
    char __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
    double __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#define LD(...)              \
    long double __VA_ARGS__; \
    scanner::INPUT(__VA_ARGS__)
#line 3 "/home/nok0/documents/programming/library/template/math.hpp"
template <class T, class U>
inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T>
T divup(T x, T y) { return (x + y - 1) / y; }
template <class T>
T POW(T a, long long n) {
    T ret = 1;
    while(n) {
        if(n & 1) ret *= a;
        a *= a;
        n >>= 1;
    }
    return ret;
}
long long POW(long long a, long long n, const int mod) {
    long long ret = 1;
    a = (a % mod + mod) % mod;
    while(n) {
        if(n & 1) (ret *= a) %= mod;
        (a *= a) %= mod;
        n >>= 1;
    }
    return ret;
}
template <class T, class F>
T bin_search(T ok, T ng, const F &f) {
    while(abs(ok - ng) > 1) {
        T mid = (ok + ng) >> 1;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T, class F>
T bin_search(T ok, T ng, const F &f, int loop) {
    for(int i = 0; i < loop; i++) {
        T mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
#line 3 "/home/nok0/documents/programming/library/template/output.hpp"
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
    for(int i = 0; i < int(a.size()); ++i) {
        if(i) os << " ";
        os << a[i];
    }
    return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
    std::ostream::sentry s(dest);
    if(s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while(tmp != 0);
        if(value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if(dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
    std::cout << H << ' ';
    print(T...);
}
template <class T>
void println(const T a) { std::cout << a << '\n'; }
template <class T>
void println(const std::vector<T> &a) {
    for(const auto &v : a)
        std::cout << v << '\n';
}
template <class Head, class... Tail>
void println(Head H, Tail... T) {
    std::cout << H << '\n';
    println(T...);
}
void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }
void No() { std::cout << "No\n"; }
void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }
void NO() { std::cout << "NO\n"; }
#line 2 "/home/nok0/documents/programming/library/template/rep.hpp"
#define foa(v, a)                   for (auto &v : a)
#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))
#define repsname(a, b, c, ...) c
#define reps(...)              repsname(__VA_ARGS__, reps1, reps0)(__VA_ARGS__)
#define reps0(x)               for (int reps_counter = 1; reps_counter <= (x); ++reps_counter)
#define reps1(i, x)            for (int i = 1; i <= (x); ++i)
#define rrepname(a, b, c, ...) c
#define rrep(...)              rrepname(__VA_ARGS__, rrep1, rrep0)(__VA_ARGS__)
#define rrep0(x)               for (int rrep_counter = (x)-1; rrep_counter >= 0; --rrep_counter)
#define rrep1(i, x)            for (int i = (x)-1; i >= 0; --i)
#line 3 "/home/nok0/documents/programming/library/template/string_converter.hpp"
struct string_converter {
    char start = 0;
    char type(const char &c) const { return (islower(c) ? 'a' : isupper(c) ? 'A' :
                                                            isdigit(c)     ? '0' :
                                                                             0); }
    int convert(const char &c) {
        if(!start) start = type(c);
        return c - start;
    }
    int convert(const char &c, const std::string &chars) { return chars.find(c); }
    template <typename T>
    auto convert(const T &v) {
        std::vector<decltype(convert(v[0]))> ret;
        ret.reserve(size(v));
        for(auto &&e : v) ret.emplace_back(convert(e));
        return ret;
    }
    template <typename T>
    auto convert(const T &v, const std::string &chars) {
        std::vector<decltype(convert(v[0], chars))> ret;
        ret.reserve(size(v));
        for(auto &&e : v) ret.emplace_back(convert(e, chars));
        return ret;
    }
    int operator()(const char &v, char s = 0) {
        start = s;
        return convert(v);
    }
    int operator()(const char &v, const std::string &chars) { return convert(v, chars); }
    template <typename T>
    auto operator()(const T &v, char s = 0) {
        start = s;
        return convert(v);
    }
    template <typename T>
    auto operator()(const T &v, const std::string &chars) { return convert(v, chars); }
} toint;
#line 3 "/home/nok0/documents/programming/library/template/vector.hpp"
template <class T>
int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }
template <class T>
int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }
template <class T>
void UNIQUE(std::vector<T> &a) {
    std::sort(a.begin(), a.end());
    a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<T> press(std::vector<T> &a) {
    auto res = a;
    UNIQUE(res);
    for(auto &v : a)
        v = lb(res, v);
    return res;
}
#define SORTname(a, b, c, ...) c
#define SORT(...)              SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)
#define SORT0(a)               std::sort((a).begin(), (a).end())
#define SORT1(a, c)            std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })
template <class T>
void ADD(std::vector<T> &a, const T x = 1) {
    for(auto &v : a) v += x;
}
template <class T>
void SUB(std::vector<T> &a, const T x = 1) {
    for(auto &v : a) v -= x;
}
template <class T>
struct cum_vector {
   public:
    cum_vector() = default;
    template <class U>
    cum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {
        for(int i = 0; i < (int)vec.size(); i++)
            cum[i + 1] = cum[i] + vec[i];
    }
    T prod(int l, int r) {
        return cum[r] - cum[l];
    }
   private:
    std::vector<T> cum;
};
std::vector<std::pair<char, int>> rle(const std::string &s) {
    const int n = s.size();
    std::vector<std::pair<char, int>> ret;
    ret.reserve(n);
    for(int l = 0; l < n;) {
        int r = l + 1;
        for(; r < n and s[l] == s[r]; r++) {}
        ret.emplace_back(s[l], r - l);
        l = r;
    }
    return ret;
}
template <class T>
std::vector<std::pair<T, int>> rle(const std::vector<T> &v) {
    const int n = v.size();
    std::vector<std::pair<T, int>> ret;
    ret.reserve(n);
    for(int l = 0; l < n;) {
        int r = l + 1;
        for(; r < n and v[l] == v[r]; r++) {}
        ret.emplace_back(v[l], r - l);
        l = r;
    }
    return ret;
}
std::vector<int> iota(int n) {
    std::vector<int> p(n);
    std::iota(p.begin(), p.end(), 0);
    return p;
}
#line 12 "/home/nok0/documents/programming/library/template/all"
using namespace std;
#line 4 "c.cpp"
void main_();
int main() {
    int t = 1;
    while(t--) main_();
}
void main_() {
    INT(n, q);
    atcoder::dsu uf(n);
    vector<range_set<int>> sts(n);
    rep(i, n) sts[i].insert(i);
    map<int, int> idd;
    rep(i, n) idd[i] = i;
    while(q--) {
        INT(t);
        if(t == 1) {
            INT(u, v);
            --u, --v;
            u = idd[uf.leader(u)];
            v = idd[uf.leader(v)];
            if(u != v) {
                int x = sts[u].size();
                int y = sts[v].size();
                if(x < y) swap(x, y), swap(u, v);
                for(auto inter : sts[v].get()) {
                    sts[u].insert(inter.fi, inter.se);
                }
                uf.merge(u, v);
                int l = uf.leader(l);
                idd[l] - u;
            }
        } else {
            INT(u);
            --u;
            if(uf.size(u) == n) {
                print(-1);
            } else {
                u = uf.leader(u);
                print(sts[u].mex() + 1);
            }
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0