HDU1856 More is better
来源:互联网 发布:java switch string 编辑:程序博客网 时间:2024/05/21 10:17
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 26366 Accepted Submission(s): 9441
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
一道简单的并查集的题目,不过一开始看到一千万的数据量还是吓得我差点不敢做了(逃。
#include <cstdio>#include <cstring>#define MAXN 10000005using namespace std;int a,par[MAXN],cnt[MAXN],n;int FindSet(int x){ if(x == par[x]) return x; return par[x] = FindSet(par[x]);}void UnionSet(int a, int b){ int x = FindSet(a); int y = FindSet(b); if(x == y) return; else{ par[x] = y; cnt[y] += cnt[x]; }}int main(){ while(~scanf("%d",&n)){ if(!n){ printf("1\n"); continue; } for(int i = 1; i < MAXN; i ++){ par[i] = i; cnt[i] = 1; } int a,b; while(n --){ scanf("%d%d",&a,&b); UnionSet(a,b); } int MAX = 0; for(int i = 1; i < MAXN; i ++){ if(MAX < cnt[i]) MAX = cnt[i]; } printf("%d\n",MAX); } return 0;}
0 0
- HDU1856:More is better
- HDU1856--More is better
- hdu1856-More is better
- HDU1856:More is better
- hdu1856 More is better
- hdu1856 More is better
- HDU1856---More is better
- HDU1856 More is better
- hdu1856 More is better
- [hdu1856] More is better
- HDU1856 More is better
- HDU1856 More is better
- More is better||HDU1856
- hdu1856 More is better
- HDU1856 More is better
- More is better hdu1856 并查集
- HDU1856 More is better 解题报告
- hdu1856 ,More is better,并查集
- 双链表的插入的实现
- java标识符
- 对hashMap和hashtable的理解
- git的使用
- 10 个有趣的 Linux 命令行小技巧
- HDU1856 More is better
- Retrofit使用总结
- 语音学习笔记13------谈谈斯坦福大学卷积神经网络之反向传播
- POJ 3126 Prime Path (BFS)
- CentOS环境下elasticsearch集群搭建
- javascript基础
- 周六日常训练,背包dp,树形dp,简单dp以及很多数学?
- Android视图状态及重绘流程分析,带你一步步深入了解View(三)
- Swift 3 编程语言