HDU
来源:互联网 发布:四川大学成教学院网络 编辑:程序博客网 时间:2024/06/04 00:28
Description
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.
Input
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.
Output
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.
Sample Input
2 10 1 104 0
Sample Output
10impossible
题意:
给N个点(编号为0~N-1),M条路,求最小生成树,如果不能生成最小生成树,则输出impossible。
思路:
用Kruskal做,如果最后得不到N-1条路(不能生成最小生成树),就输出impossible,否则输出结果。
#include<cstdio>#include<cstring>#include<algorithm>//#define LOCALusing namespace std;const int maxn = 10000 + 5;struct node { int a, b, c; bool operator<(const node&u)const { return c < u.c; }}kruskal[maxn];int fa[maxn];int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]);}int main(){#ifdef LOCAL freopen("data.in", "r", stdin);#endif // LOCAL int n, m; while (~scanf("%d%d", &n, &m)) { int sum = 0, cnt = 0; for (int i = 0; i < n; i++) { fa[i] = i; } for (int i = 0; i < m; i++) { scanf("%d%d%d", &kruskal[i].a, &kruskal[i].b, &kruskal[i].c); } sort(kruskal, kruskal + m); for (int i = 0; i < m; i++) { int ra = find(kruskal[i].a); int rb = find(kruskal[i].b); if (ra != rb) { fa[rb] = ra; sum += kruskal[i].c; cnt++; } } if (cnt == n - 1) printf("%d\n\n", sum); else puts("impossible\n"); } return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 成员变量、类变量和局部变量的区别
- (九)事件的激活与调度
- HDU 2089 不要62 & HDU 3652 B-number(初级数位DP)
- 基于外部一个省市联动js框架,实现初始化特定的地址级联
- 文章标题
- HDU
- 浅拷贝,深拷贝
- gcc编译时的输出如何带上颜色
- TensorFlow框架(1)之Computational Graph详解
- 网站优化 14条--雅虎十四条优化原则
- zoj1889
- Elasticsearch
- 剑指offer第九题(变态跳台阶)
- Binder客户端和驱动端通信流程实例分析----以acquireWakeLock()函数为例 (二)