poj-1258
来源:互联网 发布:全国安全知识网络竞赛 编辑:程序博客网 时间:2024/06/07 12:09
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 51772 Accepted: 21595
Description
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Input
The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.
Output
For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.
Sample Input
40 4 9 214 0 8 179 8 0 1621 17 16 0
Sample Output
28
Source
USACO 102
题意 主要还是最小生成树 正题
4 4个村庄
0 4 9 21 1->1的距离是0 1->2的距离是4、 1->3的距离是9、 1->4的距离是21
4 0 8 17
9 8 0 16
21 17 16 0
求各个山村相连的路径和,和要最小
#include<cstdio>#include<string.h>#define inf 0x3f3f3f3fint map[110][110];int vis[120];int dis[120];void prim(int n){int ans=0;for(int i=0;i<120;++i)dis[i]=inf;memset(vis,0,sizeof(vis));dis[0]=0;for(int i=0;i<n;++i){int k=-1,tp=inf;for(int j=0;j<n;++j){if(!vis[j]&&dis[j]<tp){k=j;tp=dis[j];}}vis[k]=1;ans+=dis[k];for(int j=0;j<n;++j){if(!vis[j]&&map[k][j]<dis[j]){dis[j]=map[k][j];}}}printf("%d\n",ans);}int main(){int n;while(scanf("%d",&n)!=EOF){int i,j;memset(map,inf,sizeof(map));for(i=0;i<n;++i){for(j=0;j<n;++j){scanf("%d",&map[i][j]);if(i==j)map[i][j]=inf;}}prim(n);}}
0 0
- Poj 1258
- poj 1258
- POJ 1258
- poj 1258
- POJ 1258
- POJ 1258
- poj 1258
- poj 1258
- poj 1258
- POJ 1258
- poj 1258
- poj 1258
- poj 1258
- POJ 1258
- POJ 1258
- POJ 1258
- POJ 1258
- POJ - 1258
- MKNetworkKit
- yii场景
- 数学期望,I - Beating the Dataset,Light OJ 1274
- ZooKeeper伸缩性
- 算法分析基础
- poj-1258
- 内存与编程小记
- 合唱队
- HashMap实现原理分析
- red hat linux命令行修改IP
- 怎样防止头文件被重复包含?(两种方式)以及它的影响
- 为个么,每一个明年,都是OLED大发展的年份
- LeakCanary 中文使用说明
- eclipse中输入中文为繁体