二分图匹配(最小费用完美匹配) poj 2195 GoingHome

Going Home

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9224		Accepted: 4752

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
.m
H.
5 5
HH..m
.....
.....
.....
mm..H
7 8
...H....
...H....
...H....
mmmHmmmm
...H....
...H....
...H....
0 0

Sample Output

2
10
28

题目大意：n个人到m个房子分布在在坐标轴的不同位置,求解n个人到m间房子的最小花费(人可以上下左右移动,每移动一次就花费$1)；

题目解答：这是一道二分最大匹配问题，由于题目特殊性(n==m)最大匹配就是完备匹配.接下来就是转化成二分图的问题,将n个人归为X集合

m个房屋归为Y集合,增加一个源点和汇点,寻找一条最小花费的最大匹配（可以采用队列实现的bellman算法(SPFA)寻找一条最短路的增广路径）代替dfs寻找的增广路径就ok了.

代码技巧：struct {i,j}记录坐标,便于后面计算距离(花费).dis[mi][mi+hi]就是第i个人到第hi个房子的距离(花费),c[x][y]=0,1表示参与流量也因为都只有0和1.

               d[x]当前增广路径中源点S到x点的当前最短距离.

Source Code
 
 
 

  

   

    
Problem: 2195
    
 
    
User: wawadimu
   
   

    
Memory: 608K
    
 
    
Time: 79MS
   
   

    
Language: C++
    
 
    
Result: Accepted
   
  
 

 

• Source Code

  #include<iostream>
  #include<algorithm>
  #include<queue>
  using namespace std;
  
  #define inf INT_MAX
  #define maxn 110
  struct node
  {
       
  	int i,j;