How Many Tables
来源:互联网 发布:go语言编程 pdf 编辑:程序博客网 时间:2024/06/05 05:31
How Many Tables
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.
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.
25 31 22 34 55 12 5
24
该题的题意是将所有直接认识或者间接认识的人安排到一桌,每桌人数不限,也就是说看看有多少组互相没有关系的人。
AC代码如下:
#include<cstdio>int fa[1010];int N,M;int find(int x){return (x==fa[x])?x:find(fa[x]);}//找到根节点//void andd(int x,int y){int f1=find(x);int f2=find(y);if(f1!=f2)fa[f1]=f2;}//合并两组有关系的圈子//int main(){int t;int a,b;scanf("%d",&t);while(t--){scanf("%d%d",&N,&M);for(int i=1;i<=N;i++)fa[i]=i;//初始化//for(int i=1;i<=M;i++){scanf("%d%d",&a,&b);andd(a,b);}int ans=0;//记录没有关系的组数//for(int i=1;i<=N;i++){if(i==fa[i])ans++;}printf("%d\n",ans);}return 0;}
haha
阅读全文
0 0
- How Many Tables
- HDOJ How Many Tables
- hduoj1213:How Many Tables
- hdu How Many Tables
- HDU1213:How Many Tables
- HDU1213--How Many Tables
- hdu1213-How Many Tables
- hdu1213 How Many Tables
- HDU How Many Tables
- hdu_1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables
- How Many Tables
- HDU How Many Tables
- HDU1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables
- How Many Tables 1213
- SQL查询和优化(一)
- 悼念512汶川大地震遇难同胞
- git 创建版本库
- CSU 1510Happy Robot(dp)
- Bluetooth MESH探究 --- (6) BLE core spec之广播信道防冲突与数据信道选择
- How Many Tables
- Git更新远程仓库代码到本地 git fetch
- 基于servlet3实现长轮询
- Java 并发专题 : Executor详细介绍 打造基于Executor的Web服务器
- 数组
- 欢迎使用CSDN-markdown编辑器
- problem.php?pid=513
- UOJ33树上GCD
- AD中进行集体操作的方法