HDU - 2295 (Radar)

题意：给定平面上 n 个城市和 m 个雷达站的坐标，现在只有 k 名操作员来控制雷达(k<=m，一人一站)，求最小的雷达半径，使得k名操作员合理选择k个雷达站的情况下可以覆盖所有的城市；

 

分析：明显的精确覆盖问题，因为是求最小半径，所以肯定有解，那么二分半径再套用Dancing Links 判断当前半径下是否满足条件就可以了；

 

代码：

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

const double eps= 1e-8;

const int maxnode = 5000; 
const int MaxM = 55;
const int MaxN = 55;

struct DLX
{
    int n,m,size;
    int U[maxnode],D[maxnode],R[maxnode],L[maxnode],Row[maxnode],Col[maxnode];
    int H[MaxN],S[MaxM];
    int ansd;
    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[MaxM];
    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;
    }
    void Dance(int d)
    {
        if(d + f() >= ansd)return;
        if(R[0] == 0)
        {
            if(d < ansd)ansd = d;
            return;
        }
        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);
            Dance(d+1);
            for(int j = L[i];j != i;j = L[j])resume(j);
            resume(i);
        }
    }
};

DLX g;

double ctx[51],cty[51];
double rdx[51],rdy[51];
bool vis[51];

double dist(int a,int b){
	return (rdx[a]-ctx[b])*(rdx[a]-ctx[b])+(rdy[a]-cty[b])*(rdy[a]-cty[b]);
}

int main()
{
    int T;
    int n,m,k;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=n;i++) scanf("%lf%lf",&ctx[i],&cty[i]);
        for(int i=1;i<=m;i++) scanf("%lf%lf",&rdx[i],&rdy[i]);
        double l=0,r=2000;
        while(r-l>eps){
        	double mid=(l+r)/2;
        	g.init(m,n);
        	memset(vis,0,sizeof(vis));
        	int num=0;
        	for(int i=1;i<=m;i++){
        		for(int j=1;j<=n;j++){
        			double dis=dist(i,j);
        			if(dis<=mid*mid){
        				g.Link(i,j);
        				if(!vis[j]){
        					vis[j]=1;
        					num++;
						}
					}
				}
			}
			if(num<n) l=mid;  //当前半径下雷达无法覆盖所有的城市
			else{
				g.ansd=1e9;  
				g.Dance(0);
				if(g.ansd<=k) r=mid;  //需要的雷达数小于等于k
				else l=mid;
			}
		}
		printf("%.6f\n",l);
    }
}