poj 1258 Agri-Net(Prim)(基础)
2015-07-20 20:27
387 查看
Agri-Net
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.
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
Sample Output
题意:
有n个农场,已知这n个农场都互相相通,有一定的距离,现在每个农场需要装光纤,问怎么安装光纤能将所有农场都连通起来,并且要使光纤距离最小,输出安装光纤的总距离。
思路:
最小生成树,给出的二维矩阵代表他们的距离,prim算法求解即可。
代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 44487 | Accepted: 18173 |
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.
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
4 0 4 9 21 4 0 8 17 9 8 0 16 21 17 16 0
Sample Output
28
题意:
有n个农场,已知这n个农场都互相相通,有一定的距离,现在每个农场需要装光纤,问怎么安装光纤能将所有农场都连通起来,并且要使光纤距离最小,输出安装光纤的总距离。
思路:
最小生成树,给出的二维矩阵代表他们的距离,prim算法求解即可。
代码:
/* prim Memory 204K Time 16MS */ #include <iostream> #include<cstdio> using namespace std; #define MAXV 101 #define inf 1<<29 int map[MAXV][MAXV],n; void prim() { int i,j,dis[MAXV],vis[MAXV],mi,v; for(i=1;i<=n;i++) { dis[i]=map[1][i]; vis[i]=0; } for(i=1;i<=n;i++) { mi=inf; for(j=1;j<=n;j++) if(!vis[j] && dis[j]<mi) { mi=dis[j]; v=j; } vis[v]=1; for(j=1;j<=n;j++) if(!vis[j] && dis[j]>map[v][j]) dis[j]=map[v][j]; } int sum=0; for(i=1;i<=n;i++) sum+=dis[i]; printf("%d\n",sum); } int main() { int i,j; while(~scanf("%d",&n)) { for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&map[i][j]); prim(); } return 0; }
相关文章推荐
- 画风、设计、ARPG:如何做好下一款三消游戏?
- 剑指off-找到最小k个数字
- 东华软件面试题
- OC中字符串用法总结
- 在CentOS 7中Samba服务安装和配置
- 每天一个小知识点8(jQuer总结二)
- 常见的查找算法
- Codeforces Round #290 (Div. 2)D. Fox And Jumping
- 职业性格测验量表
- tornado autoreload 模式
- igrimace最新安装源 apt.so/igrimace3
- 一个分布式服务器集群架构方案
- Test for Job (poj 3249 记忆化搜索)
- hdu 1178 免费馅饼
- NOJ_1011 大数加法
- expdp数据库时报ora-39002错误问题的处理01
- fmdb
- jquery的each()详细介绍
- hd1501
- 黑马程序员--Objective-C语言基础知识--Foundation框架的常见用法