POJ1258 Agri-Net
来源:互联网 发布:初一数学教学软件 编辑:程序博客网 时间:2024/06/06 17:28
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56948 Accepted: 23615
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
——————————————————————————————————————
给出n个城市两两之间的花费,求让所有城市联通的最小花费
思路:最小生成树
#include <iostream>#include<queue>#include<cstdio>#include<algorithm>#include<cmath>#include<set>using namespace std;#define LL long longstruct node{ int u,v,w;} p[1000005];int n,cnt,pre[1005];bool cmp(node a,node b){ return a.w<b.w;}void init(){ for(int i=0; i<1005; i++) pre[i]=i;}int fin(int x){ return pre[x]==x?x:pre[x]=fin(pre[x]);}void kruskal(){ sort(p,p+cnt,cmp); init(); int cost=0; int ans=0; for(int i=0; i<cnt; i++) { int a=fin(p[i].u); int b=fin(p[i].v); if(a!=b) { pre[a]=b; cost+=p[i].w; ans++; } if(ans==n-1) { break; } } printf("%d\n",cost);}int main(){ int mp[105][105],k,x,y; while(~scanf("%d",&n)&&n) { for(int i=0; i<n; i++) for(int j=0; j<n; j++) scanf("%d",&mp[i][j]); cnt=0; for(int i=0; i<n; i++) for(int j=i+1; j<n; j++) { p[cnt].u=i,p[cnt].v=j; p[cnt++].w=mp[i][j]; } kruskal(); } 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
- Android自定义标签
- 润乾V4 更换Tomcat引起的报表展现错误
- Mock和injectMocks的区别
- POJ 3624 Charm Bracelet(01背包)
- 从Visual Studio看微软20年技术变迁
- POJ1258 Agri-Net
- 1007. 素数对猜想 (20)
- MVC 设计模式
- 3.5(接口,结构,泛型委托和泛型约束,多线程的调用与挂起)
- 搭建python3.6+Selenium
- BZOJ1058-SplayTree
- AngularJS 添加Click事件
- PAT_1029. Median
- nyoj737 石子合并(一)(区间dp)