445B - DZY Loves Chemistry
2014-08-17 23:29
447 查看
这是一道并查集的题目,而且是很简单的并查集的题目。只要具备初等并查集的知识这道题都不是难事。所以这里不讲。
#include<iostream> using namespace std; #include<stdio.h> int pre[55]; int find(int x) { int r=x; while(pre[r]!=r)r=pre[r]; int i=x; int j; while(i!=r) { j=pre[i]; pre[i]=r; i=j; } return r; } int main() { int i,j,m,n; int sum; int k1,k2; __int64 num; while(cin>>n>>m) { sum=0; num=1; for(i=0;i<55;i++)pre[i]=i; for(i=0;i<m;i++) { scanf("%d%d",&k1,&k2); int p1=find(k1); int p2=find(k2); if(p1!=p2) { sum++; pre[p1]=p2; } } for(i=1;i<=sum;i++) num*=2; cout<<num<<endl; } }
相关文章推荐
- Codeforces Round #254 (Div. 2) 445B - DZY Loves Chemistry (并查集)
- codeforces 445 B DZY Loves Chemistry【并查集】
- Codeforces 445B——并查集或DFS——DZY Loves Chemistry
- codeforces 445 B. DZY Loves Chemistry (并查集)
- Codeforces Round #254 (Div. 2) B (445B)DZY Loves Chemistry
- Codeforces Round #254 (Div. 2) B (445B)DZY Loves Chemistry
- Codeforces - B - DZY Loves Chemistry【水题】
- Codeforces Round #254 (Div. 2)B DZY Loves Chemistry(并查集)
- Codeforces 445 A DZY Loves Chessboard(预处理)
- [Codeforces] Round #254 (Div. 2) B. DZY Loves Chemistry
- Codeforces Round #254 (Div. 2)B. DZY Loves Chemistry
- DZY Loves Chemistry
- Codeforces Round #254 (Div. 2)B DZY Loves Chemistry(并查集)
- Codeforces Round #254 (Div. 2) __B. DZY Loves Chemistry
- Codeforces Round #254 (Div. 2)B. DZY Loves Chemistry
- Codeforces Round #254 (Div. 2) DZY Loves Chemistry【并查集基础】
- codeforces 445 A. DZY Loves Chessboard
- CodeForces - 445B_DZY Loves Chemistry_并查集
- Codeforces445B_DZY Loves Chemistry(DFS/并查集)
- E--DZY Loves Chemistry(CF-445B