How Many Tables 并查集+水题+hdu
来源:互联网 发布:剃头理发器软件 编辑:程序博客网 时间:2024/06/06 11:08
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13167 Accepted Submission(s): 6431
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解决方案:水题,心情郁闷,刷着开心code:#include<iostream>#include<cstdio>#include<cstring>using namespace std;int fa[1002];bool vis[1002];int faset(int x){return x!=fa[x]?fa[x]=faset(fa[x]):x;}int N,M;int main(){ int t; scanf("%d",&t); while(t--){ scanf("%d%d",&N,&M); memset(vis,false,sizeof(vis)); for(int i=0;i<=N;i++)fa[i]=i; while(M--){ int a,b; scanf("%d%d",&a,&b); int x=faset(a),y=faset(b); if(x!=y) fa[x]=y; else continue; } for(int i=1;i<=N;i++){ vis[faset(i)]=true; } int cnt=0; for(int i=1;i<=N;i++){ if(vis[i]) cnt++; } printf("%d\n",cnt); if(t) getchar(); } return 0;}
0 0
- 并查集 hdu How Many Tables
- How Many Tables 并查集+水题+hdu
- 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(并查集练习)
- HDU 1213 How Many Tables 并查集入门
- HDU 1213 How Many Tables 并查集 水~
- HDU 1213 How Many Tables(并查集)
- [ACM] 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 (简单并查集)
- ARM平台上Linux异常处理代码简要分析
- Debug与Release版本的区别
- Android系统架构
- C语言编译原理
- 在WPF程序中使用摄像头兼谈如何使用AForge.NET控件
- How Many Tables 并查集+水题+hdu
- python 进阶学习之15
- Direct2D随笔2——在C#的WinForm环境下创建Gameloop
- POJ 2115 C Looooops
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- Django安装
- poj3422 来一道费用流
- Java对象的序列化和反序列化实践
- Windows Program Files 和 Program Files (x86) 的区别