HDU 1162 Eddy's picture 最小生成树

题意：给出N个点的坐标，把这些点连成一棵树的最短距离。

思路：这就是最小生成树呀，我开始竟然没看出来，最近有点傻。

http://acm.hdu.edu.cn/showproblem.php?pid=1162

/*********************************************
    Problem : HDU 1162
    Author  : NMfloat
    InkTime (c) NM . All Rights Reserved .
********************************************/

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x)   memset(a,x,sizeof(a))
#define eps 1e-8

using namespace std;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5+5;
const int MAXE = 2e5+5;

typedef long long LL;
typedef unsigned long long ULL;

int T,n,m,k;
int bin[105];

double ans ;

struct Point{
    double x,y;
    double dist(Point B) {
        return sqrt((x-B.x)*(x-B.x)+(y-B.y)*(y-B.y));
    }
}P[105];

struct DIST {
    int x,y;
    double dist;
}dist[10005];

int find(int x) {
    if(x != bin[x])
        bin[x] = find(bin[x]);
    return bin[x];
}

void merge(int x,int y,double d) {
    int fx = find(x);
    int fy = find(y);
    if(fx != fy) {
        bin[fx] = fy;
        ans += d;
    }
}

bool cmp(DIST a1,DIST a2) {
    return a1.dist < a2.dist;
}

void input() {
    rep(i,1,n) scanf("%lf %lf",&P[i].x,&P[i].y);
}

void solve() {
    int tot = 0;
    rep(i,1,100) bin[i] = i;
    rep(i,2,n) {
        rep(j,1,i-1) {
            dist[++tot].dist = P[i].dist(P[j]);
            dist[tot].x = i;
            dist[tot].y = j;
        }
    }
    sort(dist+1,dist+tot+1,cmp);
    ans = 0;
    rep(i,1,tot) {
        merge(dist[i].x,dist[i].y,dist[i].dist);
    }
    printf("%.2f\n",ans);
}

int main(void) {
    //freopen("a.in","r",stdin);
    //scanf("%d",&T); while(T--) {
    //while(~scanf("%d %d",&n,&m)) {
    while(~scanf("%d",&n)) {
        input();
        solve();
    }
    return 0;
}