Agri-Net 1258
来源:互联网 发布:php 判断是微信浏览器 编辑:程序博客网 时间:2024/06/14 00:12
Agri-Net
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 8 Accepted Submission(s) : 4
Problem 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#include<stdio.h>#include<string.h>#include<math.h>#define mx 0x3f3f3f3fint g[110][110],vis[110],dis[110];int n;void prim(){int v,i,j,k,min,sum=0;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++){dis[i]=g[1][i];}dis[1]=0;vis[1]=1;for(v=1;v<n;v++){min=mx;k=1;for(i=1;i<=n;i++){if(!vis[i]&&dis[i]<min){min=dis[i];k=i;}}sum+=min;vis[k]=1;for(i=1;i<=n;i++){if(!vis[i]&&dis[i]>g[k][i]){dis[i]=g[k][i];}}}printf("%d\n",sum);}int main(){int i,j;while(scanf("%d",&n)!=EOF){for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&g[i][j]);}prim();}return 0;}
0 0
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- poj 1258-Agri-net
- poj 1258 Agri-Net
- poj 1258 Agri-Net
- POJ+1258++Agri-Net
- Poj 1258 Agri-Net
- poj 1258 Agri-Net
- poj 1258 Agri-Net
- poj 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- poj-1258-Agri-Net
- poj-1258 Agri-Net
- Poj 1258 Agri-Net
- POJ 1258 - Agri-Net
- 存贮beatbox
- 链式队列的C++实现
- CMAKE的使用
- 如何修改MFC界面风格
- 【bzoj2083】 POI2010Intelligence test 乱搞
- Agri-Net 1258
- 【bzoj1003】【ZJOI2006】【物流运输】【dp+最短路】
- SQLServer 可更新订阅数据在线架构更改(增加字段)方案
- 利用存储过程动态创建表格
- lucene分词器分词demo
- caffe学习笔记4-caffe安装需要注意的libraries
- 【大运维之四】运维标准化文档的四项基本原则
- 取出字符串中间以#隔开的内容
- 使用gson-2.2.4.jar来处理json数据