Submit Info #2986

Problem Lang User Status Time Memory
Unionfind cpp tute7627 AC 58 ms 2.13 MiB

ケース詳細
Name Status Time Memory
example_00 AC 5 ms 0.67 MiB
random_00 AC 45 ms 1.78 MiB
random_01 AC 45 ms 1.85 MiB
random_02 AC 37 ms 1.13 MiB
random_03 AC 13 ms 1.88 MiB
random_04 AC 32 ms 0.87 MiB
random_05 AC 43 ms 1.13 MiB
random_06 AC 35 ms 2.13 MiB
random_07 AC 9 ms 1.42 MiB
random_08 AC 17 ms 0.65 MiB
random_09 AC 58 ms 1.67 MiB

#include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define test cout<<"test"<<endl; #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD = 1e9+7; //const ll MOD = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T> void chmin(T &a,T b){if(a>b)a=b;} template<typename T> void chmax(T &a,T b){if(a<b)a=b;} void pmod(ll &a,ll b){a=(a+b)%MOD;} void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;} void qmod(ll &a,ll b){a=(a*b)%MOD;} void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2> void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++) {for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0]; for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T> vector<vector<T>>vec(ll x, ll y, T w){ vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,0,-1,0,1,1,-1,-1}; vector<ll>dy={0,1,0,-1,1,-1,1,-1}; template<typename T> vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts> auto make_v(size_t a,Ts... ts){ return vector<decltype(make_v(ts...))>(a,make_v(ts...)); } ostream &operator<<(ostream &os, pair<ll, ll>&p){ return os << p.first << " " << p.second; } struct UnionFind { vector<ll> data; ll num; UnionFind(ll size) : data(size, -1) ,num(size){ } bool unite(ll x, ll y) { x = root(x); y = root(y); if (x != y) { //if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; num--; } return x != y; } bool find(ll x, ll y) { return root(x) == root(y); } ll root(ll x) { return data[x] < 0 ? x : data[x] = root(data[x]); } ll size(ll x) { return -data[root(x)]; } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,q;cin>>n>>q; UnionFind uf(n); while(q--){ ll t,u,v;cin>>t>>u>>v; if(t==0)uf.unite(u,v); else cout<<uf.find(u,v)<<endl; } return 0; }