zoukankan      html  css  js  c++  java
  • 杭电1162--Eddy's picture(Prim()算法)

    Eddy's picture

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 8070    Accepted Submission(s): 4084


    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
     
    Author
    eddy
     
    Recommend
    JGShining   |   We have carefully selected several similar problems for you:  1301 1217 1142 1598 1596 
     1 #include <cmath>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 using namespace std;
     6 const int INF = 0x3f3f3f3f;
     7 double map[110][110], dis[110]; bool vis[110];
     8 int n;
     9 struct point
    10 {
    11     double x, y;    
    12 } num[110];
    13 double Prim()
    14 {
    15     memset(vis, true, sizeof(vis));
    16     for(int i = 1; i <= n; i++)
    17         dis[i] = map[1][i];
    18     vis[1] = false;  double sum = 0.0;
    19     for(int i = 1; i < n; i++)
    20     {
    21         int temp; double min = INF;
    22         for(int j = 1; j <= n; j++)
    23         {
    24             if(vis[j] && dis[j] < min)
    25             {
    26                 temp = j;
    27                 min = dis[j];
    28             }
    29         }
    30         vis[temp] = false;
    31         sum += min;
    32         for(int j = 1; j <= n; j++)
    33         {
    34             if(vis[j] && dis[j] > map[temp][j])
    35                 dis[j] = map[temp][j]; 
    36         }
    37     }
    38     return sum;
    39    // printf("%.2lf
    ", sum); 
    40 }
    41 int main()
    42 {
    43     while(~scanf("%d", &n))
    44     {
    45         for(int i = 1; i <= n; i++)
    46             scanf("%lf %lf", &num[i].x, &num[i].y);
    47         for(int i = 1; i <= n; i++)
    48         {
    49             map[i][i] = 0.0;
    50             for(int j = 1; j < i; j++)   
    51                 map[j][i] = map[i][j] = sqrt((num[i].x - num[j].x)*(num[i].x - num[j].x) + (num[i].y-num[j].y)*(num[i].y-num[j].y));   
    52         }
    53         printf("%.2lf
    ",Prim());
    54     }
    55     return 0;
    56 }
  • 相关阅读:
    kbmMW 5.07.00试用笔记
    在 Andriod/IOS 程序中使用自定义字体
    【转】Delphi 10.3关于相机该注意的细节
    Delphi 10.3终于来了
    REST easy with kbmMW #17 – Database 6 – Existing databases
    【go】1环境搭建go语言介绍
    【ESSD技术解读02】企业级利器,阿里云 NVMe 盘和共享存储
    项目实战总结以及接入UAPM
    RocketMQ 5.0 POP 消费模式探秘
    Cube 技术解读 | 详解「支付宝」全新的卡片技术栈
  • 原文地址:https://www.cnblogs.com/soTired/p/4719650.html
Copyright © 2011-2022 走看看