How Many Tables
来源:互联网 发布:女包包网淘宝网 编辑:程序博客网 时间:2024/06/11 18:17
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
25 31 22 34 55 12 5
Sample Output
2
#include<stdio.h>#include<string.h>int pre[1010];int find_ancestor(int x){//这里除了一句mmp,我也不知道说什么了//第一次 == 写成了 =,这次考试把后面的find_ancestor(pre[x])写成了x return pre[x]== x ? x: pre[x]=find_ancestor(pre[x]);}int main(){ int T; scanf("%d",&T); while(T--) { memset(pre,0,sizeof(pre)); int n,m,i; scanf("%d %d",&n,&m); for(i=1;i<=n;i++) pre[i]=i; for(i=1;i<=m;i++) { int x,y,fx,fy; scanf("%d %d",&x,&y); fx=find_ancestor(x); fy=find_ancestor(y); if(fx!=fy) pre[fx]=fy; } int ans=0; for(i=1;i<=n;i++) if(pre[i]==i) ans++; printf("%d\n",ans); } return 0;}
阅读全文
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
- Volatile和Synchronized对可见性和原子性的支持
- linux学习总结 unit06进程管理
- 原型模式
- java自定义Exception
- Android零基础入门第14节:使用高速Genymotion,跨入火箭时代
- How Many Tables
- 2_Add Two Numbers
- 表单提交设置disabled属性的input数据未提交
- 【Node.js-1】NodeJS简单入门、http、fs、url、querystring、接收客户端get/post数据
- HDU 1465 不容易系列之一(错排公式推导)
- 设置背景透明度
- hdu 1074 状态压缩DP 贪心错的原因(D)
- c++笔记
- NOIP2017测试(7.24)