POJ 1258 Agri-Net
来源:互联网 发布:安卓chroot运行linux 编辑:程序博客网 时间:2024/06/07 02:24
kruscal
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35233 Accepted: 14160
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
[Submit] [Go Back] [Status] [Discuss]
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int fa[200],n,m;struct Edge{ int u,v,w;}edge[20000];bool cmp(Edge a,Edge b){ return a.w<b.w;}int getfa(int x){ if(x==fa[x]) return x; return fa[x]=getfa(fa[x]);}int kruscal(){ sort(edge,edge+m,cmp); int cnt=n,ans=0; for(int i=0;i<n;i++) fa[i]=i; for(int i=0;i<m;i++) { int fA=getfa(edge[i].u); int fB=getfa(edge[i].v); if(fA==fB) continue; fa[fA]=fB; ans+=edge[i].w; cnt--; if(cnt==1) break; } if(cnt==1) return ans; else return 0x3f3f3f3f;}int main(){while(scanf("%d",&n)!=EOF){ m=0; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { int p; scanf("%d",&p); if(i==j) continue; edge[m++]=(Edge){i,j,p}; } } printf("%d\n",kruscal());} 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
- ios适配
- Android获取view在屏幕中的位置
- 月末外币评估
- 成绩转换
- ADO.NET、JDBC连接Sql Server2008简单实例
- POJ 1258 Agri-Net
- iOS 7 动画UIDynamicAnimator
- 斗地主游戏AI出牌
- unset不能return 因为返回的是void
- 使用autoconf对项目自动生成makefile
- 关于iframe子页面修改其父页面CSS样式
- 7.注解式控制器简介
- ios UIWebView加载https出现 load page error:Error Domain=NSURLErrorDomain Code=-1202 "此服务器的证书无效
- ASPxComoBox的联想输入功能