hdu 1856 More is better 基础并查集★
来源:互联网 发布:cf提示网络出现异常 编辑:程序博客网 时间:2024/05/20 12:24
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 29398 Accepted Submission(s): 10436
Problem Description
Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.
Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
Input
The first line of the input contains an integer n (0 ≤ n ≤ 100 000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)
Output
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
Sample Input
41 23 45 61 641 23 45 67 8
Sample Output
42HintA and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result.In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.
Author
lxlcrystal@TJU
Source
HDU 2007 Programming Contest - Final
Recommend
lcy | We have carefully selected several similar problems for you: 1272 1232 1213 1879 1863
最大连通量
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int pre[1000003];int num[1000003];int res=0;void init(){ for(int i=0;i<=1000000;i++) pre[i]=i,num[i]=1;}int Find(int x){ if(x!=pre[x]) return pre[x]=Find(pre[x]); return pre[x];}void Merge(int x,int y){ int X=Find(x); int Y=Find(y); if(X!=Y) { pre[X]=Y; num[Y]+=num[X]; res=max(res,num[Y]); }}int main(){ int n; while (~scanf("%d", &n)) { init(); res=1; for(int i = 0; i < n; i++) { int x,y; scanf("%d%d",&x,&y); Merge(x,y); } printf("%d\n",res); }}
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 29398 Accepted Submission(s): 10436
Problem Description
Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.
Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
Input
The first line of the input contains an integer n (0 ≤ n ≤ 100 000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)
Output
The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep.
Sample Input
41 23 45 61 641 23 45 67 8
Sample Output
42HintA and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result.In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.
Author
lxlcrystal@TJU
Source
HDU 2007 Programming Contest - Final
Recommend
lcy | We have carefully selected several similar problems for you: 1272 1232 1213 1879 1863
阅读全文
0 0
- HDU 1856 More is better 基础并查集★
- hdu 1856 More is better 基础并查集★
- hdu 1856 More is better(并查集基础)
- HDU 1856 More is better(基础并查集)
- HDU 1856 More is better 基础并查集★(经典)
- hdu 1856 More is better 并查集(二)
- 并查集 Hdu 1856 More is better
- hdu 1856 More is better (并查集入门)
- HDU 1856 More is better 并查集 路径压缩
- hdu 1856 More is better(并查集)
- hdu 1856 More is better(并查集)
- hdu 1856 more is better 并查集
- hdu 1856 More is better 并查集
- HDU 1856 More is better 并查集
- hdu 1856 More is better(并查集)
- hdu 1856 More is better (并查集)
- HDU 1856 More is better 并查集
- HDU-1856-More is better(并查集)
- Gradle学习系列文章推荐
- 进程控制1之初识进程
- 菜鸡记录之初试自动更新,源码及出现的问题
- 真彩色转256色算法
- js 比typeof 更准判断数据类型 更好用的判断语句
- hdu 1856 More is better 基础并查集★
- 如何实现手机app制作,常用开源框架汇总
- Android开发环境配置
- scala 中的异常捕获
- java.util.logging.Logger基础教程
- HDU 6078 Wavel Sequence
- 当你在应用机器学习时你应该想什么
- 自动化测试框架selenium+java+TestNG——TestNG注解、执行、测试结果和测试报告 之二
- maven pom文件中定义常量值