POJ ~ 2031 ~ Building a Space Station （最小生成树）

题意：三维空间内有N个球，给你圆心坐标和半径X，Y，Z，R。问使这些球连通的需要修建路的最小距离？如果两个球不是相离的，那么认为他们已经联通。

思路：只有100个点。暴力把边处理出来进行kruskal就行了，已经连通的两个星球可以把权值直接置为0，或者不建这条边，直接把这两个点合并进并查集。

 

边权置为0的代码：

 

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN = 105;
const int MAXM = 105 * 105;
int n, m, f[MAXN];
struct Ball
{
    double x, y, z, r;
}ball[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(ball[a].x - ball[b].x, 2) + pow(ball[a].y - ball[b].y, 2) + pow(ball[a].z - ball[b].z, 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()
{
    double ans = 0;
    int cnt = 0;
    init();
    sort(edge, edge + m);
    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) break;
        }
    }
    return ans;
}
int main()
{
    while (~scanf("%d", &n) && n)
    {
        m = 0;
        for (int i = 0; i < n; i++) scanf("%lf%lf%lf%lf", &ball[i].x, &ball[i].y, &ball[i].z, &ball[i].r);
        for (int i = 0; i < n; i++)
        {
            for (int j = i + 1; j < n; j++)
            {
                edge[m].u = i; edge[m].v = j;
                double t = dis(i, j);
                if (ball[i].r + ball[j].r < t) edge[m].w = t - (ball[i].r + ball[j].r);
                else edge[m].w = 0.0;
                m++;
            }
        }
        printf("%.3f\n", kruskal());
    }
    return 0;
}
/*
3
10.000 10.000 50.000 10.000
40.000 10.000 50.000 10.000
40.000 40.000 50.000 10.000
2
30.000 30.000 30.000 20.000
40.000 40.000 40.000 20.000
5
5.729 15.143 3.996 25.837
6.013 14.372 4.818 10.671
80.115 63.292 84.477 15.120
64.095 80.924 70.029 14.881
39.472 85.116 71.369 5.553
0
*/

 

 

 

不建边直接合并的代码：

 

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAXN = 105;
const int MAXM = 105 * 105;
int n, m, f[MAXN];
struct Ball
{
    double x, y, z, r;
}ball[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(ball[a].x - ball[b].x, 2) + pow(ball[a].y - ball[b].y, 2) + pow(ball[a].z - ball[b].z, 2));
}
void init()
{
    m = 0;
    for (int i = 0; i <= n; i++) f[i] = i;
}
int Find(int x){ return f[x] == x ? x : f[x] = Find(f[x]); }
bool Union(int a, int b)
{
    int root1 = Find(a), root2 = Find(b);
    if (root1 != root2)
    {
        f[root1] = root2;
        return true;
    }
    return false;
}
double kruskal()
{
    int cnt = 0;
    double ans = 0;
    sort(edge, edge + m);
    for (int i = 0; i < m; i++)
    {
        if (Union(edge[i].u, edge[i].v)) ans += edge[i].w;
    }
    return ans;
}
int main()
{
    while (~scanf("%d", &n) && n)
    {
        init();
        for (int i = 0; i < n; i++) scanf("%lf%lf%lf%lf", &ball[i].x, &ball[i].y, &ball[i].z, &ball[i].r);
        for (int i = 0; i < n; i++)
        {
            for (int j = i + 1; j < n; j++)
            {
                double t = dis(i, j);
                if (ball[i].r + ball[j].r < t)
                {
                    edge[m].u = i; edge[m].v = j; edge[m].w = t - (ball[i].r + ball[j].r);
                    m++;
                }
                else Union(i, j);
            }
        }
        printf("%.3f\n", kruskal());
    }
    return 0;
}
/*
3
10.000 10.000 50.000 10.000
40.000 10.000 50.000 10.000
40.000 40.000 50.000 10.000
2
30.000 30.000 30.000 20.000
40.000 40.000 40.000 20.000
5
5.729 15.143 3.996 25.837
6.013 14.372 4.818 10.671
80.115 63.292 84.477 15.120
64.095 80.924 70.029 14.881
39.472 85.116 71.369 5.553
0
*/