//二分图的最小权匹配
//将权值以及顶标初始化为负,最后取反就好
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
#define clr(a) memset(a,0,sizeof(a));
const int N=300;
const int INF=0x3fffffff;
int G[204][204];
struct KM{
int lx[N],ly[N];//顶标
int visx[N],visy[N];
int line[N];
int we[N];//已配对所对应边权值
int nx,ny;
int slack;
bool find(int u){
visx[u]=true;
for(int v=1;v<=ny;v++){
if(!visy[v])//v不在相等子图中
{
int t=lx[u]+ly[v]-G[u][v];
if(t==0){
visy[v]=1;
if(line[v]==-1||find(line[v])){
line[v]=u;
we[v]=G[u][v];
return 1;
}
}
else if(t<slack)
slack=t;
}
}
return 0;
}
bool km(){//返回是否完备匹配
//clr(lx);clr(ly);
memset(lx, -INF, sizeof(lx));//初始化为负
memset(ly, -INF, sizeof(ly));
memset(line,-1,sizeof(line));
for(int i=1;i<=nx;i++){
for(int j=1;j<=ny;j++){
if(G[i][j]>lx[i])
lx[i]=G[i][j];//初始化为xi所连接的最大权值
}
}
for(int u=1;u<=nx;u++)
{
while(true){
slack=INF;
clr(visx);clr(visy);
if(find(u))break;
if(slack==INF)return 0;
for(int i=1;i<=nx;i++){
if(visx[i])lx[i]-=slack;
}
for(int i=1;i<=ny;i++){
if(visy[i])ly[i]+=slack;
}
}
}
return 1;
}
int best_match(){
int res=0;
km();
for(int u=1;u<=ny;u++){
if(line[u]==-1)continue;
res+=we[u];
}
return res;
}
}kk;
char map[210][210];
int person[110];
int house[110];
int main(){
int n,m;
while(scanf("%d%d",&n,&m),n||m){
for(int i=0;i<n;i++)
scanf("%s",map[i]);
int sumh=0,summ=0;
memset(G,0,sizeof(G));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(map[i][j]=='H')
house[++sumh]=i*m+j;
if(map[i][j]=='m')
person[++summ]=i*m+j;
}
}
kk.nx=kk.ny=sumh;
for(int i=1;i<=kk.nx;i++){
for(int j=1;j<=kk.ny;j++){
int x1=person[i]/m,y1=person[i]%m;
int x2=house[j]/m,y2=house[j]%m;
G[i][j]=-(abs(x1-x2)+abs(y1-y2));
}
}
printf("%d\n",-kk.best_match());
}
return 0;
}
poj2195 Going Home(二分图的最小权匹配)
最新推荐文章于 2019-11-14 20:41:36 发布