shunfurh 于 2017.01.14 23:39 提问

Going Home

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

1个回答

caozhy      2017.01.14 23:51

poj-2195-Going Home(最小费用最大流模板题)

【最小费用最大流】【HDU1533】【Going Home】

HDU 1533 Going Home(最小费用流)
Going Home Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3278    Accepted Submission(s): 1661 Problem Description On a grid map ther
poj Going Home
Going Home   题目：    给出一个N*M的图，图上的m表示人，H表示房子，每座房子只能有一个人，要求你所有人到房子中总步数最少。m个数与H个数一样多。   算法分析：    这个题目还是比较裸的。可以想到先求出每个人到每座房子的距离。然后求出最小花费，这个好像就是最小费用流吧？一开始用了KM写完后，发现。。。。哪里不对啊？后来才觉悟，原来题目是求解最小花费，KM是最大匹配
ACM->poj 2195 Going Home
Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 16177   Accepted: 8275 Description On a grid map there are n little men and n houses. In each unit time, every little
POJ 2195 Going Home 最小费用最大流

hdu acm 1533 Going Home
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3798    Accepted Submission(s): 1946 Problem Description On a grid map there are n litt
poj-2195 Going Home（费用流）
Going HomeTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 24304Accepted: 12198DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one un...
poj - 2195 - Going Home（最小费用最大流）

Going Home