二分图的最优匹配 going home
来源:互联网 发布:大航海时代4 mac版 编辑:程序博客网 时间:2024/05/17 02:26
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
#define MIN(a,b) a<b?a:b
#define INF 99999999
#define MAX 5005
int n,match[MAX];
bool sx[MAX],sy[MAX];
int lx[MAX],ly[MAX],map[MAX][MAX];
char str[105][105];
bool path(int u)
{
sx[u]=true;
for(int v=0;v<n;v++)
if(!sy[v]&&lx[u]+ly[v]==map[u][v])
{
sy[v]=true;
if(match[v]==-1||path(match[v]))
{
match[v]=u;
return true;
}
}
return false;
}
int KM(bool truth)//truth 为真,求最大权匹配;为假,求最小权匹配
{
int i,j;
if(!truth)
{
for(i=0;i<n;i++)
for(j=0;j<n;j++)
map[i][j]=-map[i][j];
}
for(i=0;i<n;i++)
{
lx[i]=-INF;
ly[i]=0;
for(j=0;j<n;j++)
if(lx[i]<map[i][j])
lx[i]=map[i][j];
}
memset(match,-1,sizeof(match));
for(int u=0;u<n;u++)
while(1)
{
memset(sx,0,sizeof(sx));
memset(sy,0,sizeof(sy));
if(path(u))
break;
int dmin=INF;
for(i=0;i<n;i++)
if(sx[i])
for(j=0;j<n;j++)
if(!sy[j])
dmin=MIN(lx[i]+ly[j]-map[i][j],dmin);
for(i=0;i<n;i++)
{
if(sx[i])
lx[i]-=dmin;
if(sy[i])
ly[i]+=dmin;
}
}
int sum=0;
for(j=0;j<n;j++)
sum+=map[match[j]][j];
if(!truth)
{
sum=-sum;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
map[i][j]=-map[i][j];
}
return sum;
}
void Map_Init(int a,int b)
{
int i,j,k,x,tx=0,ty;
for(i=0;i<a;i++)
for(j=0;j<b;j++)
if(str[i][j]=='m')
{
ty=-1;
for(k=0;k<a;k++)
for(x=0;x<b;x++)
if(str[k][x]=='H')
{
ty++;
map[tx][ty]=abs(k-i)+abs(x-j);
}
tx++;
}
}
int main()
{
int a,b,i,j;
while(~scanf("%d%d",&a,&b))
{
if(a==0&&b==0) break;
for(i=0;i<a;i++)
scanf("%s",str[i]);
n=0;
for(i=0;i<a;i++)
for(j=0;j<b;j++)
if(str[i][j]=='m')
n++;
Map_Init(a,b);
int cost=KM(false);
printf("%d\n",cost);
}
return 0;
}
Going Home
Time Limit:1000MS Memory Limit:65536K
Total Submit:45 Accepted:38
Description
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.
Input
There are one or more test cases in the input. Each case starts with a line giving two integers N and M, where N is the number of rows of the map, and M is the number of columns. The rest of the input will be N lines describing the map. You may assume both N and M are between 2 and 100, inclusive. There will be the same number of 'H's and 'm's on the map; and there will be at most 100 houses. Input will terminate with 0 0 for N and M.
Output
For each test case, output one line with the single integer, which is the minimum amount, in dollars, you need to pay.
Sample Input
2 2.mH.5 5HH..m...............mm..H7 8...H.......H.......H....mmmHmmmm...H.......H.......H....0 0
Sample Output
21028
- 二分图的最优匹配 going home
- hdu1533 going home 二分图最优匹配
- POJ 2195 Going Home(二分图最优匹配)
- poj 2195 - Going Home 二分图最优匹配 ek
- POJ 2195 Going Home(二分图最优匹配)
- poj 2195 Going Home(二分图最优匹配KM算法)
- POJ 2195 Going Home(二分图最优匹配)
- POJ 2195 Going Home【KM算法-二分图的最优匹配】
- poj2195 Going Home(二分图的最小权匹配)
- hdu 1533 Going Home 【最小权的二分图匹配】
- 【poj2195】【二分图最佳匹配】Going Home
- POJ2195 Going Home【二分图最佳匹配】
- poj 2195 Going Home 二分图最大权匹配
- POJ2195 Going Home 【最小费用流】+【二分图最佳匹配】
- POJ 2195 - Going Home(二分图最大权匹配)
- HDU-1533 Going Home(二分图匹配)
- poj 2195 going home二分图最大匹配
- HDU 1533 Going Home(最佳二分匹配)
- 继续二维树状数组 pku1195
- hdu 1698 线段树 just a “trick” *_*
- I Hate It
- 嵌入式面试时遇到的几个常见问题
- KM算法,二分图的最优匹配,(也不知道怎么叫了)
- 二分图的最优匹配 going home
- tour hdu 3488 KM
- pku 1149 最大流
- 解析X509证书
- 并查集好题 hdu3038 how many answers are wrong
- HK 算法 模板
- RMAN-01009: syntax error: found “dot”: expecting one of: “double-quoted-string, equal, identifier, s
- hdu 4001今天网络赛的题目。。。
- pku 1703 Find them,Catch them