hdu_1162 Eddy's picture

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
#define N 10005
int Father[N];
struct node
{
    int u,v;
    double d;
} vertex[N];

struct res
{
    double x,y;
} save[N];

bool cmp(node a,node b)
{
    return a.d < b.d;
}

double dist(double x1,double y1,double x2,double y2)
{
    return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));
}
void make_set(int n)
{
    int i;
    for(i=0; i<=n; i++)
        Father[i] = i;
}

int Find_set(int x)
{
    int temp,ans,pre;
    pre = x;
    while(x != Father[x])
    {
        x = Father[x];
    }
    ans = x;
    while(pre != Father[pre])
    {
        temp = Father[pre];
        Father[pre] = ans;
        pre = temp;
    }
    return ans;
}
void Union_set(int a,int b)
{
    int x = Find_set(a);
    int y = Find_set(b);
    Father[x] = y;
}
int main()
{
    int n,i,j,k;
    double x,y,ans;
    while(cin>>n)
    {
        ans = 0,k = 0;
        for(i=1; i<=n; i++)
            cin>>save[i].x>>save[i].y;
        for(i=1; i<=n; i++)
            for(j=i+1; j<=n; j++)
            {
                vertex[k].u = i;
                vertex[k].v = j;
                vertex[k++].d = dist(save[i].x,save[i].y,save[j].x,save[j].y);
            }
        sort(vertex,vertex+k,cmp);
        make_set(n);
        for(i=0; i<k; i++)
        {
            x = Find_set(vertex[i].u);
            y = Find_set(vertex[i].v);
            if(x != y)
            {
                ans += vertex[i].d;
                Union_set(vertex[i].u,vertex[i].v);
            }
        }
        printf("%.2lf\n",ans);
    }
    return 0;
}