HDOJ 1856 More is better
来源:互联网 发布:天刀成女脸型数据 编辑:程序博客网 时间:2024/04/30 02:34
More is better
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 20417 Accepted Submission(s): 7475
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.
#include <cstdio>#include <cstring>using namespace std;int pre[10000010], me[10000010];int max(int x, int y){ return x > y ? x : y;}int find(int x){ if (pre[x] != x) pre[x] = find(pre[x]); return pre[x];}void mix(int x, int y){ int fx = find(x); int fy = find(y); if (fx != fy){ pre[fy] = fx; me[fx] += me[fy]; }}int main(){ int n, x, y, i; int ma, mi; while (scanf("%d", &n) != EOF){ for (i = 0; i <= 1000000; i++){ pre[i] = i; me[i] = 1; } ma = 0; mi = 1; for (i = 0; i < n; i++){ scanf("%d%d", &x, &y); if (x > mi || y > mi){ mi = max(x, y); } mix(x, y); } for (i = 1; i <= mi; i++){ if (me[i] > ma) ma = me[i]; } printf("%d\n", ma); } return 0;}
0 0
- HDOJ 1856 More is better
- HDOJ 1856 More is better
- hdoj 1856 More is better
- hdoj 1856 More is better
- HDOJ 1856 More is better
- hdoj-1856-More is better
- HDOJ 1856 More is better
- HDOJ More is better
- hdoj 1856 More is better 【rank[]】
- hdoj 1856.More is better
- HDOJ-1852 More is better
- More is better 1856
- 1856 More is better
- HDOJ--1856--More is better【并查集】
- HDOJ 1856 More is better 杭电 ACM
- HDOJ 题目1856More is better(并查集)
- hdoj-1856-More is better【并查集】
- HDOJ 1856 More is better (并查集)
- Hadoop管理员的十个最佳实践
- Web app和native app之争_20151215
- HDOJ 1272 小希的迷宫
- linux 问题处理
- 命令行自动提升管理员权限
- HDOJ 1856 More is better
- wpa_cli
- Stream、Reader说明;Stream与String互转
- Hive内置数据类型
- volatile
- HDOJ 1213 How Many Tables
- 最近5年133个Java面试问题列表
- SQL Server 存储过程
- 构建Unity3D信号槽机制 【ZObject.cs】