C

How Many Tables

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

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

 

Author

Ignatius.L

 

Source

杭电ACM省赛集训队选拔赛之热身赛

 

Recommend

Eddy

 

Statistic | Submit | Discuss | Note

题意

　　　　若干人聚餐吃饭准备桌子，认识的可以坐一桌，认识不需要互相认识，只要有A -> B, B -> C, 就有A -> C。

思路

　　　　认识的人并在一起，之后O(n)跑一遍，同一个并查集的人放在一个桌子上，如果桌子上有人则ans++

CODE

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <assert.h>
#include <vector>

#define dbg(x) cout << #x << "=" << x << endl

using namespace std;
typedef long long LL;
const int maxn = 1007;

int fa[maxn];
int n,m,ans,cnt;
int a[maxn];
int tot[maxn];
//vector <int> v;

void init()
{
    for(int i = 1; i <= n; i++) {
        fa[i] = i;
    }
}

int fid(int x)
{
    int r = x;
    while(fa[r] != r) {
        r = fa[r];
    }
    int i,j;///路径压缩
    i = x;
    while(fa[i] != r) {
        j = fa[i];
        fa[i] =  r;
        i = j;
    }
    return r;
}

void join(int r1, int r2)///合并
{
    int fidroot1 = fid(r1), fidroot2 = fid(r2);
    //int root = min(fidroot1, fidroot2);
    if(fidroot1 != fidroot2) {
        fa[fidroot2] = fidroot1;
        //fa[fidroot2] = root;
    }
}

template<class T>inline void read(T &res)
{
    char c;T flag=1;
    while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
    while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}

namespace _buff {
    const size_t BUFF = 1 << 19;
    char ibuf[BUFF], *ib = ibuf, *ie = ibuf;
    char getc() {
        if (ib == ie) {
            ib = ibuf;
            ie = ibuf + fread(ibuf, 1, BUFF, stdin);
        }
        return ib == ie ? -1 : *ib++;
    }
}

int qread() {
    using namespace _buff;
    int ret = 0;
    bool pos = true;
    char c = getc();
    for (; (c < '0' || c > '9') && c != '-'; c = getc()) {
        assert(~c);
    }
    if (c == '-') {
        pos = false;
        c = getc();
    }
    for (; c >= '0' && c <= '9'; c = getc()) {
        ret = (ret << 3) + (ret << 1) + (c ^ 48);
    }
    return pos ? ret : -ret;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--) {
        memset(tot, 0, sizeof(tot));
        scanf("%d %d",&n, &m);
        init();
        for(int i = 1; i <= m; ++i) {
            int a, b;
            scanf("%d %d", &a, &b);
            join(a,b);
        }
        for(int i = 1; i <= n; ++i) {
            int x = fid(i);
            tot[x]++;
        }
        int ans = 0;
        for(int i = 1; i <= n; ++i) {
            if(tot[i]) ans++;
        }
        cout << ans << endl;
    }
    return 0;
}