Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 4526 | Accepted: 1610 |
Description
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts.
Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.
Input
Output
Sample Input
1 2 4 0 100 0 300 0 600 150 750
Sample Output
212.13
Source
//Prim算法
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const double INF = 1<<30;
const int MAX = 505;
struct point {
double x, y;
}pnt[MAX];
double dist[MAX][MAX], lowcost[MAX], res[MAX];
bool visited[MAX];
int P, S, cnt;
bool cmp(const double a, const double b)
{
return a > b;
}
void Prim()
{
int i, j, k;
cnt = 0;
for(i = 1; i <= P; i++)
lowcost[i] = dist[1][i];
visited[1] = true;
for(i = 1; i < P; i++)
{
double min = INF;
k = 1;
for(j = 2; j <= P; j++)
{
if((!visited[j]) && (lowcost[j] < min))
{
min = lowcost[j];
k = j;
}
}
res[++cnt] = min;
visited[k] = true;
for(j = 2; j <= P; j++)
{
if((!visited[j]) && (lowcost[j] > dist[k][j]))
lowcost[j] = dist[k][j];
}
}
}
int main()
{
int i, j, k, T;
scanf("%d", &T);
while(T--)
{
scanf("%d%d", &S, &P);
for(i = 1; i <= P; i++)
scanf("%lf%lf", &pnt[i].x, &pnt[i].y);
memset(res, 0, sizeof(res));
memset(visited, false, sizeof(visited));
for(i = 1; i < P; i++)
{
for(j = i+1; j <= P; j++)
{
double xx = pnt[i].x - pnt[j].x;
double yy = pnt[i].y - pnt[j].y;
dist[i][j] = sqrt(xx * xx + yy * yy);
dist[j][i] = dist[i][j];
}
}
Prim();
sort(res+1, res+P, cmp);
printf("%.2lf\n", res[S]);
}
return 0;
}