(寒假集训)Watering the Fields (最小生成树)
Watering the Fields
时间限制: 1 Sec 内存限制: 64 MB
提交: 26 解决: 10
[提交][状态][讨论版]
题目描述
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.
输入
* Lines 2..1+N: Line i+1 contains the integers xi and yi.
输出
样例输入
3 11
0 2
5 0
4 3
样例输出
46
提示
There are 3 fields, at locations (0,2), (5,0), and (4,3). The contractor will only install pipes of cost at least 11.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.
【分析】最小生成树(裸)。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#define inf 0x3f3f3f3f
#define met(a,b) memset(a,b,sizeof a)
#define pb push_back
typedef long long ll;
using namespace std;
const int N = 4e3;
const int M = ;
int n,m,k,edg[N][N],lowcost[N],pre[N];
void Prim() {
for(int i=;i<=n;i++){
lowcost[i]=edg[][i];
}
lowcost[]=-;
int sum=;
for(int i=;i<n;i++){
int minn=;
for(int j=;j<=n;j++){
if(lowcost[j]!=-&&lowcost[j]<minn){
minn=lowcost[j];
k=j;
}
}
if(minn>=){
puts("-1");
return;
}
sum+=minn;
lowcost[k]=-;
for(int j=;j<=n;j++){
if(edg[j][k]<lowcost[j]){
lowcost[j]=edg[j][k];
}
}
}
printf("%d\n",sum);
}
int main()
{
for(int i=;i<N;i++)for(int j=;j<N;j++)edg[i][j]=;
int u,v,x[N],y[N];
scanf("%d%d",&n,&m);
for(int i=;i<=n;i++){
scanf("%d%d",&x[i],&y[i]);
}
for(int i=;i<=n;i++){
for(int j=i+;j<=n;j++){
int s=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
if(s>=m)edg[i][j]=edg[j][i]=s;
}
}
Prim();
return ;
}
最新文章
- 字节b换算kb/mb/gb/tb/pb
- HTML5 之Canvas绘制太阳系
- 烟草公司基于BPM的IT一体化变革
- IOS照片框架
- 比较HTML元素和Native组件的区别
- if转换switch的小技巧
- 在spring中获取代理对象代理的目标对象工具类
- Effective C++第三遍
- uml中定义的关系详细详解
- ubuntu 设置IP,设置网关
- C++中的dll
- 云优化的概念、Entity Framework 7.0、简单吞吐量压力测试
- 如何一步一步用DDD设计一个电商网站(十三)—— 领域事件扩展
- Appium python自动化测试系列之Android UIAutomator终极定位(七)
- echo 0000
- Socket网络编程基本介绍
- 再次提供一个纯粹通过pl/sql解析json的方法。
- Eclipse导入war包二次开发
- window系统下远程部署Tomcat
- Python2 - 基础2 - 数据类型和模块