HDU2295 Radar(舞蹈链重复覆盖,二分)

Radar

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4032    Accepted Submission(s): 1544

Problem Description

N cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar stations but only K operators, we can at most operate K radars. All radars have the same circular coverage with a radius of R. Our goal is to minimize R while covering the entire city with no more than K radars.

 

Input

The input consists of several test cases. The first line of the input consists of an integer T, indicating the number of test cases. The first line of each test case consists of 3 integers: N, M, K, representing the number of cities, the number of radar stations and the number of operators. Each of the following N lines consists of the coordinate of a city.
Each of the last M lines consists of the coordinate of a radar station.

All coordinates are separated by one space.
Technical Specification

1. 1 ≤ T ≤ 20
2. 1 ≤ N, M ≤ 50
3. 1 ≤ K ≤ M
4. 0 ≤ X, Y ≤ 1000

 

Output

For each test case, output the radius on a single line, rounded to six fractional digits.

 

Sample Input

  
  

   
   1
3 3 2
3 4
3 1
5 4
1 1
2 2
3 3
  
  

 

Sample Output

  
  

   
   2.236068
  
  

 

Source

The 4th Baidu Cup final

 

给n个点,m个圆心,从m个圆心中选出k个,问最小的半径使得所有的点都被覆盖.

二分半径,遍历所有的圆心,m个圆心看成m行,n个点看成n列,可以覆盖的位置再矩阵中置为1,做<=K的重复覆盖

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
const double INF=1e5+7;
const double EPS=1e-10;
const int maxnode = 3000;
const int MaxM = 55;
const int MaxN = 55;
int K;
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;
    }
};
int n,m;
DLX g;
const int MAXN=1010;
double x[MAXN],y[MAXN];
double t[MAXN],tt[MAXN];
bool C(double s){
    g.init(m,n);
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            double dis=(t[i]-x[j])*(t[i]-x[j])+(tt[i]-y[j])*(tt[i]-y[j]);
            if(dis<s*s||fabs(dis-s*s)<EPS){
                g.Link(i+1,j+1);
            }
        }
    }
    //cout<<g.Dance(0)<<endl;
    return g.Dance(0);
}


int main(){
    int ttt;
    scanf("%d",&ttt);
    while(ttt--){
        scanf("%d%d%d",&n,&m,&K);
        for(int i=0;i<n;i++){
            scanf("%lf%lf",x+i,y+i);
        }
        for(int j=0;j<m;j++){
            scanf("%lf%lf",t+j,tt+j);
        }
        double l=0,r=INF;
        for(int i=0;i<100;i++){
            double m=(l+r)/2.0;
            if(C(m))
                r=m;
            else
                l=m;
        }
        printf("%.6f\n",l);
    }
}