P2872 [USACO07DEC]Building Roads S

题目链接

题目描述

Farmer John had just acquired several new farms! He wants to connect the farms with roads so that he can travel from any farm to any other farm via a sequence of roads; roads already connect some of the farms.

Each of the N (1 ≤ N ≤ 1,000) farms (conveniently numbered 1..N) is represented by a position (Xi, Yi) on the plane (0 ≤ Xi ≤ 1,000,000; 0 ≤ Yi ≤ 1,000,000). Given the preexisting M roads (1 ≤ M ≤ 1,000) as pairs of connected farms, help Farmer John determine the smallest length of additional roads he must build to connect all his farms.

给定 n 个点的坐标，第 i 个点的坐标为(xi​,yi​)，这 n 个点编号为 1 到 n。给定 m 条边，第 i 条边连接第ui​ 个点和第 vi​ 个点。现在要求你添加一些边，并且能使得任意一点都可以连通其他所有点。求添加的边的总长度的最小值。

输入格式

* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: Two space-separated integers: Xi and Yi

* Lines N+2..N+M+2: Two space-separated integers: i and j, indicating that there is already a road connecting the farm i and farm j.

第一行两个整数n,m 代表点数与边数。
接下来 n 行每行两个整数 xi​,yi​ 代表第 i 个点的坐标。
接下来 m 行每行两个整数 ui​,vi​ 代表第 i 条边连接第 ui​ 个点和第vi​ 个点。

输出格式

* Line 1: Smallest length of additional roads required to connect all farms, printed without rounding to two decimal places. Be sure to calculate distances as 64-bit floating point numbers.

一行一个实数代表添加的边的最小长度，要求保留两位小数，为了避免误差， 请用 64 位实型变量进行计算。

输入输出样例

输入 #1

4 1
1 1
3 1
2 3
4 3
1 4

输出 #1

4.00

说明/提示

数据规模与约定

对于 100% 的整数，1≤n,m≤1000，1≤xi​,yi​≤106，1≤ui​,vi​≤n。

说明

Translated by 一只书虫仔。

 

思路：后面m条边都要出现在最小生成树中，不妨假设最后的 m条边权重为0。然后对前面的 n个点进行俩俩组合，最后套一下kruskal板子即可。

#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e6 + 10;
const int maxm = 2e6 + 10;

struct Edge{
    int u, v;
    double w;
}edge[maxm];

int n, m;
int father[maxm];
double x[maxn], y[maxn];
int cnt = 1;

int find(int x)
{
    while(x != father[x])
        x = father[x] = father[father[x]];
    return x;
}

void slove()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++){
        scanf("%lf%lf", &x[i], &y[i]);
    }
    for(int i = 1; i <= n; i++)
        father[i] = i;

    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            double jl = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));
            edge[cnt].u = i;
            edge[cnt].v = j;
            edge[cnt++].w = jl;
        }
    }

    for(int i = 1; i <= m; i++){
        int u, v;
        scanf("%d%d", &u, &v);
        edge[cnt].u = u;
        edge[cnt].v = v;
        edge[cnt++].w = 0;
    }
//    printf("cnt = %d\n", cnt);
}





bool cmp(const Edge a, const Edge b)
{
    return a.w < b.w;
}

double kruskal()
{
    sort(edge + 1, edge + cnt, cmp);
    double ans = 0;
    int tot = 0;

    for(int i = 1; i < cnt; i++){
        int au, av;
        au = find(edge[i].u);
        av = find(edge[i].v);
        if(au == av)continue;

        father[au] = av;

        ans += edge[i].w;
        if(tot == n-1)break;
        tot++;
    }
    return ans;
}

int main()
{
    slove();
    printf("%.2f", kruskal());
    return 0;
}