Submission #6905631

---

Source Code Expand

#include<iostream>
#include<map>
#include<string.h>
#include<queue>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<cstdlib>
#include<math.h>
#include<set>
using namespace std;

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; }



#define rep(n) for(int i=0;i<n;i++)
typedef pair<int, int> pii;

typedef long long ll;
typedef pair<ll, ll>pll;
const int MOD = 1000000007;
const int INF = 1 << 29;

int par[100001],n,q;

void init(int n) {
	rep(n) {
		par[i] = i;
	}
}

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

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

void unite(int x, int y) {
	x = root(x);
	y = root(y);
	if (x == y)return;
	par[x] = y;
}

int main() {
	
	cin >> n >> q;
	init(n);
	int p[200001], a[200001], b[200001];
	for(int i=0;i<q;i++) { cin >> p[i] >> a[i] >> b[i]; }
	for (int i = 0; i < q; i++) {
		
		if (p[i] == 0) {
			unite(a[i], b[i]);
		}
		if (p[i] == 1) {
			if (same(a[i],b[i]))cout << "Yes" << endl;
			else cout << "No" << endl;
		}

	}

	return 0;
}

Submission Info

Judge Result