HDU 4463 Outlets(一条边固定的最小生成树)

Outlets

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

Problem Description

In China, foreign brand commodities are often much more expensive than abroad. The main reason is that we Chinese people tend to think foreign things are better and we are willing to pay much for them. The typical example is, on the United Airline flight, they give you Haagendazs ice cream for free, but in China, you will pay $10 to buy just a little cup.
So when we Chinese go abroad, one of our most favorite activities is shopping in outlets. Some people buy tens of famous brand shoes and bags one time. In Las Vegas, the existing outlets can't match the demand of Chinese. So they want to build a new outlets in the desert. The new outlets consists of many stores. All stores are connected by roads. They want to minimize the total road length. The owner of the outlets just hired a data mining expert, and the expert told him that Nike store and Apple store must be directly connected by a road. Now please help him figure out how to minimize the total road length under this condition. A store can be considered as a point and a road is a line segment connecting two stores.

 

 

Input

There are several test cases. For each test case: The first line is an integer N( 3 <= N <= 50) , meaning there are N stores in the outlets. These N stores are numbered from 1 to N. The second line contains two integers p and q, indicating that the No. p store is a Nike store and the No. q store is an Apple store. Then N lines follow. The i-th line describes the position of the i-th store. The store position is represented by two integers x,y( -100<= x,y <= 100) , meaning that the coordinate of the store is (x,y). These N stores are all located at different place. The input ends by N = 0.

 

 

Output

For each test case, print the minimum total road length. The result should be rounded to 2 digits after decimal point.

 

 

Sample Input

4 2 3 0 0 1 0 0 -1 1 -1 0

 

 

Sample Output

3.41

 

题目大意：

　　这道题是说，给你n个点，然后要求p和q号城市之间必须有道路相连接，然后，其他的道路之间满足最小生成树。说白了，就是一个 一条边固定的最小生成树问题。

解题思路：

　　直接用并查集搞就行了，没有什么难度。。。

代码：

　　

# include<cstdio>
# include<iostream>
# include<cmath>
# include<cstring>
# include<algorithm>

using namespace std;

# define MAX 54*54

struct node
{
    int x,y;
}point[MAX];
int f[MAX];

void init()
{
    for ( int i = 0;i < MAX;i++ )
    {
        f[i] = i;
    }
}


struct edge
{
    int u,v;
    double cost;
}e[MAX];

int cmp( const struct edge & a,const struct edge & b )
{
    return a.cost < b.cost;
}

double dis ( node a,node b )
{
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y) );
}

int getf( int x )
{
    if ( f[x]==x )
        return x;
    else
    {
        int t = getf(f[x]);
        f[x] = t;
        return f[x];
    }
}

int main(void)
{
    int n;
    while ( scanf("%d",&n)!=EOF )
    {
        if ( n==0 )
            break;
        init();
        int p,q; scanf("%d%d",&p,&q);
        for ( int i = 1;i <= n;i++ )
        {
            scanf("%d%d",&point[i].x,&point[i].y);
        }
        int cnt = 0;
        for ( int i = 1;i <= n-1;i++ )
        {
            for ( int j = i+1;j <= n;j++ )
            {
                if( i==p&&j==q||i==q&&j==p )
                {
                    e[cnt].cost = 0;
                }
                else
                {
                    e[cnt].cost = dis(point[i],point[j]);
                }
                e[cnt].u = i; e[cnt].v = j;
                cnt++;
            }
        }
        int num = 0;
        double ans = 0;
        sort(e,e+cnt,cmp);
        ans = dis(point[p],point[q]);
        for ( int i = 0;i < cnt;i++ )
        {
            int x = getf(e[i].u);
            int y = getf(e[i].v);
            if ( x!=y )
            {
                num++;
                f[x] = y;
                ans+=e[i].cost;
                if(num==n-1)
                    break;
            }
        }
        printf("%.2lf\n",ans);
        memset(e,0,sizeof(e));
    }


    return 0;
}