BZOJ 3479: [Usaco2014 Mar]Watering the Fields( MST )
2015-06-04 19:32
435 查看
MST...一开始没注意-1结果就WA了...
----------------------------------------------------------------------------
#include<cstdio>#include<cstring>#include<vector>#include<cmath>#include<algorithm>#include<iostream> #define rep( i , n ) for( int i = 0 ; i < n ; ++i )#define clr( x , c ) memset( x ,c , sizeof( x ) ) using namespace std; typedef long long ll; const int maxn = 2000 + 5; struct edge { int u , v , d; bool operator < (const edge &e ) const { return d < e.d; }}; vector< edge > E;int n; struct Point { int x , y; void Read() { scanf( "%d%d" , &x , &y ); } }; Point coor[ maxn ]; int dist( Point a , Point b ) { return ( a.x - b.x ) * ( a.x - b.x ) + ( a.y - b.y ) * ( a.y - b.y ); } void add_edge( int u , int v , int d ) { E.push_back( ( edge ) { u , v , d } ); } int p[ maxn ]; int find( int x ) { return x == p[ x ] ? x : p[ x ] = find( p[ x ] );} ll kruskal() { ll ans = 0; rep( i , n ) p[ i ] = i; sort( E.begin() , E.end() ); rep( i , E.size() ) { edge &e = E[ i ]; int a = find( e.u ) , b = find( e.v ); if( a != b ) p[ a ] = b , ans += e.d; } rep( i , n ) for( int j = i + 1 ; j < n ; ++j ) if( find( i ) != find( j ) ) ans = -1; return ans; } void init() { E.clear();} int main() { init(); int c; cin >> n >> c; rep( i , n ) coor[ i ].Read(); rep( i , n ) for( int j = i + 1 ; j < n ; ++j ) { int d = dist( coor[ i ] , coor[ j ] ); if( d >= c ) add_edge( i , j , d ); } cout << kruskal() << "\n"; return 0;}
----------------------------------------------------------------------------
3479: [Usaco2014 Mar]Watering the Fields
Time Limit: 10 Sec Memory Limit: 128 MBSubmit: 163 Solved: 92
[Submit][Status][Discuss]
Description
Due to a lack of rain, Farmer John wants to build an irrigation system to send water between his N fields (1 <= N <= 2000). Each field i is described by a distinct point (xi, yi) in the 2D plane, with 0 <= xi, yi <= 1000. The cost of building a water pipe between two fields i and j is equal to the squared Euclidean distance between them: (xi - xj)^2 + (yi - yj)^2 FJ would like to build a minimum-cost system of pipes so that all of his fields are linked together -- so that water in any field can follow a sequence of pipes to reach any other field. Unfortunately, the contractor who is helping FJ install his irrigation system refuses to install any pipe unless its cost (squared Euclidean length) is at least C (1 <= C <= 1,000,000). Please help FJ compute the minimum amount he will need pay to connect all his fields with a network of pipes.草坪上有N个水龙头,位于(xi,yi)
求将n个水龙头连通的最小费用。 任意两个水龙头可以修剪水管,费用为欧几里得距离的平方。 修水管的人只愿意修费用大于等于c的水管。
Input
* Line 1: The integers N and C.* Lines 2..1+N: Line i+1 contains the integers xi and yi.
Output
* Line 1: The minimum cost of a network of pipes connecting the fields, or -1 if no such network can be built.Sample Input
3 110 2
5 0
4 3
INPUT DETAILS: There are 3 fields, at locations (0,2), (5,0), and (4,3). The contractor will only install pipes of cost at least 11.
Sample Output
46OUTPUT DETAILS: FJ cannot build a pipe between the fields at (4,3) and (5,0), since its cost would be only 10. He therefore builds a pipe between (0,2) and (5,0) at cost 29, and a pipe between (0,2) and (4,3) at cost 17.
HINT
Source
Silver 译文By Hta相关文章推荐
- (10.3.4)如何写出好的PRD
- 论文写不下去了怎么办?
- zoj 3229 上下界网络最大可行流带输出方案
- 团队工作总结及自评 & 补上来的用户调研
- 去除Ubuntu文件夹有锁标志
- java实现接口与继承类的区别
- unity 根据纪元时间(1970/1/1)转换为DateTime
- POJ 3687 逆序拓扑
- 浅谈UitextField值变化的实时监视
- 随笔2
- 深入理解java多态性
- 多线程之GCD的使用
- 网站布局CSS技巧
- IIS之301永久重定向配置
- ActiveMQ5.10.2版本配置JMX
- 给定一个十进制的正整数,写下从1开始,到N的所有整数,然后数一下其中出现“1”的个数。
- 第十二周项目3-点,圆的关系
- 嵌入式开发环境搭建
- (2)列表
- 研究生学术创新的五个阶梯