poj2421 最小生成树 克鲁斯
来源:互联网 发布:sama图软件 编辑:程序博客网 时间:2024/06/06 03:18
Constructing Roads
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18744 Accepted: 7755
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.
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.
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
30 990 692990 0 179692 179 011 2
#include<iostream>using namespace std;int a[101][101],n,father[101],m,x,y;int get_father(int p){ return father[p]=(father[p]==p? p:get_father(father[p]));}int main(){cin>>n;for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>a[i][j];for(int i=0;i<n;i++)father[i]=i;cin>>m;for(int i=0;i<m;i++){cin>>x>>y;father[get_father(x-1)]=get_father(y-1);}int sum=0;for(int k=1;k<=1000;k++) for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(a[i][j]==k&&get_father(i)!=get_father(j)){ sum+=a[i][j]; father[father[i]]=father[j]; }cout<<sum<<endl;return 0;}
0 0
- poj2421 最小生成树 克鲁斯
- POJ2421 最小生成树/MST(prim)
- POJ2421 Constructing Roads [最小生成树 prim]
- POJ2421 prim算法求最小生成树
- 最小生成树(Kruskal算法)--poj2421
- [POJ2421]最小生成树+PRIM+KRUSKAL
- poj2421 Constructing Roads【最小生成树】
- POJ2421 Constructing Roads(最小生成树)
- POJ2421——最小生成树复习
- POJ2421 Constructing Roads(最小生成树,Prim)
- 最小生成树 克鲁斯卡尔算法
- 最小生成树(克鲁斯卡尔方法)
- 克鲁斯克尔最小生成树
- 最小生成树--克鲁斯卡尔算法
- 克鲁斯卡尔-最小生成树
- 克鲁斯卡尔求最小生成树
- 克鲁斯卡尔[最小生成树集锦]
- 克鲁斯卡尔最小生成树算法
- 测试用例参考示范
- java并发编程之——CountDownLatch和CyclicBarrier的使用
- ConcurrentHashMap的关键部分解析
- 网页建站的路径问题
- 献给和我同样学习前端脚本时,先学jQuery,而之前没有接触过JS的同学
- poj2421 最小生成树 克鲁斯
- 存储过程几个例子
- CALayer之anchorPoint分析
- 电脑做网站服务器之本地网络分析及应对方法
- java排列组合算法
- OC语言自学《十二》---- OC(block、@property)
- C++ Primer 3.2.2
- vcastr 引用代码
- this指针