poj 1258 Agri-Net 最经典的MST★
来源:互联网 发布:矩阵乘法 matlab 编辑:程序博客网 时间:2024/05/19 17:58
Language:
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 60933 Accepted: 25256
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
Source
USACO 102
#include<stdio.h>#include<string.h>#define inf 0x3f3f3f3fusing namespace std;int a[1003][1003];int dis[10003];int vis[10003];int n,res;void prime(){ res=0; memset(vis,0,sizeof(vis)); for(int i=1;i<=n;i++) dis[i]=inf; dis[1]=0; int k=0; for(int i=1;i<=n;i++) { int tmp=inf; k=0; for(int j=1;j<=n;j++) { if(!vis[j]&&dis[j]<tmp) tmp=dis[j],k=j; } if(tmp==inf) return; vis[k]=1; res+=tmp; //printf("%d\n",tmp); for(int j=1;j<=n;j++) if(!vis[j]&&dis[j]>a[k][j]) dis[j]=a[k][j]; }}int main(){ while(~scanf("%d",&n)) { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { scanf("%d",&a[i][j]); } } prime(); printf("%d\n",res); }}
阅读全文
0 0
- poj 1258 Agri-Net 最经典的MST★
- POJ 1258 Agri-Net (经典MST)
- poj 1258 Agri-Net MST
- POJ 1258 Agri-Net(MST)
- [MST]POJ 1258Agri-Net
- POJ 1258 Agri-Net【MST】
- POJ 1258 Agri-Net MST .
- POJ 1258 Agri-Net (MST)
- POJ 1258 Agri-Net 【MST,Prime算法】
- POJ 1258 Agri-Net|| POJ 2485 Highways MST
- Poj 1258 Agri-Net[MST最小生成树]
- POJ 1258 Agri-Net (prim求MST)
- POJ-1258 Agri-Net 最小生成树(MST)
- Agri-Net (poj 1258 最短路+prim)
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- POJ 1258 Agri-Net
- poj 1258-Agri-net
- POJ
- RxJava
- 秒杀系统高并发优化
- Codeforces 745C Hongcow Builds A Nation
- 堆和栈的区别
- poj 1258 Agri-Net 最经典的MST★
- join,left join,right join
- 给tabBar设置图片和字体颜色 navigationBar设置字体大小 颜色
- 基于Selector+Channel+线程池的server & client
- GCC编译器中的-I -L -l 选项。
- C++: *max_element函数和*min_element函数
- 设置tomcat的默认项目名称(默认应用)、端口号,访问连接(url)不需要输入项目名称、端口
- USACO Section 1.3 Mixing Milk
- SpringMVC学习(1)