Submission #7133543

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using Int = unsigned long long;
typedef pair<int,int> P;
typedef priority_queue<int> Pr;
int const MOD = 1000000007;
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; }

struct UnionFind {
  vector< int > data;
 
  UnionFind(int sz) {
    data.assign(sz, -1);
  }
 
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return (false);
    if(data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return (true);
  }
 
  int find(int k) {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }
 
  int size(int k) {
    return (-data[find(k)]);
  }
};

int main(){
    cin.tie(0); ios::sync_with_stdio(false);

    int n,q; cin>>n>>q;
    UnionFind u(n+1);
    for (int i = 0; i < q; i++){
        int p,a,b; cin>>p>>a>>b;
        if(p)cout<<(u.find(a)==u.find(b)?"Yes":"No")<<'\n';
        else u.unite(a,b);
    }
}

Submission Info

Judge Result