Submission #9947815

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;

int N, Q, a, b, c;
int vec[100004];
int bridge(int x) {
	if (vec[x]==x) {
		return x;
	}
	return vec[x]=bridge(vec[x]);
}
int main() {
	cin >> N >> Q;
	rep(i,N){
		vec[i]=i;
	}
	for (int i = 0; i < Q; i++) {

		cin >> a >> b >> c;
		if (a == 0) {
			vec[max(b, c)] = min(b, c);
		}
		if (a == 1) {
			if (bridge(b) == bridge(c)) {
				cout << "Yes" << endl;
			}
			else {
				cout << "No" << endl;
			}
		}
	}
}

Submission Info

Judge Result