P3367 【模板】并查集

【模板】并查集 - 洛谷

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int n, m;
int pre[MAXN];
int rnk[MAXN];

void init(int n) {
	for (int i = 1; i <= n; i++) {
		pre[i] = i;
	}
	return ;
}

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

void unite(int x, int y) {
	x = find(x);
	y = find(y);
	if (rnk[x] < rnk[y]) {
		pre[x] = y;
	} else {
		pre[y] = x;
		if (rnk[x] == rnk[y]) {
			rnk[x]++;
		}
	}
	return ;
}

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

int main() {
	scanf("%d %d", &n, &m);
	init(n);
	int t, x, y;
	while (m--) {
		scanf("%d %d %d", &t, &x, &y);
		if (t == 1) {
			unite(x, y);
		} else if (t == 2) {
			if (same(x, y)) {
				printf("Y\n");
			} else {
				printf("N\n");
			}
		}
	}
	return 0;
}