HDU 1102 Constructing Roads (最小生成树,kruskal)
来源:互联网 发布:如何修改淘宝店铺类目 编辑:程序博客网 时间:2024/05/23 19:16
HDU 1102 Constructing Roads
题目链接
Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24371 Accepted Submission(s): 9395
Problem Description
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.
We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.
Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.
Sample Input
3
0 990 692
990 0 179
692 179 0
1
1 2
Sample Output
179
Source
kicc
========================================================================================
依然是一道最小生成树的变形算法,让你在最小生成树里剔除掉一直的部分
下面是AC代码
#include<stdio.h>#include<algorithm>#include<string.h>#include<iostream>using namespace std;int mark[110];int pic[110][110];struct Node{ int x,y; int weight;}node[20000];int find(int x){ return mark[x] == x ? x : mark[x] = find(mark[x]);}void join (int x,int y){ int r1 = find(x); int r2 = find(y); if( r1 < r2) mark[r2] = r1; else if( r2 < r1) mark[r1] = r2;}bool cmp(Node x, Node y){ return x.weight < y.weight;}int main(){ int n,m; while(scanf("%d",&n) != EOF) { for( int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf("%d", &pic[i][j]); } } int k = 0; for ( int i = 1; i <= n; i++) { for ( int j = i+1; j <= n; j++) { node[k].x = i; node[k].y = j; node[k].weight = pic[i][j]; k++; } } for( int i = 1; i <= n; i++) mark[i] = i; scanf("%d",&m); for( int i = 0; i < m; i++) { int a,b; scanf("%d%d", &a, &b); join(a,b); } sort( node, node+k, cmp); long long ans = 0; for( int i = 0; i < k; i++) { if( find(node[i].x) != find(node[i].y)) { join( node[i].x,node[i].y ); ans += node[i].weight; } } printf("%lld\n",ans); } return 0;}
- hdu hdu 1102 Constructing Roads(最小生成树Kruskal)
- HDU 1102 Constructing Roads 最小生成树-Kruskal算法
- 【最小生成树 kruskal】 hdu 1102 Constructing Roads
- hdu 1102 Constructing Roads 最小生成树Kruskal
- hdu-1102-Constructing Roads-最小生成树,Kruskal算法
- HDU 1102 Constructing Roads(最小生成树 Kruskal算法)
- HDU 1102 Constructing Roads (最小生成树,kruskal)
- HDU 1102 Constructing Roads(Kruskal最小生成树求最小花费)
- hdu 1102 Constructing Roads 最小生成树
- Constructing Roads - HDU 1102 最小生成树
- hdu 1102 Constructing Roads 最小生成树
- Constructing Roads(HDU 1102 最小生成树)
- hdu 1102 Constructing Roads 最小生成树
- HDU 1102 Constructing Roads 最小生成树
- Hdu 1102 Constructing Roads【最小生成树】
- hdu 1102 Constructing Roads(最小生成树)
- hdu 1102 Constructing Roads (最小生成树)
- HDU 1102 Constructing Roads【最小生成树】
- 报错java.lang.Long cannot be cast to java.lang.Integer
- 技术文章 | 从 Apache RocketMQ 和 Kafka 看 Topic 数量对单机性能的影响
- 编译mono5.3的步骤和坑
- chrome flash player
- mybatis多表(一对多关联查询)
- HDU 1102 Constructing Roads (最小生成树,kruskal)
- 如果您有兴趣 请联系我
- 使用Burp Suite进行XSS渗透测试 (只为自己做个备忘,甚读)
- 基于MapReduce框架的PageRank算法实现
- mybatis多表(多对一查询操作)
- 浅谈sql优化
- java NIO详解
- js 重置滚动条到顶部
- Windows下Appium环境搭建(java版)