【POJ2421】【最小生成树水题】【prim】
2015-08-26 10:03
411 查看
Language: Default Constructing Roads
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 PKU Monthly,kicc |
[Discuss]
#include <iostream> #include <cstring> #include <cmath> #include <queue> #include <stack> #include <list> #include <map> #include <set> #include <string> #include <cstdlib> #include <cstdio> #include <algorithm> using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++) #define per(i,a,n) for (int i=n-1;i>=a;i--) #define mp push_back int n,m; int g[110][110]; bool in[110]; int main() { while(scanf("%d",&n)!=EOF) { memset(in,0,sizeof(in)); int ret = 0; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { scanf("%d",&g[i][j]); } } scanf("%d",&m); for(int i=0;i<m;i++) { int u,v; scanf("%d%d",&u,&v); g[u][v] = 0; g[v][u] = 0; } in[1] = true; for(int i=0;i<n-1;i++) { int mins = 0x3f3f3f3f; int p = -1; for(int j=1;j<=n;j++) { for(int k=1;k<=n;k++) { if(in[j] && !in[k]) { if(g[j][k] < mins) { mins = g[j][k]; p = k; } } } } in[p] = true; ret += mins; } printf("%d\n",ret); } return 0; }
相关文章推荐
- 经典算法研究系列:九、图像特征提取与匹配之SIFT算法
- WINDOWS 内存管理笔记
- sql server和mysql server sql语句对比
- App各种Icon及Launch image的尺寸和用途
- JavaScript [ 转 ] —— 面向对象编程(一):封装
- SNMP学习之结构体snmp_secmod_def
- 简介alert()与console.log()的不同
- Android—压缩图片,减少内存
- ubuntu下禁掉IPV6方案
- 数据绑定(Binding)
- 经典算法研究系列:八、再谈启发式搜索算法
- Hadoop Shuffle
- bootstrap div 弹出与关闭
- System类
- 数据绑定(Binding)
- C++的深拷贝与浅拷贝
- A session had already been started - ignoring session_start() 解决方法
- sqlite的update遇到的问题
- AndroidStudio 1.3使用心得
- 分分钟教你使用Git Hub管理代码。