题目大意
在一个矩阵中有一些点,要分成两半到两个点集合,求走的路的和最少的两个集合点。
题解
可以用bfs求出两点之间的花费,枚举两个集合点,先让他们都到一个点集合,按改变集合点花费排序,安排一般的点转移即可。
code
#include<set>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,j,k) for(int i=j;i<=k;i++)
#define fd(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
int const maxn=200,maxrc=400,maxr=20;
int n,r,c,inf,num[maxr+10][maxr+10],pos[maxn+10],dis[maxrc+10][maxrc+10],queue[maxrc+10],
w[8][2]={{1,2},{1,-2},{-1,2},{-1,-2},{2,1},{2,-1},{-2,1},{-2,-1}},a[maxn+10];
bool inqueue[maxrc+10];
multiset<int>s;
int main(){
freopen("d.in","r",stdin);
freopen("d.out","w",stdout);
scanf("%d%d%d",&n,&r,&c);
fo(i,1,r)
fo(j,1,c)
num[i][j]=(i-1)*c+j;
fo(i,1,n){
int x,y;scanf("%d%d",&x,&y);
pos[i]=num[x][y];
}
memset(dis,63,sizeof(dis));inf=dis[0][0];
fo(i,1,r)
fo(j,1,c){
int head=0,tail=0;
dis[num[i][j]][num[i][j]]=0;
inqueue[queue[++tail]=num[i][j]]=1;
for(;head!=tail;){
int x=(queue[++head]-1)/c+1,y=(queue[head]-1)%c+1;
inqueue[queue[head]]=0;
fo(k,0,7)
if((1<=x+w[k][0])&&(x+w[k][0]<=r)&&(1<=y+w[k][1])&&(y+w[k][1]<=c)&&
(dis[num[i][j]][queue[head]]+1<dis[num[i][j]][num[x+w[k][0]][y+w[k][1]]])){
dis[num[i][j]][num[x+w[k][0]][y+w[k][1]]]=dis[num[i][j]][queue[head]]+1;
if(!inqueue[num[x+w[k][0]][y+w[k][1]]])
inqueue[queue[++tail]=num[x+w[k][0]][y+w[k][1]]]=1;
}
}
}
int ans=inf;
fo(i,1,r*c)
fo(j,i+1,r*c){
int tmp=0,ok=1;
fo(k,1,n)
if(dis[pos[k]][i]!=inf){
tmp+=dis[pos[k]][i];
a[k]=dis[pos[k]][j]-dis[pos[k]][i];
}else{
ok=0;
break;
}
if(!ok)continue;
sort(a+1,a+n+1);
fo(k,1,n/2)
if(a[k]<=maxrc)tmp+=a[k];
else{
ok=0;
break;
}
if(!ok)continue;
ans=min(ans,tmp);
}
printf("%d",ans);
return 0;
}