POJ1258 Agri-Net
来源:互联网 发布:2016大型网络赛车游戏 编辑:程序博客网 时间:2024/06/08 04:13
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48633 Accepted: 20146
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
题目:这就是一道裸的Prim的题:
代码如下:
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#define MAXN 500using namespace std;int n,sum;int dis[MAXN][MAXN];int cost[MAXN];bool vis[MAXN];void Prim(int start){ memset(vis,0,sizeof(vis)); for(int i=1;i<=n;i++) cost[i]=dis[start][i]; sum=0; vis[start]=true; for(int i=2;i<=n;i++) { int nm=0x3f3f3f,k; for(int j=1;j<=n;j++) { if(!vis[j] && cost[j]<nm) { nm=cost[j]; k=j; } } vis[k]=true; sum+=nm; for(int j=1;j<=n;j++) { if(!vis[j] && cost[j]>dis[k][j]) { cost[j]=dis[k][j]; } } }}int main(){ memset(dis,0x3f3f3f,sizeof(dis)); while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) scanf("%d",&dis[i][j]); } Prim(1); printf("%d\n",sum); } return 0;}
0 0
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- Agri-Net(POJ1258)
- poj1258 - Agri-Net
- POJ1258--Agri-Net--Kruskal
- poj1258 Agri-Net
- POJ1258 &&TOJ3197 Agri-Net
- poj1258 Agri-Net
- poj1258 Agri-Net
- poj1258--Agri-Net
- POJ1258-Agri-Net-ACM
- poj1258 Agri-Net(Prim)
- POJ1258 - Agri-Net
- POJ1258 Agri-Net【Prim】
- POJ1258 Agri-Net
- POJ1258 Agri-Net
- [023]中文分词——ansj
- 裴波那切数列求和---c++
- [Unity官方文档翻译]2D or 3D Projects Unity中2D和3D项目的区别
- leetcode 5. Longest Palindromic Substring
- 各种排序算法汇总详解
- POJ1258 Agri-Net
- 【LeetCode】24. Swap Nodes in Pairs
- Centos系统下Lamp环境的搭建
- HDU - 1022
- Linux C++ 服务器端这条线怎么走?
- 莫比乌斯反演之初探(1)
- Gym 100917J Judgement(dp+bitset)
- 添加项目到SVN
- Git基本使用