题目概述
城市中有N家商店,编号1到N,每家的坐标为x,y,其中有两家分别是Nike和Apple,现在要为这些商店修路,其中Nike和Apple必须直接相连,其他的只要能间接连通即可,求修路总长最小值
时限
1000ms/2000ms
输入
第一行整数N,下一行两个整数Nike,Apple,代表这两家店为Nike和Apple,其后N行,每行两个整数x,y,为一家店的坐标,店按编号升序给出,输入到N=0结束
限制
3<=N<=50;-100<=x,y<=100
输出
每行一个保留两位小数的浮点数,为所求修路总长
样例输入
4
2 3
0 0
1 0
0 -1
1 -1
0
样例输出
3.41
讨论
图论,最小生成树,prim算法,和普通的生成树没什么区别,不过第一步先直接把这两个店连起来,后面的就都一样了
题解状态
0MS,1740K,1416 B,C++
题解代码
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 53
#define memset0(a) memset(a,0,sizeof(a))
int N;//店总数
int x[MAXN], y[MAXN];//店坐标
double graph[MAXN][MAXN], dist[MAXN];//邻接矩阵 生成树边长
bool mk[MAXN];//标记已在树中
double dis(int x1, int y1, int x2, int y2)//两点间距离
{
return sqrt(double(x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
}
double fun()
{
int Nike, Apple;//不用解释……
scanf("%d%d", &Nike, &Apple);//input
for (int p = 1; p <= N; p++)
scanf("%d%d", &x[p], &y[p]);//input
for (int p = 1; p <= N; p++)
for (int i = p + 1; i <= N; i++)
graph[p][i] = graph[i][p] = dis(x[p], y[p], x[i], y[i]);
mk[Nike] = 1;//下面模拟prim把两个名牌店连起来
for (int p = 1; p <= N; p++)
dist[p] = graph[Nike][p];
double sum = 0;
mk[Apple] = 1;
sum += graph[Nike][Apple];
for (int i = 1; i <= N; i++)
if (!mk[i] && dist[i] > graph[Apple][i])
dist[i] = graph[Apple][i];
for (int p = 2; p < N; p++) {//剩下就是普通的prim了
double least = INF;
int pos;
for (int i = 1; i <= N; i++) {
if (!mk[i] && least > dist[i]) {
least = dist[i];
pos = i;
}
}
mk[pos] = 1;
sum += least;
for (int i = 1; i <= N; i++)
if (!mk[i] && dist[i] > graph[pos][i])
dist[i] = graph[pos][i];
}
return sum;
}
int main(void)
{
//freopen("vs_cin.txt", "r", stdin);
//freopen("vs_cout.txt", "w", stdout);
while (~scanf("%d", &N) && N) {//input
printf("%.2lf\n", fun());//output
memset0(mk);
}
}
EOF