Outlets

Outlets

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

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

 

Source

2012 Asia Hangzhou Regional Contest

 

Recommend

题意：求最小生成树，p点和q点必须连着

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <algorithm>
 #include <cmath>
 #include <cstdlib>
 #include <limits>
 #include <queue>
 #include <stack>
 #include <vector>
 #include <map>

 using namespace std;

 #define N 55
 #define INF 0xfffffff
 #define PI acos (-1.0)
 #define EPS 1e-8
 #define Lson rt<<1, l, tree[rt].mid ()
 #define Rson rt<<1|1, tree[rt].mid () + 1, r

 struct node
 {
     int x, y;
 } P[N];

 int n, vis[N];

 double maps[N][N], dist[N];

 void init()
 {
     for(int i = ; i <= n; i++)
     {
         vis[i] = ;
         for(int j = ; j <= n; j++)
             maps[i][j] = maps[j][i] = INF;
         maps[i][i] = ;
     }
 }

 int main()
 {
     int p, q;

     while(scanf("%d", &n), n)
     {
         init();

         scanf("%d%d", &p, &q);

         for(int i = ; i <= n; i++)
             scanf("%d%d", &P[i].x, &P[i].y);

         int x = abs(P[p].x-P[q].x);
         int y = abs(P[p].y-P[q].y);

         double tmp = 1.0*sqrt(x*x+y*y);

         for(int i = ; i <= n; i++)
         {
             for(int j = ; j <= n; j++)
             {
                 int f = abs(P[i].x-P[j].x), g = abs(P[i].y-P[j].y);

                 maps[i][j] = 1.0*sqrt(f*f+g*g);
                 maps[j][i] = maps[i][j];
             }
         }

         maps[p][q] = maps[q][p] = ;

         double ans = ;

         dist[] = ;

         for(int i = ; i <= n; i++)
             dist[i] = maps[i][];

         vis[] = ;

         for(int i = ; i < n; i++)
         {
             int index;
             double  Min = INF;     // double Min， 不知道在这错多少回了
             for(int j = ; j <= n; j++)
             {
                 if(!vis[j] && dist[j] < Min)
                     Min = dist[j], index = j;
             }
             vis[index] = ;
             ans += Min;
             for(int j = ; j <= n; j++)
             {
                 if(!vis[j] && dist[j] > maps[j][index])
                     dist[j] = maps[j][index];
             }
         }
         printf("%.2f\n", ans+tmp);
     }
     return ;
 }