HDU1213 How Many Tables 解题报告
2013-08-12 16:07
316 查看
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9387 Accepted Submission(s): 4635
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
[align=left]Sample Input[/align]
2 5 3 1 2 2 3 4 5 5 1 2 5
[align=left]Sample Output[/align]
2 4
[align=left]Author[/align]
Ignatius.L
[align=left]Source[/align]
杭电ACM省赛集训队选拔赛之热身赛
[align=left]Recommend[/align]
Eddy
#include <iostream> using namespace std; int father[1010]; int Find(int a) { if(father[a]!=a) return father[a]=Find(father[a]); return father[a]; } void Union(int a,int b) { a=Find(a); b=Find(b); if (a!=b) { father[a]=b; } return; } int main() { int n,m,r; scanf("%d",&r); while(r--) { scanf("%d%d",&n,&m); int i,a,b; for(i=1;i<=n;i++) father[i]=i; for(i=0;i<m;i++) { scanf("%d%d",&a,&b); Union(a,b); } int c=0; for(i=1;i<=n;i++) { if(father[i]==i) c++; } printf("%d\n",c); } return 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(并查集裸题)
- [ACM] 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(并查集)
- HDU1213 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 [并查集]