hdu1213——并查集基础题

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1213

Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.

Input

The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.

Output

For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.

Sample Input

2
5 3
1 2
2 3
4 5

5 1
2 5

Sample Output

2
4

题目翻译：

今天是HJ的生日，他邀请了许多朋友。现在是吃晚饭的时间，HJ想知道他至少需要准备多少桌。必须注意的是，并非所有的朋友都相互认识对方，有的人不愿意和陌生人坐在一桌。针对此问题的一个重要的规则是，如果我告诉你A知道B，B知道C，这意味着，A和C认识对方，这样他们就可以留在一个桌子。但是如果我告诉你，A知道B，B知道C，D知道E，那么ABC可以坐在一起，DE就得另外再坐一桌了。你的任务是请根据输入的朋友之间的关系，帮助HJ求出需要安排多少桌。

Input

T组数据（1<=T<=25）
每组数据N个人，M个关系
（1 <= N，M <= 1000）
接下来M个关系，每个关系输入u、v，表示u和v是朋友。

Output

输出至少需要多少桌安排朋友。

 

经典基础的并查集题，初始化桌子数为n，对m个关系进行判断，如果根节点不同，合并，桌子数减1。

#include <iostream>
using namespace std;
const int maxn=1e3+7;
int p[maxn];
int find(int x){
	return p[x]==x?x:p[x]=find(p[x]);
}
int main(int argc, char** argv) {
	int T,n,m;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;++i)
			p[i]=i;
		int ans=n;
		while(m--){
			int x,y,xx,yy;
			scanf("%d%d",&x,&y);
			xx=find(x);
			yy=find(y);
			if(xx!=yy){
				p[xx]=yy;
				ans--;
			} 
		}
		printf("%d\n",ans);
	}
	return 0;
}