POJ 2377 Bad Cowtractors
来源:互联网 发布:手机数据接口类型 编辑:程序博客网 时间:2024/05/31 18:36
Bad Cowtractors
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10634 Accepted: 4504
Description
Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20,000) possible connection routes between pairs of barns. Each possible connection route has an associated cost C (1 <= C <= 100,000). Farmer John wants to spend the least amount on connecting the network; he doesn't even want to pay Bessie.
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.
Output
* Line 1: A single integer, containing the price of the most expensive tree connecting all the barns. If it is not possible to connect all the barns, output -1.
Sample Input
5 81 2 31 3 72 3 102 4 42 5 83 4 63 5 24 5 17
Sample Output
42
Hint
OUTPUT DETAILS:
The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.
The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.
Source
USACO 2004 December Silver
题意:farmer john 很吝啬,他雇了bessie不想给他钱,bessie就想让John花更多的工程钱,即使路变得最长。
思路:最大生成树。
#include <cstdio>#include <iostream>#include <algorithm>#include <cmath>#include <cstring>#include <stdlib.h>using namespace std;int n,m;int mp[1005][1005];int vis[1005];int low[1005];int prim(){ int pos,minx,res=0; memset(vis,0,sizeof(vis)); vis[1]=1; pos=1; for(int i=1;i<=n;i++){ if(pos!=i) low[i]=mp[1][i]; } for(int i=1;i<n;i++){ minx=0; for(int j=1;j<=n;j++){ if(!vis[j]&&minx<low[j]){ minx=low[j]; pos=j; } } if(minx==0) {res=-1; break;} res+=minx; vis[pos]=1; for(int j=1;j<=n;j++){ if(!vis[j]&&low[j]<mp[pos][j]) low[j]=mp[pos][j]; } } return res;}int main(){ scanf("%d%d",&n,&m); memset(mp,-1,sizeof(mp)); for(int i=0;i<m;i++){ int a,b,c; scanf("%d%d%d",&a,&b,&c); if(mp[a][b]<c) mp[a][b]=mp[b][a]=c; } printf("%d\n",prim());}
0 0
- poj 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- POJ-2377-Bad Cowtractors
- POJ 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- Bad Cowtractors.(POJ-2377)
- poj 2377 Bad Cowtractors
- POJ 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- 【POJ 2377 Bad Cowtractors】
- POJ 2377 Bad Cowtractors
- poj 2377 Bad Cowtractors
- poj 2377Bad Cowtractors
- 设计模式——抽象工厂模式(Abstract Factory)
- 嘿嘿
- 相对论对常识相对速度的颠覆
- opencv 2.4.9 VideoCapture不能读取视频文件【补充】
- Design Pattern Prototype 原型设计模式
- POJ 2377 Bad Cowtractors
- 进度小总结
- C++ 高性能无锁日志系统
- CF 454A(Little Pony and Crystal Mine-画图[水])
- 社会化营销
- Android常用布局文件中元素的属性
- CF 259
- 华为机试题
- vs2010编译boost sgd版本的datetime库例子