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

原创 2016年05月30日 18:56:28

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?
 

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
3 1.0 1.0 2.0 2.0 2.0 4.0
 

Sample Output
3.41
 
n个点的完全图,求最小生成树。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int MAX = 105;
struct Node
{
    double x, y;
}N[MAX];
struct Len
{
    int nodex, nodey;
    double len;
    bool operator< (const Len a) const
    {
        return len < a.len;
    }
}L[MAX*MAX];
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 1556.Color the ball【线段树】【4月28】

Color the ball Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDU 2544.最短路【最短路径(Dijkstra算法)】【4月14】

最短路 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submis...

hdu 1162 Eddy's picture (Kruskal算法,prim算法,最小生成树)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1162 【题目大意】 给你n个点的坐标,让你找到联通n个点的一种方法,保证联通的线路最短,典...

HDU 1162 Eddy's picture【最小生成树,Prime算法+Kruskal算法】

Eddy's picture Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

HDU-1875 畅通工程再续-1162 - Eddy's picture(最小生成树,Kruskal 算法实现 )

最近在搞最小生成树,做了三题套模板的题目,现在
  • FXXKI
  • FXXKI
  • 2014年07月26日 22:58
  • 503

hdu 1162 Eddy's picture 最小生成树入门题 Prim+Kruskal两种算法AC

Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become ...

hdu1162(并查集+Kruskal最小生成树)-- Eddy's picture

Eddy's picture Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) T...

HDU 1162 Eddy's picture Kruskal算法

Eddy's picture Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • nzq1234
  • nzq1234
  • 2012年09月08日 21:15
  • 540

hdu1162 Eddy's picture (最小生成树之prim 算法)

Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to become...

hdu 1162Eddy's picture Prime算法求最小生成树

Eddy's pictureTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Tot...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】
举报原因:
原因补充:

(最多只允许输入30个字)