World Islands HDU3405 杭州省赛最小生成树

最新推荐文章于 2021-02-05 20:51:43 发布

原创最新推荐文章于 2021-02-05 20:51:43 发布 · 1.9k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#integer #each #build #output #rest #input

ACM_图论专栏收录该内容

126 篇文章

订阅专栏

探讨迪拜政府如何通过建造最少长度的桥梁连接人工岛屿，同时确保一个岛屿不被桥连接，以满足特殊需求。采用Prim算法求解最小生成树问题。

World Islands

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 206 Accepted Submission(s): 78

Problem Description

Dubai is a haven for the rich. The government of Dubai finds a good way to make money. They built a lot of artificial islands on the sea and sell them. These islands are shaped into the continents of the world, so they are called “world islands”. All islands are booked out now. The billionaires who buy these islands wants to make friends with each other, so they want these islands all be connected by bridges. Bill Gates also has booked an island, but he is the only one who doesn’t want his island to be connected with other islands, because he prefer to travel on the sea on his old landing craft which is used in the Invasion of Normandy in World War II. Fortunately, Bill doesn’t care about which island is saved for him, so Dubai government can still find the best way to build the bridges. The best way means that the total length of the bridges is minimum. In a word, if there are n islands, what they should do is to build n–2 bridges connecting n-1 islands, and give the rest island to Bill Gates. They can give any island to Bill Gates. Now they pay you good money to help them to find out the best way to build the bridges.
Please note;
1.An island can be considered as a point.
2.A bridge can be considered as a line segment connecting two islands.
3.A bridge connects with other bridges only at the islands.

Input

The first line is an integer indicating the number of test cases.
For each test case, the first line is an integer n representing the number of islands.(0<n<50)
Then n lines follow. Each line contains two integers x and y( -20 <= x, y <= 20 ) , indicating the coordinate of an island.

Output

For each test case, output the minimum total length of the bridges in a line. The results should be rounded to 2 digits after decimal point, and you must keep 2 digits after the decimal point.

Sample Input

Sample Output

  
   3.00
1.00

Source

2010 National Programming Invitational Contest Host by ZSTU

杭州省赛的第一道水题

Recommend

wxl

#include<stdio.h>
#include<math.h>
int x[60],y[60];
double map[60][60];
double sum;
int n;
double prim(int x)
{
    double d[60];
    bool used[60];
    used[x]=true;
    d[x]=1<<31-1;
    int t=x+1>n?1:x+1;
    for(int i=1;i<=n;i++)
    if(i!=x)
    {
        d[i]=map[t][i];
        used[i]=false;
    }
    used[t]=true;
    d[t]=0;
    int r;
    double s=0;
    for(int i=1;i<n-1;i++)
    {
        double minc=1<<31-1;
        for(int j=1;j<=n;j++)
        if(!used[j]&&d[j]<minc)   minc=d[j],r=j;
        s+=minc;
        if(s>sum)   return 100000000.00;
        used[r]=true;
        for(int j=1;j<=n;j++)
        if(!used[j]&&d[j]>map[r][j])   d[j]=map[r][j];
    }
    return s;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)   scanf("%d%d",&x[i],&y[i]);
        for(int i=1;i<=n;i++)
           for(int j=1;j<=n;j++)
           if(i==j)   map[i][j]=0.00;
           else map[i][j]=sqrt(1.0*(x[i]-x[j])*(x[i]-x[j])+1.0*(y[i]-y[j])*(y[i]-y[j]));
        sum=1<<31-1;
        for(int i=1;i<=n;i++)
        {
            double t=prim(i);
            if(t<sum)   sum=t;
        }
        printf("%0.2lf/n",sum);
    }
}