acwing837连通块中点的数量

//本次思路即为合并集合的稍微变形
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
const int N = 100010;
int n, m;
int p[N];
int siz[N];
int find(int x)//合并集合并且压缩路径
{
	if (p[x] != x) p[x] = find(p[x]);
	return p[x];
}
int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		p[i] = i;
		siz[i] = 1;
	}
	while (m--)
	{
		char op[2];
		int a, b;
		scanf("%s", op);
		if (op[0] == 'C')
		{
			scanf("%d%d", &a, &b);
			if (find(a) == find(b)) continue;//当ab已经为同一根节点是，跳出本次循环继续下次循环
			siz[find(b)] += siz[find(a)];//尺度合并
			p[find(a)] = find(b);//合并两个集合
		}
		else if (op[1] == '1')
		{
			scanf("%d%d", &a, &b);
			if (find(a) == find(b)) printf("Yes\n");
			else printf("No\n");
		}
		else
		{
			scanf("%d", &a);
			printf("%d", siz[find(a)]);
		}
	}
	return 0;
}