【第21期】观点:人工智能到底用 GPU?还是用 FPGA?

最小生成树-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 【最小生成树】

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

Uva 10034 - Freckles

题目大意:给定n(0<n<=100)个点,用线把这n个点连起来,使得任意两点间均可达 题目分析:很明显,基本最少生成树问题。a[i][j],表示点i,j之间的距离,由于是稠密图,所以采用Prim算法。 [code="c++"] //Uva 10034 - Freckles //最小生成树问题,采用Prim算法 #include #include #include #include #define eps 1e-6 using namespace std; const double

uva 10034 Freckles(最小生成树Kruskal)

uva 10034 FrecklesFreckles In an episode of the Dick Van Dyke show, little Richie connects the frec...

UVA 10034 By ACReaper

#include &lt;cstdio&gt; #include &lt;cstring&gt; #include &lt;cmath&gt; #include &lt;algorithm&gt; using namespace std; const int maxn = 15024; int u[maxn]; int v[maxn]; double w[5 * maxn]; int r[5 * maxn]; int fa[maxn]; struct pos{ double x,y; }; pos A[maxn]; int cmp(

uva10034Freckles - prime最小生成树

一个换行符的问题wr十几次 - - 各种debug诶       #include #include #define INF 1000000000 struct point { do...

UVa Problem 10034 Freckles (斑点)

// Freckles (斑点) // PC/UVa IDs: 111001/10034, Popularity: B, Success rate: average Level: 2 // Verdict: Accepted // Submission Date: 2011-10-03 // UVa Run Time: 0.008s // // 版权所有(C)2011,邱秋。metaphysis # yeah dot net // // [问题描述] // 在 “Dick Van Dyke“ 的某一集中,小

UVa 10034 - Freckles (最小生成树模板题)

链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_prob...

poj 2560 uva 10034 - Freckles

点击打开链接uva 10034 <span style="font-size: 18px;

UVA 10034 - Freckles(最小生成树)

Problem A: Freckles In an episode of the Dick Van Dyke show, little Richie connects the freckles ...

UVa 10034 - Freckles (最小生成树模板题)

链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;Itemid=8&amp;category=24&amp;
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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