hdoj 1213 How Many Tables【并查集】

How Many Tables

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19015    Accepted Submission(s): 9431

Problem Description

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
  
  

 

题目大意：有个家伙过生日，请了盆友，不是所有盆友都互相认识，认识的坐在一张桌子上；

第一行输入一个数，表示测试次数，每个新用例，第一行是两个整数n和m，n表示盆友个数，接下来m行，每行两个数a  b，表示a  b互相认识；

求这个家伙至少要准备多少桌子？

 

#include<stdio.h>
int a[1005];
int find(int x){
    int r=x;
    while(r!=a[r])
        r=a[r];
    return r;
}
void join(int x,int y){
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy)				//判断二人是否认识； 
        a[fx]=fy;
}
int main(){
    int t,n,m,i,j,x,y,ans;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)
            a[i]=i;
        for(i=0;i<m;i++){
            scanf("%d%d",&x,&y);
            join(x,y);
        }
        ans=0;
        for(i=1;i<=n;i++){			//统计要用的桌子数 
            if(a[i]==i)
                ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}