POJ 2421 Constructing Roads 最小生成树
来源:互联网 发布:360所有软件都有啥 编辑:程序博客网 时间:2024/05/21 17:43
就是一道最小生成树的题目,说xx到xx的路以修好,令其权值为0就可以了。
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
#include <iostream>#include <algorithm>using namespace std;const int S=105;struct node{ int x,y,n;}e[S*S];int f[S*S],g[S][S];inline bool cmp(const node&a, const node&b){ return (a.n<b.n);}int getfather(int k){ if (f[k]==k) return k; else { int tmp=getfather(f[k]); f[k]=tmp; return tmp; }}int main(){ int i,j,k,n,size,x,y,sum=0; cin>>n; for (i=0;i<n*n;i++) f[i]=i; for (i=0;i<n;i++) for (j=0;j<n;j++) cin>>g[i][j]; cin>>k; for (i=0;i<k;i++){ cin>>x>>y; x--;y--; g[x][y]=0;g[y][x]=0; } for (i=0,k=0;i<n;i++) for (j=0;j<n;j++,k++){ e[k].x=i,e[k].y=j,e[k].n=g[i][j]; } sort(e,e+n*n,cmp); // for (i=0;i<n*n;i++) cout<<e[i].x<<" , "<<e[i].y<<" is "<<e[i].n<<endl; for (k=0,i=0;k<n-1;i++){ x=getfather(e[i].x),y=getfather(e[i].y); if (x!=y) {f[x]=y;sum+=e[i].n;k++;} } cout<<sum<<endl; return 0;}
- POJ 2421 Constructing Roads(最小生成树)
- POJ 2421 Constructing Roads 最小生成树
- POJ 2421 Constructing Roads 最小生成树
- POJ 2421 Constructing Roads 最小生成树
- POJ--2421--Constructing Roads【最小生成树】
- POJ 2421 -Constructing Roads -最小生成树
- 【最小生成树】POJ 2421 Constructing Roads
- POJ 2421 Constructing Roads 最小生成树
- Constructing Roads 【poj-2421】【最小生成树】
- POJ-2421 Constructing Roads (最小生成树)
- poj 2421 Constructing Roads prim最小生成树 基础!!!
- POJ-2421(最小生成树模版)(Constructing Roads )
- Poj 2421 Constructing Roads(Prim 最小生成树)
- POJ 2421 Constructing Roads(简单最小生成树)
- poj 2421 Constructing Roads 并查集+最小生成树
- poj-2421 Constructing Roads(最小生成树 Kruskal算法)
- poj 2421 Constructing Roads(最小生成树 kruskal算法)
- poj 2421 Constructing Roads(最小生成树))
- Python IDLE快捷键
- PC中可重入函数
- ARM TRUSTZONE 续
- Excel绝对引用 指定值不变
- SQLite优化方法
- POJ 2421 Constructing Roads 最小生成树
- php中提示Undefined index的解决方法
- 关于sqlite
- Android文件操作总结
- C/C++程序员必须熟练应用的开源项目
- 一张表多条件查询( 续--简洁)
- 类图及类图中的关系
- libxml主要函数说明
- Android消息推送