题目:Radar
题意:N个城市,M个雷达,要派至多K个人去操作里面的K个雷达,K<=M。每个雷达的覆盖半径都一样。求雷达的覆盖半径最短是多少。
跟HDU5046差不多,都是重复覆盖问题。
核心做法就是二分答案,对于答案的判定采用DLX,加上一点点剪枝。
然后。。。我一开始按着大白书的做法,每次都是一整行的添加,在5046能AC,在这题却T死了。。。
最后改成逐个点添加才过。。。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const double eps = 1e-8;
const int N = 51;
const int M = 3000;
int T, n, m, k, sz;
double cx[N], cy[N], rx[N], ry[N];
int U[M], D[M], L[M], R[M], col[M], row[N], S[N];
int V[N], cnt;
double d[N][N], low, top, mid;
double dist(double x, double y){
return sqrt(x*x + y*y);
}
bool mat[N][N], vis[N];
void init(){
for(int i=0; i<=n; i++){
U[i] = D[i] = i;
L[i] = i-1;
R[i] = i+1;
S[i] = 0;
}
L[0] = n;
R[n] = 0;
sz = n+1;
}
void link(int r, int c){
S[c]++;
col[sz] = c;
U[sz] = U[c];
D[sz] = c;
U[D[sz]] = D[U[sz]] = sz;
if(~row[r]){
L[sz] = row[r];
R[sz] = R[row[r]];
L[R[sz]] = R[L[sz]] = sz;
row[r] = sz;
}
else{
row[r] = L[sz] = R[sz] = sz;
}
sz++;
}
bool h(int res){
memset(vis, 0, sizeof(vis));
for(int i=R[0]; i; i=R[i]){
if(!vis[i]){
res++;
if(res>k) return 0;
for(int j=D[i]; j!=i; j=D[j]){
for(int k=R[j]; k!=j; k=R[k]){
vis[col[k]] = 1;
}
}
}
}
return 1;
}
void remove(int x){
for(int i=D[x]; i!=x; i=D[i]){
R[L[i]] = R[i];
L[R[i]] = L[i];
}
}
void restore(int x){
for(int i=U[x]; i!=x; i=U[i]){
R[L[i]] = L[R[i]] = i;
}
}
bool dfs(int dep){
if(!R[0]) return 1;
if(!h(dep)) return 0;
int c = R[0];
for(int i=R[c]; i; 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=L[i]; j!=i; j=L[j]) remove(j);
if(dfs(dep+1)) return 1;
for(int j=R[i]; j!=i; j=R[j]) restore(j);
restore(i);
}
return 0;
}
bool ok(double D){
bool flag;
for(int i=1; i<=n; i++){
flag = 0;
for(int j=1; j<=m; j++){
if(d[j][i]<D+eps){
flag = 1;
mat[j][i] = 1;
}
else{
mat[j][i] = 0;
}
}
if(!flag) return 0;
}
init();
for(int i=1; i<=m; i++){
row[i] = -1;
for(int j=1; j<=n; j++){
if(mat[i][j]) link(i,j);
}
}
return dfs(0);
}
double solve(){
double ans = top;
while(top-low>eps){
mid = (low+top)*0.5;
if(ok(mid)){
top = mid-eps;
ans = min(ans, mid);
}
else low=mid+eps;
}
return ans;
}
int main(){
scanf("%d", &T);
while(T--){
scanf("%d %d %d", &n, &m, &k);
for(int i=1; i<=n; i++) scanf("%lf %lf", cx+i, cy+i);
low = top = 0.0;
for(int i=1; i<=m; i++){
scanf("%lf %lf", rx+i, ry+i);
for(int j=1; j<=n; j++){
d[i][j] = dist(rx[i]-cx[j], ry[i]-cy[j]);
top = max(top, d[i][j]);
}
}
printf("%.6f\n", solve());
}
return 0;
}