Going Home

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 2829    Accepted Submission(s): 1423

Problem 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

 

#include 
       
        #include 
        
         #include 
         
          #include 
          
           #define N 110#define INF 99999999int n, m;char map[N][N]; //存储原始字符地图的int ma[N][N];  //类似边表的可匹配存储int lx[N], ly[N];int vtx[N], vty[N];int match[N];int slack[N];int cnt;int max(int a, int b){    return a>b?a:b;}int min(int a, int b){    return a>b?b:a;}int hungary(int dd) //匈牙利算法{    int i;    vtx[dd]=1;    for(i=0; i
          
         
        
       

 

 

#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #define N 110using namespace std;char maps[N][N]; //存储原始字符地图的int map[N][N]; //类似边表的可匹配存储int lx[N], ly[N];int slack[N];int match[N];bool visitx[N], visity[N];int n;bool Hungary( int u ) //匹配{	int i ;    visitx[u] = true;    for( i=0; i < n; ++i)    {        if(visity[i]==true )            continue;        else        {            if(lx[u] + ly[i] == map[u][i] )            {                visity[i] = true;                if(match[i] == -1 || Hungary(match[i]) )                {                    match[i] = u;                    return true;                }            }            else                slack[i] = min(slack[i], lx[u] + ly[i]-map[u][i] );        }    }    return false;}void KM_perfect_match() //匈牙利算法{    int temp;    memset(lx, 0, sizeof(lx)); // 清零？？    memset(ly, 0, sizeof(ly)); // 清零？？    for(int i=0; i