hdu 2122 Ice_cream’s world III(最小生成树)
2014-10-18 20:02
513 查看
[align=left]Problem Description[/align]
ice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beautifies the roads, by which there are some ways from every
city to the capital. The project’s cost should be as less as better.
[align=left]Input[/align]
Every case have two integers N and M (N<=1000, M<=10000) meaning N cities and M roads, the cities numbered 0…N-1, following N lines, each line contain three integers S, T and C, meaning S connected with T have a road will cost C.
[align=left]Output[/align]
If Wiskey can’t satisfy the queen’s requirement, you must be output “impossible”, otherwise, print the minimum cost in this project. After every case print one blank.
[align=left]Sample Input[/align]
[align=left]Sample Output[/align]
最小生成树
ice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beautifies the roads, by which there are some ways from every
city to the capital. The project’s cost should be as less as better.
[align=left]Input[/align]
Every case have two integers N and M (N<=1000, M<=10000) meaning N cities and M roads, the cities numbered 0…N-1, following N lines, each line contain three integers S, T and C, meaning S connected with T have a road will cost C.
[align=left]Output[/align]
If Wiskey can’t satisfy the queen’s requirement, you must be output “impossible”, otherwise, print the minimum cost in this project. After every case print one blank.
[align=left]Sample Input[/align]
2 1 0 1 10 4 0
[align=left]Sample Output[/align]
10 impossible
最小生成树
#include<iostream> #include<stdio.h> #include<stdlib.h> #include<algorithm> using namespace std; const int MAX=1005; int father[MAX]; struct node { int u; int v; int w; bool operator<(const node &t)const { return w<t.w; } }e[MAX*10]; int Find(int x) { if(x!=father[x]) { father[x]=Find(father[x]); } return father[x]; } void Union(int x,int y) { x=Find(x); y=Find(y); if(x!=y) { father[x]=y; } } int main() { int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int i; for(i=0;i<=n;i++) { father[i]=i; } for(i=0;i<m;i++) { scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w); } sort(e,e+m); int sum=0; int ans=0; for(i=0;i<m;i++) { if(Find(e[i].u)!=Find(e[i].v)) { ans++; Union(e[i].u,e[i].v); sum+=e[i].w; } } if(ans!=n-1) { printf("impossible\n"); } else { printf("%d\n",sum); } } return 0; }
相关文章推荐
- 最小生成树 Prim 算法HDU 2122 Ice_cream’s world III
- HDU 2122 Ice_cream’s world III(最小生成树)
- HDU 2122 Ice_cream’s world III 【最小生成树】
- hdu 2122(Ice_cream’s world III)(最小生成树,两种算法都可以)
- HDU 2122 Ice_cream’s world III【最小生成树】
- Ice_cream’s world III hdu 2122 最小生成树
- HDU2122--Ice_cream’s world III--最小生成树--kruskal
- HDU 2122 Ice_cream’s world III(最小生成树Kruskal)
- hdu 2122 Ice_cream’s world III(最小生成树))
- hdu 2122 Ice_cream’s world III(最小生成树)
- 文章标题 HDU 2122: Ice_cream’s world III (最小生成树+kruskal)
- hdoj 2122 Ice_cream’s world III【最小生成树】
- hdoj 2122 Ice_cream’s world III 【最小生成树】
- hdoj 2122 Ice_cream’s world III【最小生成树】
- hdoj 2122 Ice_cream’s world III 【最小生成树】
- 杭电 最小生成树 2122 Ice_cream’s world III
- HDOJ 2122 Ice_cream’s world III(最小生成树--prime 水)
- hdoj 2122Ice_cream’s world III 【最小生成树 kruskal && prim】
- [MST]hdu 2122 Ice_cream’s world III
- hdu 2122 Ice_cream’s world III