题意:给定n个城市的坐标,要在城市中建k个飞机场,使任意城市距离最近的飞机场的最大值最小,求这个最小距离。
思路:最大值最小化是典型二分条件,然后就是如何check,将每对距离小于二分值的两个机场称为互相可覆盖,构造n * n的矩阵,机场之间有覆盖关系的置为1,否则为0,则转化为DLX求解矩阵可重复覆盖问题。
DLX精确覆盖详解:点击打开链接 (想不会都难)
DLX重复覆盖与精确覆盖:点击打开链接
然后就是本题如果纯套模板的话还是很卡时间上限的,但是只要稍微理解模板的思路,改改递归条件就能快3-5倍时间,学算法还是不能只会用模板啊!
emmmm,模板是我从网上扒的,重复覆盖和精确覆盖写在一起了,还是挺好用的。
代码(纯模板1045ms):
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
const int inf = 0x3f3f3f3f;
struct DLX{
const static int maxn=3636;
#define FF(i,A,s) for(int i = A[s];i != s;i = A[i])
int L[maxn],R[maxn],U[maxn],D[maxn];
int size,col[maxn],row[maxn],s[maxn],H[maxn];
bool vis[66];
int ans[maxn],cnt;
void init(int m){
for(int i=0;i<=m;i++){
L[i]=i-1;R[i]=i+1;U[i]=D[i]=i;s[i]=0;
}
memset(H,-1,sizeof(H));
L[0]=m;R[m]=0;size=m+1;
}
void link(int r,int c){
U[size]=c;D[size]=D[c];U[D[c]]=size;D[c]=size;
if(H[r]<0)H[r]=L[size]=R[size]=size;
else {
L[size]=H[r];R[size]=R[H[r]];
L[R[H[r]]]=size;R[H[r]]=size;
}
s[c]++;col[size]=c;row[size]=r;size++;
}
void del(int c){//精确覆盖
L[R[c]]=L[c];R[L[c]]=R[c];
FF(i,D,c)FF(j,R,i)U[D[j]]=U[j],D[U[j]]=D[j],--s[col[j]];
}
void add(int c){ //精确覆盖
R[L[c]]=L[R[c]]=c;
FF(i,U,c)FF(j,L,i)++s[col[U[D[j]]=D[U[j]]=j]];
}
bool dfs(int k){//精确覆盖
if(!R[0]){
cnt=k;return 1;
}
int c=R[0];FF(i,R,0)if(s[c]>s[i])c=i;
del(c);
FF(i,D,c){
FF(j,R,i)del(col[j]);
ans[k]=row[i];if(dfs(k+1))return true;
FF(j,L,i)add(col[j]);
}
add(c);
return 0;
}
void remove(int c){//重复覆盖
FF(i,D,c)L[R[i]]=L[i],R[L[i]]=R[i];
}
void resume(int c){//重复覆盖
FF(i,U,c)L[R[i]]=R[L[i]]=i;
}
int A(){//估价函数
int res=0;
memset(vis,0,sizeof(vis));
FF(i,R,0)if(!vis[i]){
res++;vis[i]=1;
FF(j,D,i)FF(k,R,j)vis[col[k]]=1;
}
return res;
}
void dfs(int now,int &ans){//重复覆盖
if(R[0]==0)ans=min(ans,now);
else if(now+A()<ans){
int temp = inf,c;
FF(i,R,0)if(temp>s[i])temp=s[i],c=i;
FF(i,D,c){
remove(i);FF(j,R,i)remove(j);
dfs(now+1,ans);
FF(j,L,i)resume(j);resume(i);
}
}
}
};
DLX AC;
P city[66];
ll dis[66][66], val[3636];
bool check(ll w, int n, int k)
{
AC.init(n);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(dis[i][j] <= w)
AC.link(i, j);
int ans = inf;
AC.dfs(0, ans);
return ans <= k;
}
int main()
{
int T, n, k, kase = 1;
cin >> T;
while(T--)
{
int cnt = 0;
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++)
{
scanf("%lld %lld", &city[i].first, &city[i].second);
for(int j = 1; j <= i; j++)
dis[i][j] = dis[j][i] = val[cnt++] = fabs(city[i].first - city[j].first) + fabs(city[i].second - city[j].second);
}
sort(val, val + cnt);
cnt = unique(val, val + cnt) - val;
int l = 0, r = cnt - 1, mid;
while(l <= r)
{
mid = (l + r) >> 1;
if(check(val[mid], n, k)) r = mid - 1;
else l = mid + 1;
}
printf("Case #%d: %lld\n", kase++, val[r + 1]);
}
}
代码(稍加修饰,156ms):
#include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> P;
const int inf = 0x3f3f3f3f;
int aim;
struct DLX{
const static int maxn=3636;
#define FF(i,A,s) for(int i = A[s];i != s;i = A[i])
int L[maxn],R[maxn],U[maxn],D[maxn];
int size,col[maxn],row[maxn],s[maxn],H[maxn];
bool vis[66];
int ans[maxn],cnt;
void init(int m){
for(int i=0;i<=m;i++){
L[i]=i-1;R[i]=i+1;U[i]=D[i]=i;s[i]=0;
}
memset(H,-1,sizeof(H));
L[0]=m;R[m]=0;size=m+1;
}
void link(int r,int c){
U[size]=c;D[size]=D[c];U[D[c]]=size;D[c]=size;
if(H[r]<0)H[r]=L[size]=R[size]=size;
else {
L[size]=H[r];R[size]=R[H[r]];
L[R[H[r]]]=size;R[H[r]]=size;
}
s[c]++;col[size]=c;row[size]=r;size++;
}
void del(int c){//精确覆盖
L[R[c]]=L[c];R[L[c]]=R[c];
FF(i,D,c)FF(j,R,i)U[D[j]]=U[j],D[U[j]]=D[j],--s[col[j]];
}
void add(int c){ //精确覆盖
R[L[c]]=L[R[c]]=c;
FF(i,U,c)FF(j,L,i)++s[col[U[D[j]]=D[U[j]]=j]];
}
bool dfs(int k){//精确覆盖
if(!R[0]){
cnt=k;return 1;
}
int c=R[0];FF(i,R,0)if(s[c]>s[i])c=i;
del(c);
FF(i,D,c){
FF(j,R,i)del(col[j]);
ans[k]=row[i];if(dfs(k+1))return true;
FF(j,L,i)add(col[j]);
}
add(c);
return 0;
}
void remove(int c){//重复覆盖
FF(i,D,c)L[R[i]]=L[i],R[L[i]]=R[i];
}
void resume(int c){//重复覆盖
FF(i,U,c)L[R[i]]=R[L[i]]=i;
}
int A(){//估价函数
int res=0;
memset(vis,0,sizeof(vis));
FF(i,R,0)if(!vis[i]){
res++;vis[i]=1;
FF(j,D,i)FF(k,R,j)vis[col[k]]=1;
}
return res;
}
bool Dance(int now){//重复覆盖
if(now + A() > aim) return 0;
if(R[0]==0) return now <= aim;
int temp = inf,c;
FF(i,R,0)if(temp>s[i])temp=s[i],c=i;
FF(i,D,c){
remove(i);FF(j,R,i)remove(j);
if(Dance(now+1)) return 1;
FF(j,L,i)resume(j);resume(i);
}
return 0;
}
};
DLX AC;
P city[66];
ll dis[66][66], val[3636];
bool check(ll w, int n, int k)
{
AC.init(n);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(dis[i][j] <= w)
AC.link(i, j);
aim = k;
return AC.Dance(0);
}
int main()
{
int T, n, k, kase = 1;
cin >> T;
while(T--)
{
int cnt = 0;
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++)
{
scanf("%lld %lld", &city[i].first, &city[i].second);
for(int j = 1; j <= i; j++)
dis[i][j] = dis[j][i] = val[cnt++] = fabs(city[i].first - city[j].first) + fabs(city[i].second - city[j].second);
}
sort(val, val + cnt);
cnt = unique(val, val + cnt) - val;
int l = 0, r = cnt - 1, mid;
while(l <= r)
{
mid = (l + r) >> 1;
if(check(val[mid], n, k)) r = mid - 1;
else l = mid + 1;
}
printf("Case #%d: %lld\n", kase++, val[r + 1]);
}
}