POJ - 2421 Constructing Roads(最小生成树&并查集
2024-10-07 03:21:05
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;
int ans=,tot=;int f[],a[][];
const int N = 1e5;
struct ac{
int v,u,w;
}edge[N];
bool cmp(ac a,ac b){
return a.w<b.w;
}
inline int find(int x){
if(x!=f[x])f[x]=find(f[x]);return f[x];
}
inline int join(int x,int y,int w){
int fx=find(x),fy=find(y);
if(fx!=fy){
f[fx]=fy;ans+=w;tot++;
}
}
int main()
{
int n;int m,w,cnt=,u,v;
cin>>n;
for(int i = ;i <= n;++i)f[i]=i;
for(int i = ;i <= n;++i){
for(int j = ;j <= n;++j)
{
cin>>a[i][j];
edge[cnt].u=i,edge[cnt].v=j,edge[cnt].w=a[i][j];
cnt++;
}
}
sort(edge,edge+cnt,cmp);
cin>>m;
while(m--){
cin>>u>>v;
join(u,v,);
}
for(int i = ;i < cnt;++i){
join(edge[i].u,edge[i].v,edge[i].w);
if(tot==n-)break;
}
cout<<ans<<endl;
return ;
}
最新文章
- WdatePicker 没有权限 不能执行已释放 Script 的代码
- 【转】 制作Android Demo GIF:程序演示效果GIF图录制
- 一天一个Java基础——通过异常处理错误
- .net 中常用的正则表达式整理
- springBoot系列教程01:elasticsearch的集成及使用
- nyoj 韩信点兵
- asp.net core 三 Nuget包管理
- Postman:传递的参数是List类型时 传参格式的写法
- Harbor---docker镜像仓库搭建
- cefsharp插入自定义JS
- MQ基本概念
- Linux中2>;&;1使用
- MyISAM和InnoDB区别 及选择
- 每日质量NPM包拖拽文件上传_react-dropzone
- Smarty标签运算,控制结构[if,for,foreach,section,while]
- 【数组】Missing Number
- Python3.5 学习五
- C语言若干知识点归记
- 查询数据库的所有列信息 sys.all_columns
- TensorFlow进阶(一)----张量的阶和数据类型