HDU - 1856 More is better 并查集

More is better

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)
Total Submission(s): 30751    Accepted Submission(s): 10922

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.

 

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

4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8

 

Sample Output

4 2

Hint

A 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

并查集水题，需要注意的是： 当N = 0的时候代表所有人之间都没有联系，所有最终只会留下一个人。

有两种解决的办法：

1、按照求森林数的方法。在最后对每个集合的元素数量求值

#include 
#include 
#include 
#include 
using namespace std;

const int MAXN = 10000000 + 5;

int MAX = 0;
int MIN = 0x7fffffff;

int degree[MAXN];
int parent[MAXN];
set cache;

void initSet(){
    MAX = 0;
    MIN = 0x7fffffff;
    memset(degree,0,sizeof(degree));
    for(int i = 0; i < MAXN; i ++)
        parent[i] = i;
}

int find(int x){
    if(x != parent[x])
        return parent[x] = find(parent[x]);
    else
        return parent[x];
}

void unionSet(int a,int b){
    int x = find(a);
    int y = find(b);

    if(x != y)
        parent[x] = y;
}

int main(){
    int N;
    while(scanf("%d",&N) != EOF){
        if(!N){
            cout <<1 <

2、直接在union操作的时候将集合元素数量由下级累加给上级

#include 
#include 
#include 
#include 
using namespace std;

const int MAXN = 10000000 + 5;

int MAX = 0;
int MIN = 0x7fffffff;

int degree[MAXN];
int parent[MAXN];
set cache;

void initSet(){
    MAX = 0;
    MIN = 0x7fffffff;
    for(int i = 0; i < MAXN; i ++){
        parent[i] = i;
        degree[i] = 1;
    }
}

int find(int x){
    if(x != parent[x])
        return parent[x] = find(parent[x]);
    else
        return parent[x];
}

void unionSet(int a,int b){
    int x = find(a);
    int y = find(b);

    if(x != y){
        parent[x] = y;
        degree[y] += degree[x];
    }
}

int main(){
    int N;
    while(scanf("%d",&N) != EOF){
        if(!N){
            cout <<1 <