杭电1213How Many Tables
2016-08-01 16:04
302 查看
How Many Tables
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d
& %I64u
Submit Status
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
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<stdio.h> #include<algorithm> using namespace std; int pre[30010]; int find(int x) { while(x!=pre[x]) x=pre[x]; return x; } void merge(int x,int y) { int fx=find(x); int fy=find(y); if(fx!=fy) { if(fx>fy) pre[fx]=fy; else pre[fy]=fx; } } int main() { int t,n,m,i,ans,a,b; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(i=1;i<=n;i++) pre[i]=i; while(m--) { scanf("%d%d",&a,&b); merge(a,b); } ans=0; for(i=1;i<=n;i++) if(find(i)==i) ans++; printf("%d\n",ans); } return 0; }
相关文章推荐
- 杭电 hdu 1213 How Many Tables (并查集,简单题)
- 杭电1213 How Many Tables(并查集找根节点)
- 杭电oj1213——How Many Tables(并查集)
- 杭电hdu 1213 How Many Tables并查集
- 并查集-杭电1213-How Many Tables-难度1
- 杭电1213How Many Tables与杭电1232大同小异
- hdu杭电1213 How Many Tables【并查集】
- 杭电acm 1213 (How many tables)
- 杭电1213 How Many Tables(并查集)
- 杭电 1213 How Many Tables 并查集
- HDOJ 1213 How Many Tables 杭电 ACM
- 杭电1213_How Many Tables——java(并查集)
- 杭电 1213 How Many Tables
- 杭电1213-How Many Tables
- HDU 1213 How Many Tables 并查集 水~
- HD-1213-How Many Tables(并查集)
- HDU - 1213 How Many Tables (简单并查集)
- How Many Tables(POJ 1213 求连通分量)
- 1213 How Many Tables 简单的并查集问题
- HDOJ 题目1213 How Many Tables(并查集基础)