HDOJ--1162--Eddy's picture

题目描述：
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends are not interested in his picture.Eddy feels very puzzled,in order to change all friends 's view to his technical of painting pictures ,so Eddy creates a problem for the his friends of you.
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?
输入描述:
The first line contains 0 < n <= 100, the number of point. For each point, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the point.

Input contains multiple test cases. Process to the end of file.
输出描述:
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.
输入：
3
1.0 1.0
2.0 2.0
2.0 4.0
输出：
3.41
题意：
在纸上有一些坐标点，点与点之间画线段，你要画几条线段，使得全部点直接或间接相连。这些线段的长度和最小为多少？
注意，线段的端点只能为原先纸上的坐标点。
题解：
最小生成树模板
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;

struct point{
    int x,y;
    double dis;
};

const int maxn = 10000 + 5;
point a[maxn];
int f[maxn];
int n;
double x[maxn],y[maxn];

int findset(int x){
    if(x != f[x]){
         f[x] = findset(f[x]);
    }
    return f[x];
}

void init(){
    for(int i = 0; i <= n; i ++){
        f[i] = i;
    }
}

double cal(double x1,double x2,double y1,double y2){
    return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

double cmp(point a,point b){
    return a.dis < b.dis;
}

int main(){
    while(scanf("%d",&n)!=EOF){
        init();
        for(int i = 1; i <= n; i ++){
            scanf("%lf%lf",&x[i],&y[i]);
        }
        int t = 0;
        for(int i = 1; i <= n; i ++){
            for(int j = i + 1; j <= n; j ++){
                a[t].x = i;
                a[t].y = j;
                a[t].dis = cal(x[i],x[j],y[i],y[j]);
                t ++;
            }
        }
        sort(a,a + t,cmp);
        //for(int i = 0; i < t; i ++) cout<<a[i].x<<" "<<a[i].y<<" "<<a[i].dis<<endl;
        double ans = 0;
        for(int i = 0; i < t; i ++){
            int fx = findset(a[i].x);
            int fy = findset(a[i].y);
            if(fx != fy){
                f[fx] = fy;
                ans += a[i].dis;
            }
        }
        printf("%.2lf\n",ans);
    }
    return 0;
}