【HDU】 1213
来源:互联网 发布:军绿色外套 淘宝 编辑:程序博客网 时间:2024/06/15 15:38
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35158 Accepted Submission(s): 17524
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省赛集训队选拔赛之热身赛
Recommend
Eddy | We have carefully selected several similar problems for you: 1272 1232 1325 1198 1863
AC代码:
#include<cstdio>#include<iostream>using namespace std;int par[1010];int find(int x){if(x!=par[x])return par[x]=find(par[x]);return x;}void unite(int x,int y){int fa=find(x);int fb=find(y);if(fa!=fb){par[fa]=fb;}}int main(){int t,n,m;cin>>t;while(t--){cin>>n>>m;for(int i=1;i<=n;i++)par[i]=i;int a,b;for(int i=1;i<=m;i++){cin>>a>>b;unite(a,b);}int sum=0;for(int i=1;i<=n;i++){if(i==par[i])sum++;}cout<<sum<<endl;}return 0;}
阅读全文
0 0
- HDU 1213
- HDU 1213
- HDU 1213
- HDU 1213
- HDU 1213
- hdu 1213
- hdu 1213
- HDU 1213
- HDU 1213
- hdu 1213
- hdu 1213
- hdu 1213
- hdu 1213
- hdu 1213
- hdu(1213)
- HDU 1213
- hdu 1213
- HDU 1213
- Re-ID: Learning Deep Feature Representation with Domain Guided Dropout for Person Re-identifiation
- Java生成图片验证码
- JAVA | 11
- WIN7下安装Tensorflow
- React 组件通信
- 【HDU】 1213
- Java练习题14 教师研究生工资
- 音频常用的音频格式
- 用Condtruct2 制作游戏2
- HashMap、LinkedHashMap、TreeMap、HashTable、ConcurrentHashMap原理解析
- java中的快速失败(fail-fast)与安全失败(fail-safe)
- 特斯拉为什么要造电动卡车?
- 网狐荣耀版手机端在复制文本时提示“复制内容非法”的解决办法
- 共享自己电脑硬盘空间还能赚钱?