HDU ~ 1875 ~ 畅通工程再续 （最小生成树）

思路：注意建边的时候，距离小于等于1000且大于等于10才可以建边。需要判定下是否能够形成最小生成树。

 

 

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 1005;
const int MAXM = 1005 * 1005;
int n, m, f[MAXN];
struct Point
{
    int x, y;
}point[MAXN];
struct Edge
{
    int u, v;
    double w;
    bool operator < (const Edge& A) const
    {
        return w < A.w;
    }
}edge[MAXM];
double dis(int a, int b)
{
    return sqrt(pow(point[a].x - point[b].x, 2) + pow(point[a].y - point[b].y, 2));
}
void init()
{
    for (int i = 0; i <= n; i++) f[i] = i;
}
int Find(int x){ return f[x] == x ? x : f[x] = Find(f[x]); }
double kruskal()
{
    init();
    sort(edge, edge + m);
    double ans = 0.0;
    int cnt = 0;
    for (int i = 0; i < m; i++)
    {
        int u = edge[i].u, v = edge[i].v;
        double w = edge[i].w;
        int root1 = Find(u), root2 = Find(v);
        if (root1 != root2)
        {
            f[root1] = root2;
            ans += w;
            cnt++;
            if (cnt == n - 1) return ans;
        }
    }
    return -1.0;
}
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        m = 0;
        scanf("%d", &n);
        for (int i = 0; i < n; i++) scanf("%d%d", &point[i].x, &point[i].y);
        for (int i = 0; i < n; i++)
        {
            for (int j = i + 1; j < n; j++)
            {
                double t = dis(i, j);
                if (10.0 <= t && t <= 1000.0)
                {
                    edge[m].u = i; edge[m].v = j; edge[m].w = t;
                    m++;
                }
            }
        }
        double ans = kruskal();
        if (ans != -1.0) printf("%.1f\n", ans * 100.0);
        else printf("oh!\n");
    }
    return 0;
}
/*
2
2
10 10
20 20
3
1 1
2 2
1000 1000
*/