HDU -1213 How Many Tables

本文介绍了一个有趣的问题:如何计算最少需要多少张桌子来安排不同熟悉程度的朋友共餐。通过使用并查集数据结构,文章详细解释了算法实现过程,包括初始化、查找同根节点和合并节点等关键步骤。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

      学习:不是同根的计算。

               How Many Tables

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

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 #include<stdio.h>
 2 #define M 1009
 3 int n,p[M];
 4 void init()
 5 {
 6     int i;
 7     for(i=1;i<=n;i++)
 8         p[i]=i;
 9 }
10 int find(int x)
11  {
12   if(p[x]!=x)
13    p[x]=find(p[x]);
14   return p[x];
15  }//找到同根。
16  void Union(int x,int y)
17  {
18   x=find(x);
19   y=find(y);
20   if(x==y)
21    return;
22   p[x]=y;
23  }//合并同根。
24 int main()
25 {
26   int t,m,i,k,r,q,j;
27   scanf("%d",&t);
28   while(t--)
29   {
30          r=0;
31       scanf("%d%d",&n,&m);
32       init(); 
33       for(i=0;i<m;i++)
34       {
35          scanf("%d%d",&k,&q);
36            Union(k,q);
37       }
38       for(j=1;j<=n;j++)
39          {
40              if(p[j]==j)//注意不是同根的方法。
41                 r++;
42           }
43      
44         printf("%d\n",r);
45   }
46   return 0;
47 }

 

 
 

转载于:https://www.cnblogs.com/cancangood/p/3320273.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值