【poj2195】【二分图最佳匹配】Going Home

题意:给定一张地图，其中有人和房子，人每移动一个格子需要1个单位花费，求令所有人都到房子里去的最小花费。

KM的模板题。建立一个二分图，人在左边，房子在右边，对于每个人，和所有房子连边，权值为负的曼哈顿距离(因为KM求的是最大权和)，然后一次KM，再将答案取相反数就行了。

代码:

#include<cstdio>
#include<cstring>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 100 + 10;
struct pnode
{
	int x,y;
}left[maxn],right[maxn];
int lx[maxn],ly[maxn],slack[maxn];
int map[maxn][maxn],link[maxn];
bool visx[maxn],visy[maxn];
int n,m;
int xn,yn;
void init()
{
	freopen("poj2195.in","r",stdin);
	freopen("poj2195.out","w",stdout);
}

int inline abs(int x)
{
	if(x >= 0)return x;
	else return -x;
}

int crosspath(int x)
{
	visx[x] = true;
	for(int y = 1;y <= yn;y++)
	{
		if(visy[y])continue;
		int t = lx[x] + ly[y] - map[x][y];
		if(t == 0)
		{
			visy[y] = true;
			if(link[y] == -1 || crosspath(link[y]))
			{
				link[y] = x;
				return true;
			}
		}
		else if(slack[y] > t)slack[y] = t;
	}
	return false;
}

int KM()
{
	memset(link,-1,sizeof(link));
	memset(ly,0,sizeof(ly));
	for(int i = 1;i <= xn;i++)
	{
		lx[i] = -inf;
		for(int j = 1;j <= yn;j++)
		{
			if(map[i][j] > lx[i])lx[i] = map[i][j];
		}
	}
	for(int x = 1;x <= xn;x++)
	{
		for(int i = 1;i <= yn;i++)slack[i] = inf;
		while(true)
		{
			memset(visx,false,sizeof(visx));
			memset(visy,false,sizeof(visy));
			if(crosspath(x))break;
			int d = inf;
			for(int i = 1;i <= yn;i++)
			{
				if(!visy[i] && slack[i] < d)d = slack[i];
			}
			for(int i = 1;i <= xn;i++)
			{
				if(visx[i])lx[i] -= d;
			}
			for(int i = 1;i <= yn;i++)
			{
				if(visy[i])ly[i] += d;
				else slack[i] -= d;
			}
		}
	}
	int ret = 0;
	for(int i = 1;i <= yn;i++)
	{
		if(link[i] > -1)ret += map[link[i]][i];
	}
	return ret;
}

void solve()
{
	memset(map,0,sizeof(map));
	for(int i = 1;i <= xn;i++)
	{
		for(int j = 1;j <= yn;j++)
		{
			map[i][j] = -(abs(left[i].x - right[j].x) + abs(left[i].y - right[j].y));
		}
	}
	printf("%d\n",-KM());
}

void readdata()
{
	while(scanf("%d%d\n",&n,&m) != EOF)
	{
		xn = 0,yn = 0;
		if(n == 0 && m == 0)break;
		for(int i = 1;i <= n;i++)
		{
			for(int j = 1;j <= m;j++)
			{
				char s;
				scanf("%c",&s);
				if(s == 'm')
				{
					xn++;
					left[xn].x = i;
					left[xn].y = j;
				}
				else if(s == 'H')
				{
					yn++;
					right[yn].x = i;
					right[yn].y = j;
				}
			}
			scanf("\n");
		}
		solve();
	}
}

int main()
{
	init();
	readdata();
	return 0;
}