2 4 2 1 1 1 2 2 3 2 4 4 1 1 1 1 2 2 3 2 4
1.000000 2.236068
//
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define eps 1e-8
#define N 85
#define V 36000
int n,m,K;//n行 m列 K限制条件,最多用K行(仅限于此题)
int L[V],R[V];
int D[V],U[V];
int C[V];
int S[N],H[N];
int ak,size;//ak 最少多少行可以覆盖所有列(可重复)
double dis(double x1,double y1,double x2,double y2)
{
return sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));
}
void Link(int r,int c)
{
S[c]++;C[size]=c;
U[size]=U[c];D[U[c]]=size;
D[size]=c;U[c]=size;
if(H[r]==-1) H[r]=L[size]=R[size]=size;
else
{
L[size]=L[H[r]];R[L[H[r]]]=size;
R[size]=H[r];L[H[r]]=size;
}
size++;
}
void remove(int c)
{
int i;
for(i=D[c];i!=c;i=D[i])
L[R[i]]=L[i],R[L[i]]=R[i];
}
void resume(int c)
{
int i;
for(i=U[c];i!=c;i=U[i])
L[R[i]]=R[L[i]]=i;
}
int h()
{
int i,j,k,count=0;
bool visit[N];
memset(visit,0,sizeof(visit));
for(i=R[0];i;i=R[i])
{
if(visit[i]) continue;
count++;
visit[i]=1;
for(j=D[i];j!=i;j=D[j])
{
for(k=R[j];k!=j;k=R[k])
visit[C[k]]=1;
}
}
return count;
}
void Dance(int k)
{
int i,j,c,Min,ans;
ans=h();
if(k+ans>K) return ;//仅限于此题
if(k+ans>=ak) return;
if(!R[0])
{
if(k<ak) ak=k;
return;
}
for(Min=N,i=R[0];i;i=R[i])
if(S[i]<Min) Min=S[i],c=i;
for(i=D[c];i!=c;i=D[i])
{
remove(i);
for(j=R[i];j!=i;j=R[j])
remove(j);
Dance(k+1);
for(j=L[i];j!=i;j=L[j])
resume(j);
resume(i);
}
return;
}
double d[66][66];
double dl[66*66];
int main()
{
int i,j,ncase;
double x[N],y[N];
int left,right,mid;
double ans;
scanf("%d",&ncase);
while(ncase--)
{
int tn;
//村庄当成列tn,救火站当成行tn 最多用K个救火站
scanf("%d%d",&tn,&K);
n=m=tn;
for(i=1;i<=m;i++)
scanf("%lf%lf",&x[i],&y[i]);
int num = 0;
for (i = 1; i <= n; ++i) {
for (j = i; j <= m; ++j) {
d[i][j] = d[j][i] = dl[num++] = dis(x[i],y[i],x[j], y[j]);
}
}
//二分答案这里要注意:如果直接left=0,right=(1<<30)直接二分 会超时
//这里要把所有距离先排序 二分枚举这些距离 AC
sort(dl, dl + num);
num = unique(dl, dl + num) - dl;
left=0;
right= num-1;
ans=dl[right];
while(left<right)
{
//DLX
for(i=0;i<=m;i++)
{
S[i]=0;
U[i]=D[i]=i;
L[i+1]=i;R[i]=i+1;
}R[m]=0;
memset(H,-1,sizeof(H));
size=m+1;
mid=(left+right)/2;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
if(dl[mid]>=d[i][j]) Link(i,j);
}
ak=N;
Dance(0);
//......
if(ak<=K) {ans=min(ans,dl[mid]);right=mid;}
else left=mid+1;
}
printf("%.6lf\n",ans);
}
return 0;
}