hdu 1162

Eddy's picture

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4858    Accepted Submission(s): 2407

Problem Description

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?

 

Input

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.

 

Output

Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.

 

Sample Input

31.0 1.02.0 2.02.0 4.0

 

Sample Output

3.41

 

Author

eddy

 

Recommend

JGShining

//prim 求最小生成树#include <stdio.h>#include <math.h>#include <string.h>#define MAXN 105#define UPPERDIS 999999double lowcost[MAXN],vist[MAXN];double cost[MAXN][MAXN];int n;double prim(int v0){    int i, j, minone;double mindis;    double ans = 0;/*用来记录最小生成树的总长度*/memset(vist, 0, sizeof(vist));    /*各点距离初始化*/    for(i = 0;i < n;i++)    {        lowcost[i] = cost[v0][i];    }vist[v0] = 1;    for(i = 0;i < n-1;i++)    {        mindis = UPPERDIS;        for(j = 0;j < n;j++)          if(!vist[j] && mindis > lowcost[j])          {              mindis = lowcost[j];              minone = j;          }        /*将找到的最近点加入最小生成树*/        ans += mindis;        vist[minone] = 1;        /*修正其他点到最小生成树的距离*/        for(j = 0;j < n;j++)          if(!vist[j] && cost[minone][j] < lowcost[j])          {              lowcost[j] = cost[minone][j];          }    }    return ans;}struct point {double x, y;}p[MAXN];double dis(point p1, point p2){return sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));}int main(){int i, j;while (~scanf("%d", &n)){for(i = 0; i < n; i++)scanf("%lf%lf", &p[i].x, &p[i].y);for(i = 0; i < n; i++)for(j = i; j < n; j++)if(j == i)cost[i][i] = 1000000.0;elsecost[i][j] = cost[j][i] = dis(p[i], p[j]);printf("%.2lf\n",prim(0));}}