zoukankan      html  css  js  c++  java
  • (最小生成树)Eddy's picture -- hdu -- 1162

    链接:

    http://acm.hdu.edu.cn/showproblem.php?pid=1162

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


    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

    代码:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <stdlib.h>
    #include <math.h>
    #include <queue>
    #include <algorithm>
    using namespace std;
    
    const int oo = 0x3f3f3f3f;
    const int N = 110;
    
    struct node
    {
        double x, y;
    }s[N];
    
    int n, vis[N];
    double dist[N], G[N][N];
    
    double prim()
    {
        double ans = 0;
        for(int i=1; i<=n; i++)
            dist[i] = G[1][i];
    
        memset(vis, 0, sizeof(vis));
        vis[1] = 1;
    
        for(int i=1; i<=n; i++)
        {
           int index=1;
           double Min=oo;
           for(int j=1; j<=n; j++)
           {
               if(!vis[j] && dist[j]<Min)
               {
                   Min = dist[j];
                   index = j;
               }
           }
    
           if(index==1)
            continue;
    
           vis[index] = 1;
           ans += Min;
    
           for(int j=1; j<=n; j++)
           {
               if(!vis[j] && dist[j] > G[index][j])
               {
                   dist[j] = G[index][j];
               }
           }
        }
        return ans;
    }
    
    int main()
    {
        while(scanf("%d", &n)!=EOF)
        {
            for(int i=1; i<=n; i++)
                scanf("%lf%lf", &s[i].x, &s[i].y);
    
            for(int i=1; i<=n; i++)
            for(int j=1; j<=i; j++)
                G[i][j] = G[j][i] = sqrt((s[i].x-s[j].x)*(s[i].x-s[j].x)+(s[i].y-s[j].y)*(s[i].y-s[j].y) );
    
            printf("%.2f
    ", prim());
        }
        return 0;
    }
    勿忘初心
  • 相关阅读:
    第十一周课程总结
    第十周课程总结
    第九周课程总结&实验报告(七)
    第八周课程总结&实验报告六
    第七周
    第六周
    课程总结
    第十四周课程总结&实验报告
    第十三周总结
    第十二周总结
  • 原文地址:https://www.cnblogs.com/YY56/p/4783134.html
Copyright © 2011-2022 走看看