poj 1258 Agri-Net
2015-07-30 21:38
323 查看
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
#include <iostream>
#include <cstdio>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace std;
int Map[110][110];
int eveco[110];
bool vis[110];
int n;
int Prim()
{
memset(vis,false,sizeof(vis));
int cost = 0;
for(int i=1;i<=n;i++)
eveco[i] = Map[1][i];
eveco[1] = 0;
vis[1] = true;
for(int i=1;i<n;i++)
{
int pos;
int m = INF;
for(int j=1;j<=n;j++)
{
if(!vis[j] && eveco[j] < m)
{
m = eveco[j];
pos = j;
}
}
cost += m;
vis[pos] = true;
for(int j=1;j<=n;j++)
{
if(!vis[j] && eveco[j] > Map[pos][j])
eveco[j] = Map[pos][j];
}
}
return cost;
}
int main()
{
while(cin>>n)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>Map[i][j];
}
}
cout<<Prim()<<endl;
}
return 0;
}
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
#include <iostream>
#include <cstdio>
#include <cstring>
#define INF 0x3f3f3f3f
using namespace std;
int Map[110][110];
int eveco[110];
bool vis[110];
int n;
int Prim()
{
memset(vis,false,sizeof(vis));
int cost = 0;
for(int i=1;i<=n;i++)
eveco[i] = Map[1][i];
eveco[1] = 0;
vis[1] = true;
for(int i=1;i<n;i++)
{
int pos;
int m = INF;
for(int j=1;j<=n;j++)
{
if(!vis[j] && eveco[j] < m)
{
m = eveco[j];
pos = j;
}
}
cost += m;
vis[pos] = true;
for(int j=1;j<=n;j++)
{
if(!vis[j] && eveco[j] > Map[pos][j])
eveco[j] = Map[pos][j];
}
}
return cost;
}
int main()
{
while(cin>>n)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>Map[i][j];
}
}
cout<<Prim()<<endl;
}
return 0;
}
相关文章推荐
- c++中的vector容器
- Android 当Service遇到Handler
- Linux_历史
- Observer模式
- js 构造函数
- 在云计算时代,如何监控云服务的 SLA ?
- 前端框架从头开始-浏览器的判定
- 来谈谈网络安全,关于Session冒名顶替和cookie防篡改的问题
- NYOJ 745 蚂蚁的难题(二)
- 嵌入式软件开发——CVTE 面试+笔试题
- [leetcode-43]Multiply Strings(java)
- Android中xml中shape的属性助记
- Linux或者Windows系统中鼠标点击偶尔无反应?
- IOS计划 分析
- 操作系统相关
- Oracle oerr使用
- 暑假集训第三周周三赛 STL D - 产生冠军
- 我的C语言入门到精通之路 day03
- 同步和异步的区别
- Linux 内核的同步机制