题意
题解
求使图中各点连通所使用的边中,边权第 S S S 大的边的最小值。最小化边权并保证联通性,构造生成树即可;否则,删去环上权值最大的边。持有卫星的 S S S 个节点可以构成一个连通块,则最多可以将树上 S − 1 S-1 S−1 条无线频道改变为指向这个连通块的卫星频道。
容易想到二分答案,将问题转化为判定是否存在大于某个权值的边不多于 S − 1 S-1 S−1 条的生成树。具体而言,假设当前二分的权值为 x x x,将权值大于等于 x x x 的边权赋 1 1 1,其余赋 0 0 0,求解最小生成树即可。
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 505;
const double eps = 1e-4;
int T, S, N, X[maxn], Y[maxn], ds[maxn];
double G[maxn][maxn];
bool vs[maxn];
inline double dis(int i, int j)
{
int dx = X[i] - X[j], dy = Y[i] - Y[j];
return sqrt(1.0 * dx * dx + dy * dy);
}
bool prim(double mid)
{
memset(vs, 0, sizeof(vs));
memset(ds, 0x3f, sizeof(ds));
ds[1] = 0;
int cnt = 0;
for (;;)
{
int x = 0;
for (int i = 1; i <= N; ++i)
if (!vs[i] && (!x || ds[i] < ds[x]))
{
x = i;
if (!ds[x])
break;
}
if (!x)
break;
vs[x] = 1, cnt += ds[x];
for (int i = 1; i <= N; ++i)
ds[i] = min(ds[i], int(G[x][i] > mid));
}
return cnt <= S - 1;
}
int main()
{
scanf("%d", &T);
while (T--)
{
scanf("%d%d", &S, &N);
for (int i = 1; i <= N; ++i)
scanf("%d%d", X + i, Y + i);
for (int i = 1; i <= N; ++i)
for (int j = i + 1; j <= N; ++j)
G[i][j] = G[j][i] = dis(i, j);
double lb = 0, ub = 15000;
while (ub - lb > eps)
{
double mid = (ub + lb) / 2;
if (prim(mid))
ub = mid;
else
lb = mid;
}
printf("%.2f\n", ub);
}
return 0;
}
推论:生成树上第 k k k 大的边权的最小值,等于最小生成树第 k k k 大的边权。传送门 证明
答案为最小生成树上第 S S S 大的边权。题中为稠密图, P r i m Prim Prim 效率更高。总时间复杂度 O ( N 2 ) O(N^2) O(N2)。
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 505, inf = 0x3f3f3f3f;
int T, S, N, X[maxn], Y[maxn];
double G[maxn][maxn], ds[maxn];
bool vs[maxn];
inline double dis(int i, int j)
{
int dx = X[i] - X[j], dy = Y[i] - Y[j];
return sqrt(1.0 * dx * dx + dy * dy);
}
void prim()
{
for (int i = 1; i <= N; ++i)
ds[i] = inf, vs[i] = 0;
ds[1] = 0;
for (;;)
{
int x = 0;
for (int i = 1; i <= N; ++i)
if (!vs[i] && (!x || ds[i] < ds[x]))
x = i;
if (!x)
break;
vs[x] = 1;
for (int i = 1; i <= N; ++i)
if (!vs[i])
ds[i] = min(ds[i], G[x][i]);
}
}
int main()
{
scanf("%d", &T);
while (T--)
{
scanf("%d%d", &S, &N);
for (int i = 1; i <= N; ++i)
scanf("%d%d", X + i, Y + i);
for (int i = 1; i <= N; ++i)
for (int j = i + 1; j <= N; ++j)
G[i][j] = G[j][i] = dis(i, j);
prim();
sort(ds + 1, ds + N + 1);
printf("%.2f\n", ds[N - S + 1]);
}
return 0;
}