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 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】

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

HDU-1162 Eddy's picture(最小生成树[Kruskal])

Kruskal算法就是并查集,学习的同时还能复习并查集

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

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

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

HDOJ 1162 Eddy's picture(最小生成树 - kruskal)

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

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 1162 Eddy's picture(最小生成树)

HDU 1162 Eddy's picture(最小生成树) http://acm.hdu.edu.cn/showproblem.php?pid=1162 题意:        给你N个点的坐标,问你...

HDU 1162 Eddy's picture 最小生成树

题意:给出N个点的坐标,把这些点连成一棵树的最短距离。思路:这就是最小生成树呀,我开始竟然没看出来,最近有点傻。 http://acm.hdu.edu.cn/showproblem.php?pid...

HDU 1162 Eddy's picture Kruskal算法

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

HDU 1162 Eddy's picture 最小生成树

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

HDU 1162 Eddy's picture (最小生成树)

问题描述: Problem Description Eddy begins to like painting pictures recently ,he is sure of himself to...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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