最小生成树-Uva10034

原创 2013年12月02日 21:27:56

Problem A: Freckles

In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through.

Consider Dick's back to be a plane with freckles at various (x,y) locations. Your job is to tell Richie how to connect the dots so as to minimize the amount of ink used. Richie connects the dots by drawing straight lines between pairs, possibly lifting the pen between lines. When Richie is done there must be a sequence of connected lines from any freckle to any other freckle.

Input

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

The first line contains 0 < n <= 100, the number of freckles on Dick's back. For each freckle, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the freckle.

Output

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

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

Sample Input

1

3
1.0 1.0
2.0 2.0
2.0 4.0

Sample Output

3.41

不所说,裸的最小生成树。
下面是代码:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
const double INF=1000000000000.0;
struct node
{
    double x,y;
} dian[150];
int n;
double grid[150][150];
double dist[150];
bool vis[150];
void prim()
{
    for(int i=1; i<=n; i++)
    {
        dist[i]=grid[1][i];
        vis[i]=false;
    }
    dist[1]=0;
    vis[1]=true;
    int x;
    for(int i=1; i<n; i++)
    {
        double maxn=INF+10;
        for(int j=1; j<=n; j++)
        {
            if(!vis[j]&&dist[j]<maxn)
            {
                maxn=dist[j];
                x=j;
            }
        }
        vis[x]=true;
        for(int j=1; j<=n; j++)
        {
            if(!vis[j]&&dist[j]>grid[x][j])
            {
                dist[j]=grid[x][j];
            }
        }
    }
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        double x,y;
        for(int i=1; i<=n; i++)
            fill(grid[i],grid[i]+n+1,INF);
        for(int i=1; i<=n; i++)
        {
            cin>>dian[i].x>>dian[i].y;
            for(int j=1; j<i; j++)
            {
                double dis=pow((dian[j].x-dian[i].x),2)+pow((dian[j].y-dian[i].y),2);
                dis=sqrt(dis);
                grid[i][j]=grid[j][i]=dis;
            }
        }
        prim();
        double ans=0;
        for(int i=1; i<=n; i++)
            ans+=dist[i];
        printf("%.2lf\n",ans);
        if(t!=0)
            cout<<endl;
    }
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

UVa 10034 Freckles (最小生成树+kruskal)

#include #include #include #include #include #include #include #include #include #include #include #...

uva 10034(最小生成树)

题目: In an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back ...

UVA 1151 Buy or Build(最小生成树+枚举子集)

题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem...

UVa 11747 Heavy Cycle Edges(最小生成树)

题意:给一个图,按照找最小生成树的方法,找到环并输出环中其中最大的边。 思路:一样是用Kruskal算法,只不过加边的时候,判断边上两点在不在一个连通集合中,如果在,则说明加上边得到了环,输出这条边...

UVa 1151 Buy or Build--最小生成树+二进制选择

题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem...

最小生成树,Kruskal(买还是建 uva 1151)

用并查集合并集合时,不能直接 p[net[t][i]]=net[t][1]; 而要 int u=net[t][i]; int v=net[t][1]; int xx=find(u); ...

UVA - 10369 Arctic Network (最小生成树)

题目大意: 有n个科研站, 要把这些站用卫星或者无线电连接起来,使得任意两个都能直接或者间接相连。任意两个都有安装卫星设备的,都可以直接通过卫星通信,不管它们距离有多远。而安装有无线电设备的两个站,...

UVA 11354 LCA+最小生成树

点击打开链接 题意:给一个无向图,然后有Q次询问U V,问的是U到V的所有路径中的最小值最大 思路:U到V的路径最小值最大,则这条边肯定是最小生成树上的边,那么我们可以先将所有的最小生成树上的边全...

UVA1279,Asteroid Rangers,星际游击队,好烦的最小生成树

题意: 三维空间内有n(n<=50)个点,每个点有初始坐标和xyz和xyz三个方向上的速度dxdydz 求最小生成树变化的次数分析: 最多啊n^2条边,最小生成树变化,无非是原来生成树中的某条边...
  • cww97
  • cww97
  • 2016-10-11 18:21
  • 199

UVA - 1151 Buy or Build(最小生成树+二进制枚举子集)

点击打开题目链接 题目大意:给出n个点的坐标,连边的费用为两端点的欧几里得距离。给出q种套餐,购买某种套餐花费Ci,该套餐中所有点将连通,求最小花费。 思路:读完题后知道是kruskal最短路...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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