HDU 1213 - How Many Tables
2016-03-04 18:18
302 查看
C - How Many Tables
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
1213
Appoint description:
System Crawler (2016-03-02)
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
Sample Output
水题
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice HDU
1213
Appoint description:
System Crawler (2016-03-02)
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 <iostream> #include <cstdio> #include <cstring> using namespace std; #define N 1005 int f ; int n,m; bool vis ; int _find(int x){ if (x==f[x]) return x; return f[x]=_find(f[x]); } int main(){ int t; scanf("%d",&t); while (t--){ scanf("%d%d",&n,&m); for (int i=1;i<=n;i++){ f[i]=i; vis[i]=false; } for (int i=0;i<m;i++){ int u,v; scanf("%d%d",&u,&v); int x=_find(u); int y=_find(v); f[x]=y; } int ans=0; for (int i=1;i<=n;i++){ int x=_find(i); if (!vis[x]){ vis[x]=true; ans++; } } printf("%d\n",ans); } return 0; }
相关文章推荐
- 属性动画
- jquery的ajax同步和异步
- 框架汇总
- POJ 1611 - The Suspects
- 数字游戏
- C++中类所占内存空间的分析(转载)
- ASP.NET分页控件
- 学习进度01
- PM 与 LM 如何分钱问题
- 关于随机数的产生
- An instance of “(null)” is already running. Choose “Stop” to terminate and launch a new instance.
- Linux 后台进程与守护进程
- Android工程的编译过程
- Leet Code OJ 268. Missing Number [Difficulty: Easy]
- FZU 2088 最长队名
- 分页控件
- 6-10-幂集-树和二叉树-第6章-《数据结构》课本源码-严蔚敏吴伟民版
- 【Xamarin挖墙脚系列:Xamarin.IOS机制原理剖析】
- 文章标题
- hdu1050 活动安排问题(有坑)