zoukankan      html  css  js  c++  java
  • P2212 [USACO14MAR]浇地Watering the Fields

    题目描述

    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(1 <= N <= 2000)块田送水。农田在一个二维平面上,第i块农田坐标为(xi, yi)(0 <= xi, yi <= 1000),在农田i和农田j自己铺设水管的费用是这两块农田的欧几里得距离(xi - xj)^2 + (yi - yj)^2。

    农民约翰希望所有的农田之间都能通水,而且希望花费最少的钱。但是安装工人拒绝安装费用小于C的水管(1 <= C <= 1,000,000)。

    请帮助农民约翰建立一个花费最小的灌溉网络。

    输入输出格式

    输入格式:

    • Line 1: The integers N and C.

    • Lines 2..1+N: Line i+1 contains the integers xi and yi.

    输出格式:

    • Line 1: The minimum cost of a network of pipes connecting the

    fields, or -1 if no such network can be built.

    输入输出样例

    输入样例#1:
    3 11
    0 2
    5 0
    4 3
    输出样例#1:
    46

    说明

    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.

    OUTPUT 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.

    Source: USACO 2014 March Contest, Silver

    kruskal 模板 然后我也不知道怎么去重的。。

    #include <algorithm>
    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    #define maxn 1000010
    using namespace std;
    int n,c,x[maxn],y[maxn],ans,fa[maxn],cnt,tot;
    struct Edge{
        int x,y,dis;
    }edge[maxn*4];
    int find(int x){ return x==fa[x]?x:fa[x]=find(fa[x]); }
    bool cmp(Edge a,Edge b) { return a.dis<b.dis; }
    int main()
    {
        scanf("%d%d",&n,&c);
        for(int i=1;i<=n;i++) fa[i]=i;
        for(int i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
        for(int i=1;i<=n;i++)
            for(int j=i+1;j<=n;j++)
            {
                edge[++cnt].x=i;
                edge[cnt].y=j;
                edge[cnt].dis=pow(x[i]-x[j],2)+pow(y[i]-y[j],2);
            }
        sort(edge+1,edge+cnt+1,cmp);
        for(int i=1;i<=cnt;i++)
        {
            int fx=find(edge[i].x),fy=find(edge[i].y);
            if(fx!=fy&&edge[i].dis>=c)
            {
                fa[fx]=fy;
                ans+=edge[i].dis;
                tot++;
                if(tot==n-1) break;
            }
        }
        if(tot<n-1) printf("-1
    ");
        else printf("%d",ans);
        return 0;
    }
  • 相关阅读:
    微信开发:微信js_sdk分享,使用场景,网页在微信app内部分享时的标题与描述,包括logo设置(一)
    云服务最开始的初始密码与远程连接密码?
    阿里云域名的ssl证书申请与腾讯服务器域名的证书安装
    关于 https的SNI问题
    关于网页授权access_token和普通access_token的区别
    转载:敏捷开发框架的优势
    select自定义下拉三角符号,css样式小细节
    关于ffmpeg /iis 8.5 服务器下,视频截取第一帧参数配置
    C# WebAPI中使用Swagger
    面向对象编程思想(OOP)
  • 原文地址:https://www.cnblogs.com/chen74123/p/6936124.html
Copyright © 2011-2022 走看看