寒假训练26号

G - 7 HDU - 1213
并查集——套模板-递归思想

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;

int father[1001];

int find(int x)   //模板（并查集）
{
	if (x != father[x])
		x = find(father[x]);  //递归
	return x;
}
int main()
{
	int t;
	scanf_s("%d", &t);
	while (t--)
	{
		int n, m;
		scanf_s("%d%d", &n, &m);
		for (int i = 1; i <= n; ++i)
		{
			father[i] = i;
		}
		for (int i = 1; i <= m; ++i)
		{
			int a, b;
			scanf_s("%d%d", &a, &b);
			int tx = find(a);
			int ty = find(b);
			if (tx != ty)
				father[ty] = tx;  //合并
		}
		int count = 0;
		for (int i = 1; i <= n; i++)
		{
			int a = find(i);
			if (a == i) ++count;
		}
		cout<<count<<endl;
	}

	return 0;
}