题意:有N个城市,M个雷达站,K个操作员,从M个雷达站中选择K个,来覆盖所有的N城市,每个雷达有相同的覆盖半径,问:最小的覆盖半径是多少。
思路:二分半径R,对于当前R,确定当前的矩阵,然后用DLX的重复覆盖模板判断是否有解。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-8
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int maxnode = 30000;
const int MaxM = 55;
const int MaxN = 55;
const int INF = 0x3f3f3f3f;
int n, m, k;
struct Point {
int x, y;
} city[100], radar[100];
double cal(Point a, Point b) {
return (double)((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
struct DLX
{
int n,m,size;
int U[maxnode],D[maxnode],R[maxnode],L[maxnode],Row[maxnode],Col[maxnode];
int H[MaxN],S[MaxN];
int ands,ans[MaxN];
void init(int _n,int _m)
{
n = _n;
m = _m;
for(int i = 0;i <= m;i++)
{
S[i] = 0;
U[i] = D[i] = i;
L[i] = i-1;
R[i] = i+1;
}
R[m] = 0; L[0] = m;
size = m;
for(int i = 1;i <= n;i++)
H[i] = -1;
}
void Link(int r,int c)
{
++S[Col[++size]=c];
Row[size] = r;
D[size] = D[c];
U[D[c]] = size;
U[size] = c;
D[c] = size;
if(H[r] < 0)H[r] = L[size] = R[size] = size;
else
{
R[size] = R[H[r]];
L[R[H[r]]] = size;
L[size] = H[r];
R[H[r]] = size;
}
}
void remove(int c)
{
for(int i = D[c];i != c;i = D[i])
L[R[i]] = L[i], R[L[i]] = R[i];
}
void resume(int c)
{
for(int i = U[c];i != c;i = U[i])
L[R[i]]=R[L[i]]=i;
}
bool v[maxnode];
int f()
{
int ret = 0;
for(int c = R[0];c != 0;c = R[c])v[c] = true;
for(int c = R[0];c != 0;c = R[c])
if(v[c])
{
ret++;
v[c] = false;
for(int i = D[c];i != c;i = D[i])
for(int j = R[i];j != i;j = R[j])
v[Col[j]] = false;
}
return ret;
}
bool Dance(int d)
{
if(d + f() > k) return false;
if(R[0] == 0)return d <= k;
int c = R[0];
for(int i = R[0];i != 0;i = R[i])
if(S[i] < S[c])
c = i;
for(int i = D[c];i != c;i = D[i])
{
remove(i);
for(int j = R[i];j != i;j = R[j])remove(j);
if(Dance(d+1))return true;
for(int j = L[i];j != i;j = L[j])resume(j);
resume(i);
}
return false;
}
} dlx;
bool check(double r) {
dlx.init(m, n);
double tmp = r*r;
for(int i = 1; i <= m; i++) {
for(int j = 1; j <= n; j++) {
if(cal(radar[i], city[j]) <= tmp) dlx.Link(i, j);
}
}
return dlx.Dance(0);
}
int main() {
//freopen("input.txt", "r", stdin);
int T;
cin >> T;
while(T--) {
scanf("%d%d%d", &n, &m, &k);
for(int i = 1; i <= n; i++) scanf("%d%d", &city[i].x, &city[i].y);
for(int i = 1; i <= m; i++) scanf("%d%d", &radar[i].x, &radar[i].y);
double L = 0, R = 2000;
while(R-L > eps) {
double M = (L+R) / 2;
if(check(M)) R = M;
else L = M;
}
printf("%.6f\n", R);
}
return 0;
}