結果

問題 No.2290 UnUnion Find
ユーザー dyktr_06dyktr_06
提出日時 2023-05-05 21:31:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 195 ms / 2,000 ms
コード長 5,525 bytes
コンパイル時間 4,466 ms
コンパイル使用メモリ 269,152 KB
実行使用メモリ 14,976 KB
最終ジャッジ日時 2024-11-23 06:09:53
合計ジャッジ時間 14,769 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 39 ms
5,248 KB
testcase_03 AC 135 ms
9,984 KB
testcase_04 AC 124 ms
9,728 KB
testcase_05 AC 116 ms
9,728 KB
testcase_06 AC 118 ms
9,984 KB
testcase_07 AC 113 ms
9,472 KB
testcase_08 AC 111 ms
9,856 KB
testcase_09 AC 115 ms
9,344 KB
testcase_10 AC 118 ms
9,600 KB
testcase_11 AC 119 ms
9,856 KB
testcase_12 AC 116 ms
9,728 KB
testcase_13 AC 112 ms
9,728 KB
testcase_14 AC 113 ms
9,600 KB
testcase_15 AC 117 ms
9,984 KB
testcase_16 AC 112 ms
9,600 KB
testcase_17 AC 116 ms
10,112 KB
testcase_18 AC 112 ms
9,984 KB
testcase_19 AC 139 ms
9,984 KB
testcase_20 AC 195 ms
14,976 KB
testcase_21 AC 45 ms
5,248 KB
testcase_22 AC 77 ms
6,144 KB
testcase_23 AC 75 ms
6,016 KB
testcase_24 AC 156 ms
11,904 KB
testcase_25 AC 63 ms
5,248 KB
testcase_26 AC 175 ms
13,312 KB
testcase_27 AC 163 ms
12,288 KB
testcase_28 AC 108 ms
8,064 KB
testcase_29 AC 150 ms
11,264 KB
testcase_30 AC 50 ms
5,248 KB
testcase_31 AC 141 ms
10,496 KB
testcase_32 AC 66 ms
5,504 KB
testcase_33 AC 101 ms
7,936 KB
testcase_34 AC 186 ms
14,976 KB
testcase_35 AC 172 ms
13,312 KB
testcase_36 AC 68 ms
5,632 KB
testcase_37 AC 87 ms
7,296 KB
testcase_38 AC 69 ms
5,632 KB
testcase_39 AC 79 ms
6,272 KB
testcase_40 AC 153 ms
12,928 KB
testcase_41 AC 63 ms
5,248 KB
testcase_42 AC 126 ms
9,600 KB
testcase_43 AC 122 ms
9,088 KB
testcase_44 AC 114 ms
9,856 KB
testcase_45 AC 125 ms
9,216 KB
testcase_46 AC 125 ms
9,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 1000000007;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct UnionFind{
    vector<int> par;
    vector<int> siz;
    vector<int> edg;

    UnionFind(int N) : par(N), siz(N), edg(N){
        for(int i = 0; i < N; ++i){
            par[i] = i;
            siz[i] = 1;
            edg[i] = 0;
        }
    }

    int root(int x){
        if(par[x] == x) return x;
        return par[x] = root(par[x]);
    }

    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if(rx == ry){
            edg[rx]++;
            return;
        }
        par[rx] = ry;
        siz[ry] += siz[rx];
        edg[ry] += edg[rx] + 1;
    }

    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    long long size(int x){
        return siz[root(x)];
    }

    long long edge(int x){
        return edg[root(x)];
    }
};

ll n, q;

void input(){
    in(n, q);
}

void solve(){
    UnionFind uf(n);
    set<ll> rt;
    rep(i, n){
        rt.insert(i);
    }
    while(q--){
        ll t; in(t);
        if(t == 1){
            ll u, v; in(u, v); u--; v--;
            rt.erase(uf.root(u));
            uf.unite(u, v);
        }else{
            ll v; in(v); v--;
            ll ans = -1;
            for(auto x : rt){
                if(!uf.same(v, x)){
                    ans = x + 1;
                    break;
                }
            }
            out(ans);
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0