poj 1258 Agri-Net
来源:互联网 发布:用js写带框99乘法表 编辑:程序博客网 时间:2024/05/16 08:20
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49016 Accepted: 20337
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<algorithm>#include<math.h>#define INF 0x3f3f3f3f#define M 100+10int map[M][M],vis[M],low[M];int n;void init(){int i,j;for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(i==j)map[i][j]=0;elsemap[i][j]=INF;}}}int prim(){int i,j,min,sum=0,next;memset(vis,0,sizeof(vis));for(i=1;i<=n;i++){low[i]=map[1][i];}vis[1]=1;for(i=1;i<n;i++){next=1;min=INF;for(j=1;j<=n;j++){if(!vis[j]&&low[j]<min){min=low[j];next=j; }}vis[next]=1;sum+=min;for(j=1;j<=n;j++){if(!vis[j]&&low[j]>map[next][j]){low[j]=map[next][j];}}}return sum;}int main(){int i,j,c;while(scanf("%d",&n)!=EOF){init();for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&c);if(map[i][j]>c)map[i][j]=map[j][i]=c;}}printf("%d\n",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
- Android中的Serialable和Parcelable的区别
- Linux下C实现的聊天室
- 懒人爱家务_添加广告
- 绕任意轴旋转的矩阵推导
- 八皇后问题 DFS
- poj 1258 Agri-Net
- EditText hint带图片的提示
- Nginx Location配置总结
- LINQ To SQL 语法及实例大全
- 传递引用的特例
- Android官方开发文档Training系列课程中文版:调用相机之简单摄像
- 一个int数的二进制有多少个一
- 根据不同条件插入不同表SQL
- 实现点击图片的放大缩小