HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】

Eddy's picture

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

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?

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. 

Sample Input
3 1.0 1.0 2.0 2.0 2.0 4.0

Sample Output

using namespace std;
const int MAX = 105;
struct Node
    double x, y;
struct Len
    int nodex, nodey;
    double len;
    bool operator< (const Len a) const
        return len < a.len;
double dis(Node a, Node b)
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
int n, k, fa[MAX];
int fi(int x)
    if(fa[x] == x) return x;
    else return fa[x] = fi(fa[x]);
double ans;
int main()
    while(scanf("%d", &n) != EOF)
        k = 0;
        ans = 0;
        for(int i = 0;i <= MAX; ++i) fa[i] = i;
        for(int i = 0;i < n; ++i)
            scanf("%lf %lf", &N[i].x, &N[i].y);
            for(int j = 0;j < i; ++j)
                L[k].nodex = i;
                L[k].nodey = j;
                L[k++].len = dis(N[i], N[j]);
        sort(L, L+k);
        for(int i = 0;i < k; ++i)
            int x = fi(L[i].nodex);
            int y = fi(L[i].nodey);
            if(x == y) continue;
            fa[x] = y;
            ans += L[i].len;
        printf("%.2f\n", ans);
    return 0;

个人分类: 【最小生成树】
想对作者说点什么? 我来说一句



HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】