HDU 1213 How Many Tables

How Many Tables

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

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
  
  

分析：该题需要知道有多少个连通图，对图深搜一下，便可知道有多少连通图，单独的节点需要在输入的时候记录下。

代码如下：

#include <stdio.h>
#include <string.h>
int a,b,n,map[1005][1005];
int ans[1005];
void dfs(int i)
{
	int j;
	for(j=1;j<=n;j++)
	{
		if(map[i][j])
		{
			map[i][j]=0;
			dfs(j);
		}
	}
}

int main()
{
	int i,j;
	int T,m,peace=1;
	scanf("%d",&T);
	while(T--)
	{
		int index=0;
		scanf("%d %d",&n,&m);
		memset(map,0,sizeof(map));
		memset(ans,0,sizeof(ans));
		for(i=1;i<=m;i++)
		{
			scanf("%d %d",&a,&b);
			map[a][b]=1;
			map[b][a]=1;
			ans[a]=1;
			ans[b]=1;
		}
		
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				if(map[i][j])
				{
					map[i][j]=0;
					dfs(j);
					index++;
				}
			}
		}
		for(i=1;i<=n;i++)
			if(!ans[i])
				index++;
		printf("%d\n",index);
	}
	return 0;
}