Submission #2819277

---

Source Code Expand

#include <iostream>

using namespace std;

int n, q;
int par[200001];
int r[200001];

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

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

void unite(int x, int y){
		int xp = find(x);
		int yp = find(y);
		if(xp == yp)return;
		if(r[xp] > r[yp]){
				par[yp] = xp;
		}else{
				par[xp] = yp;
				if(r[xp] == r[yp])r[yp]++;
		}
}

void init(){
		for(int i = 0; i < 2*n; i++){
				par[i] = i;
		}
}

int main(int argc, char const* argv[])
{
	cin >> n >> q;
	init();
	for(int i = 0; i < q; i++){
			int w, x, y, z;
			cin >> w >> x >> y >> z;
			if(w == 2){
					if(same(x-1, y-1))cout << "YES" << endl;
					else cout << "NO" << endl;
			}else{
					if(z % 2 == 0){
							unite(x-1, y-1);
							unite(x-1+n, y-1+n);
					}else{
							unite(x-1, y-1+n);
							unite(x-1+n, y-1);
					}
			}
	}
	return 0;
}

Submission Info

Judge Result