HDU 4463 Outlets

  • 2018-07-11
  • 17
  • 0

题目:

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

题目链接

给出一些点的坐标,求最小生成树,其中指定两个点必须直接相连。

在计算点与点之间边的权值时将两个指定点之间边的权值设置为0,这样就可以把两个点看为一个点,这时再用Prim算法从其中一个点开始求最小生成树,把所有最小生成树中的权值求和,再加上两个指定点之间的距离即为答案。

AC代码:

评论

还没有任何评论,你来说两句吧