Codeforces445B_DZY Loves Chemistry(DFS/并查集)
来源:互联网 发布:wpf高级编程 pdf 网盘 编辑:程序博客网 时间:2024/05/26 15:55
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.
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 xiwill 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.
Print a single integer — the maximum possible danger.
1 0
1
2 11 2
2
3 21 22 3
4
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).
解题报告
意思很不清楚。。。
有一试管,有N个化学物品,M对能发生化学反应的药品,求最大危险系数。
空试管的危险系数为1,当有一个药品或多个药品发生反应的时候,危险系数乘以2。
那样的话对于任一联通块,都会产生危险×2
一开始以为找最大的联通块。。。
这题可以用并查集求出联通块。。。
也可以直接DFS搜
#include <iostream>#include <cstring>#include <cstdio>#define N 55#define M 12550using namespace std;struct node{ int v,next;} edge[M];int head[N],n,m,cnt,maxx=0,vis[N];void add(int u,int v){ edge[cnt].v=v; edge[cnt].next=head[u]; head[u]=cnt++;}void dfs(int s){ vis[s]=1; for(int i=head[s]; i!=-1; i=edge[i].next) { if(!vis[edge[i].v]) { maxx++; dfs(edge[i].v); } }}int main(){ int i,j,u,v; while(~scanf("%d%d",&n,&m)) { cnt=0; maxx=0; __int64 dd=1; memset(edge,0,sizeof(edge)); memset(head,-1,sizeof(head)); memset(vis,0,sizeof(vis)); for(i=0; i<m; i++) { scanf("%d%d",&u,&v); add(u,v); add(v,u); } int ans=0; for(i=1; i<=n; i++) { dfs(i); } printf("%I64d\n",dd<<maxx); } return 0;}
#include <iostream>#include <cstdio>#include <cstring>#define N 55#define M 12500using namespace std;int B[N],num[N];int fine(int x){ if(B[x]!=x) B[x]=fine(B[x]); return B[x];}void bin(int x,int y){ int xx=fine(x); int yy=fine(y); if(xx!=yy) { B[xx]=yy; num[xx]+=num[yy]; num[yy]=1; }}int n,m;int main(){ int i,j,u,v; while(~scanf("%d%d",&n,&m)) { for(i=1;i<=n;i++) { B[i]=i; num[i]=1; } for(i=0;i<m;i++) { scanf("%d%d",&u,&v); bin(u,v); } int sum=0; for(i=1;i<=n;i++) { if(num[i]!=1) { sum+=num[i]-1; } } __int64 d=1; printf("%I64d\n",d<<sum); } return 0;}
- Codeforces445B_DZY Loves Chemistry(DFS/并查集)
- codeforces 445B DZY Loves Chemistry 贪心 dfs 并查集
- CodeForces 445B. DZY Loves Chemistry(并查集)
- Codeforces 445B DZY Loves Chemistry(并查集)
- CodeForces 445B DZY Loves Chemistry(并查集)
- CodeForces 445B DZY Loves Chemistry (并查集)
- CodeForces 445B - DZY Loves Chemistry(并查集)
- Codeforces 455B DZY Loves Chemistry【并查集】
- 【codeforces 445B - DZY Loves Chemistry 】 + 并查集
- CodeForces 445B DZY Loves Chemistry (并查集)
- codeforces 445 B. DZY Loves Chemistry (并查集)
- 【Codeforces】-DZY Loves Chemistry(并查集变形)
- 【CodeForces】445B - DZY Loves Chemistry(并查集)
- CF445B:DZY Loves Chemistry(并查集)
- Codeforces Round #254 (Div. 2) 445B - DZY Loves Chemistry (并查集)
- BZOJ 3520: Dzy loves chemistry 1【并查集,卡精度
- 并查集+DFS
- POJ1291-并查集/dfs
- 为期45天的记忆训练
- 在使用Array的时候,尽量用查询后再操作的方法,这样更加严谨.
- js时间插件
- Codeforces445A_DZY Loves Chessboard(预处理)
- 东软实训(六)
- Codeforces445B_DZY Loves Chemistry(DFS/并查集)
- 东软实训(八)
- WebServices学习笔记(三)复杂类型数据的传递
- Clone Graph
- 【#254_DIV2】-A B C
- 一,入门基础—— 5,Xcode界面介绍 右侧介绍
- 【占位】IIS中各种队列
- http://photo.renren.com/photo/827157467/album-1034046772
- 2015年大数据市场规模超过170亿美元