Submission #7569997

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
 
int n,q;
int parent[100000];

int getroot(int p){
  // if(p == parent[p]) return p;
  if(parent[p] < 0) return p;
  else return parent[p] = getroot(parent[p]);
}
void unite(int a, int b){
  int x = getroot(a);
  int y = getroot(b);
  if (x > y) { swap(x, y); }
  if(x != y) parent[x] = y;
}

bool issame(int a, int b){
  return (getroot(a) == getroot(b));
}
int main(){
  cin >> n >> q;
  REP(i, 100000) parent[i] = -1;
  REP(i, q){
    int p, a, b;
    cin >> p >> a >> b;
    a--;
    b--;
    if(p == 0) unite(a, b);
    else cout << (issame(a, b) ? "Yes" : "No") << endl;
  }
}

Submission Info

Judge Result