简单并查集问题---CodeForces 445B

题目如下：
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

CodeForces 445B
Description
DZY loves chemistry, and he enjoys mixing chemicals.

DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.

Let’s consider the danger of a test tube. Danger of an empty test tube is 1. And every time when DZY pours a chemical, if there are already one or more chemicals in the test tube that can react with it, the danger of the test tube will be multiplied by 2. Otherwise the danger remains as it is.

Find the maximum possible danger after pouring all the chemicals one by one in optimal order.

Input
The first line contains two space-separated integers n and m.

Each of the next m lines contains two space-separated integers xi and yi(1 ≤ xi < yi ≤ n). These integers mean that the chemical xi will react with the chemical yi. Each pair of chemicals will appear at most once in the input.

Consider all the chemicals numbered from 1 to n in some order.

Output
Print a single integer — the maximum possible danger.

Sample Input
Input
1 0
Output
1
Input
2 1
1 2
Output
2
Input
3 2
1 2
2 3
Output
4
Hint
In the first sample, there’s only one way to pour, and the danger won’t increase.

In the second sample, no matter we pour the 1st chemical first, or pour the 2nd chemical first, the answer is always 2.

In the third sample, there are four ways to achieve the maximum possible danger: 2-1-3, 2-3-1, 1-2-3 and 3-2-1 (that is the numbers of the chemicals in order of pouring).

找出最大危险情况，也只需使用并查集找到相应的联通块；
代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int pre[55];
int find_root(int x){return pre[x]==x?x:pre[x]=find_root(pre[x]);}
int sum[55];
int maxn=-1;
int n,m; 
int main()
{
    cin>>n>>m;
    if(n==1)
    {
        cout<<1<<endl;
        return 0;
    }
    memset(pre,0,sizeof(pre));
    for(int i=1;i<=n;i++)
    {
        pre[i]=i;
        sum[i]=1;
    }
    int rx1,ry1;
    for(int i=0;i<m;i++)
    {
        int x1,y1;
        cin>>x1>>y1;
        rx1=find_root(x1);
        ry1=find_root(y1);
        if(rx1!=ry1)
        {
            pre[rx1]=ry1;
        }   
    }
    long long mul=1;
    for(int i=1;i<=n;i++)
    {
        if(pre[i]!=i)
        {
            mul*=2;
        }
    }
    printf("%I64d\n",mul); 
    return 0;
}

仅代表个人观点，欢迎交流探讨，勿喷~~~

PhotoBy:WLOP

http://weibo.com/wlop