On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to pay a $1 travel fee for every step he moves, until he enters a house. The task is complicated with the restriction that each house can accommodate only one little man.
Your task is to compute the minimum amount of money you need to pay in order to send these n little men into those n different houses. The input is a map of the scenario, a '.' means an empty space, an 'H' represents a house on that point, and am 'm' indicates there is a little man on that point.
You can think of each point on the grid map as a quite large square, so it can hold n little men at the same time; also, it is okay if a little man steps on a grid with a house without entering that house.
Your task is to compute the minimum amount of money you need to pay in order to send these n little men into those n different houses. The input is a map of the scenario, a '.' means an empty space, an 'H' represents a house on that point, and am 'm' indicates there is a little man on that point.
You can think of each point on the grid map as a quite large square, so it can hold n little men at the same time; also, it is okay if a little man steps on a grid with a house without entering that house.
2 2 .m H. 5 5 HH..m ..... ..... ..... mm..H 7 8 ...H.... ...H.... ...H.... mmmHmmmm ...H.... ...H.... ...H.... 0 0
2 10 28
- 题意就是同等个数的m和H,让每个m走到H里,每步花费1,求最小的花费
- //首先预处理图,分离出m和H,然后从超级源点向每个m连边,容量1,花费0,从每个H向超级汇点连边,容量1,花费0,从每个m向每个H连边,容量1,花费为它们之间的步数,然后套模板求出最小费用流即是答案
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int N = 1e3+10;
const int inf = 0x3f3f3f3f;
typedef pair<int,int>P;
char str[N];
struct node
{
int x, y;
}v1[N], v2[N];
struct edge
{
int to, cap, cost, rev;
};
vector<edge>p[N];
void add(int u,int v,int cap,int w)
{
edge e;
e.to=v, e.cap=cap, e.cost=w, e.rev=p[v].size();
p[u].push_back(e);
e.to=u, e.cap=0, e.cost=-w, e.rev=p[u].size()-1;
p[v].push_back(e);
return ;
}
int d[N], h[N], prev1[N], pree[N];
int min_cost_flow(int s,int t,int f)
{
int res=0;
memset(h,0,sizeof(h));
while(f>0)
{
fill(d,d+t+1,inf);
priority_queue< P, vector<P>, greater<P> >q;
q.push(P(0,s));
d[s]=0;
while(!q.empty())
{
P x=q.top();q.pop();
int w=x.first, u=x.second;
if(d[u]<w) continue;
for(int i=0;i<p[u].size();i++)
{
int v=p[u][i].to;
w=p[u][i].cost;
if(p[u][i].cap>0&&d[v]>d[u]+w+h[u]-h[v])
{
d[v]=d[u]+w+h[u]-h[v];
prev1[v]=u, pree[v]=i;
q.push(P(d[v],v));
}
}
}
if(d[t]==inf) return -1;
for(int i=0;i<=t;i++) h[i]+=d[i];
int flow=f;
for(int i=t;i!=s;i=prev1[i])
{
flow=min(flow,p[prev1[i]][pree[i]].cap);
}
f-=flow, res+=(h[t]*flow);
for(int i=t;i!=s;i=prev1[i])
{
edge &e=p[prev1[i]][pree[i]];
e.cap-=flow;
p[e.to][e.rev].cap+=flow;
}
}
return res;
}
int main()
{
int n, m;
while(scanf("%d %d", &n, &m),m||n)
{
int cnt1=0, cnt2=0;
for(int i=0;i<n;i++)
{
scanf("%s",str);
for(int j=0;j<m;j++)
{
if(str[j]=='m') v1[cnt1].x=i+1, v1[cnt1++].y=j+1;
else if(str[j]=='H') v2[cnt2].x=i+1, v2[cnt2++].y=j+1;
}
}
int s=2*cnt1, t=s+1;
for(int i=0;i<cnt1;i++)
{
add(s,i,1,0);
for(int j=0;j<cnt2;j++)
{
int w=abs(v1[i].x-v2[j].x)+abs(v1[i].y-v2[j].y);
add(i,cnt1+j,1,w);
}
}
for(int i=0;i<cnt2;i++) add(i+cnt1,t,1,0);
int x=min_cost_flow(s, t,cnt1);
printf("%d\n",x);
for(int i=0;i<=t;i++) p[i].clear();
}
return 0;
}