杭电1213（并查集+让认识的人一桌）

How Many Tables（难度：1）

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)

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

思路：

题意：1认识2，2认识3，4认识5，则123一张桌，45一张桌，问一共需要多少张桌。

方法：简单的并查集，直接套模板。

AC代码：

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

int tree[30];//并查集 
int vis[30];

int findroot(int x)//查找函数 
{
    if(tree[x]==x) return x;
    else
    {
        int tmp=findroot(tree[x]);
        tree[x]=tmp;
        return tmp;
    } 
}

void join(int x,int y)//合并函数 
{
    int fx=findroot(x);
    int fy=findroot(y);
    if(fx!=fy) tree[fy]=fx;
}

int main()
{
    int t,n,m,a,b;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(int i=1;i<=n;i++)
        {
            tree[i]=i;
        }
        while(m--)
        {
            cin>>a>>b;
            join(a,b);
        }
        //ans判断图是否连通
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            if(tree[i]==i) ans++;
        }
        cout<<ans<<endl;
    }
    return 0;
}