题目大意:
有一个n*m的大小地图,图上有相等数量的小矮人和房子,每个小矮人只能水平或垂直走,小矮人每移动一步要花费一美元,每个房子只能容纳一个人,问要让所有小矮人都进房子里的最小花费是多少。
这是我做的第一个费用流,还不清楚是不是有什么优化方法,吼吼。。。。。
代码实现:
#include<cstdio>
#include<cstring>
#include<queue>
#include<iostream>
#define Abs(x,y) ((x)>(y)?((x)-(y)):((y)-(x)))
#define Min(x,y) ((x)<(y)?(x):(y))
using namespace std;
const int N=210;
const int M=20410;
const int INF=0x3f3f3f3f;
int n,m,top,s,t,pre[N],head[N],man[105][2],house[105][2],dis[N],vis[N],path[N];
char mp[105][105];
struct Edge{
int to,next,flow,cost;
Edge(int _to=0,int _next=0,int _flow=0,int _cost=0):to(_to),next(_next),flow(_flow),cost(_cost){}
}edge[M];
void Addedge(int from,int to,int flow,int cost){
edge[top]=Edge(to,head[from],flow,cost);
head[from]=top++;
edge[top]=Edge(from,head[to],0,-cost);
head[to]=top++;
}
int Spfa(){
queue<int> q;
memset(dis,0x3f,sizeof(dis));
memset(vis,0,sizeof(vis));
memset(pre,-1,sizeof(pre));
q.push(s);
dis[s]=0;
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=0;
for(int i=head[u];i+1;i=edge[i].next){
if(edge[i].flow&&dis[edge[i].to]>dis[u]+edge[i].cost){
dis[edge[i].to]=dis[u]+edge[i].cost;
pre[edge[i].to]=u;
path[edge[i].to]=i;
if(!vis[edge[i].to]){
vis[edge[i].to]=1;
q.push(edge[i].to);
}
}
}
}
if(dis[t]==INF) return 0;
return 1;
}
int min_cost_max_flow(){
int sum=0;
while(Spfa()){
int minflow=INF;
for(int i=t;i!=s;i=pre[i])
minflow=Min(minflow,edge[path[i]].flow);
for(int i=t;i!=s;i=pre[i]){
int tmp=path[i];
edge[tmp].flow-=minflow;
edge[tmp^1].flow+=minflow;
}
sum+=dis[t];
}
return sum;
}
int main(){
while(~scanf("%d%d",&n,&m),(n||m)){
int c1=0,c2=0;
memset(head,-1,sizeof(head));
top=0,s=0;
for(int i=0;i<n;++i){
scanf("%s",mp[i]);
for(int j=0;j<m;++j){
if(mp[i][j]=='m') man[++c1][0]=i,man[c1][1]=j;
if(mp[i][j]=='H') house[++c2][0]=i,house[c2][1]=j;
}
}
t=c1+c2+1;
for(int i=1;i<=c1;++i){
Addedge(s,i,1,0);
for(int j=1;j<=c2;++j){
int dis=Abs(man[i][0],house[j][0])+Abs(man[i][1],house[j][1]);
Addedge(i,j+c1,1,dis);
}
Addedge(i+c1,t,1,0);
}
int res=min_cost_max_flow();
printf("%d\n",res);
}
}