当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2421: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.
输入解释
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.
输出解释
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.
输入样例
3
0 990 692
990 0 179
692 179 0
1
1 2
输出样例
179

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 PKU Monthly,kicc

源链接: POJ-2421

最后修改于 2020-10-29T06:32:01+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000 65536