hdu-1213 How Many Tables
来源:互联网 发布:浅谈人工智能 编辑:程序博客网 时间:2024/05/21 03:19
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18251 Accepted Submission(s): 8992
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.
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
24
Author
Ignatius.L
Source
杭电ACM省赛集训队选拔赛之热身赛
# include<stdio.h># include<string.h># include<algorithm>using namespace std;int per[1000];int find(int x){ int i, j, k ,r; r= x; i = x; while(r != per[r]) r = per[r]; while(i != r) { j = per[i]; per[i] = r; i = j ; } return r;}void hebing(int x, int y){ int fx = find(x); int fy = find(y); if(fx != fy) per[fx] = fy;}int main(){ int z; scanf("%d",&z); while(z--) { int m, t, n, s, a ,b; scanf("%d%d",&m,&n); for(t = 1; t <= m; t++) per[t] = t; s = 0; for(t = 0; t < n; t++) { scanf("%d%d",&a,&b); hebing (a,b); } for(t = 1; t <= m; t++) { if(per[t] == t) s++; } printf("%d\n",s); } return 0;}
0 0
- hdu 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- Hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213how many tables
- hdu 1213 How Many Tables
- Hdu 1213 - How Many Tables
- HDU 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- Ubuntu 12.04 安装中文输入法
- 数据结构---单链表(3)
- 又跳了一天,懈怠无时无刻不在侵蚀我啊!!
- Linux_历史
- POJ2385Apple Catching【dp】
- hdu-1213 How Many Tables
- poj 2026 Borg Maze
- java的语法学习及小小编程(7.30)
- 嵌入式软件开发——嵌入式软件常见的笔试题(c)
- 用表单实现用户注册
- 第三天!!!!
- 【问与答】开复老师:硕士毕业后工作,还是出国读博?
- hdu-1272 小希的迷宫
- 提高ListView的性能