zoukankan      html  css  js  c++  java
  • uva10034

    找出一堆点的最小生成树

    题目:

    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
    

    代码:
     1 #include <iostream>
     2 #include <cmath>
     3 #include <algorithm>
     4 #include <cstdio>
     5 using namespace std;
     6 
     7 
     8 int N;
     9 
    10 struct Point
    11 {
    12     double x,y;
    13 }P[200];
    14 
    15 struct Edge
    16 {
    17     double f,t;
    18     double w;
    19 
    20     bool operator <(const Edge& x) const
    21     {
    22         return w<x.w;
    23     }
    24 }E[5000];
    25 
    26 int F[200];
    27 
    28 double dist(int x,int y){
    29     return sqrt(  (P[x].x-P[y].x)*(P[x].x-P[y].x)+(P[x].y-P[y].y)*(P[x].y-P[y].y)  );
    30 }
    31 
    32 int find(int x){return F[x]==x?x:F[x]=find(F[x]);}
    33 int main()
    34 {
    35     int tst;
    36     cin>>tst;
    37     while(tst--)
    38     {
    39         cin>>N;
    40 
    41         for(int i=0;i<200;i++)
    42         {
    43             F[i] = i;
    44         }//
    45 
    46         for(int i=0;i<N;i++)
    47         {
    48             cin>>P[i].x>>P[i].y;
    49         }
    50 
    51         int pe=0;
    52         for(int i=0;i<N;i++)
    53         {
    54             for(int j=0;j<i;j++)
    55             {
    56                 if(i!=j)
    57                 {
    58 
    59                     E[pe].f = i;
    60                     E[pe].t = j;
    61                     E[pe].w = dist(i,j);
    62                     pe++;
    63                 }
    64             }
    65         }
    66         sort(E,E+pe);
    67 
    68 
    69         double ans=0;
    70         for(int i=0;i<pe;i++)
    71         {
    72             int x = find(E[i].f), y = find(E[i].t);
    73             if(x!=y)
    74             {
    75                 ans+= E[i].w;
    76                 F[x] = y;
    77             }
    78 
    79         }
    80 
    81             printf("%.2lf
    ",ans);
    82 
    83             if(tst)
    84             printf("
    ");
    85     }
    86 
    87 
    88     return 0;
    89 }
  • 相关阅读:
    Selenium python 常用定位方法
    第四周总结
    python自然语言处理——提取关键词,标签
    python 调用百度地图api接口获取地理详细信息行政代码等
    python分词技术——jieba安装使用
    质量属性战术--6.易用性战术
    Kettle的使用——大数据清洗技术
    周总结2
    DataX的使用——大数据同步技术
    python编程:从入门到实践
  • 原文地址:https://www.cnblogs.com/doubleshik/p/3508598.html
Copyright © 2011-2022 走看看