2 shunfurh 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
caozhy   Ds   Rxr 2017.01.14 23:51
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
poj-2195-Going Home(最小费用最大流模板题)
传送门最小费用最大流模板题意: 有n个人和n个房子,让每个人都回到一个房子里面,使得所有人走的步数和最小 建图:源点0,汇点:2*n+1,从源点到汇点建立一个容量为1,费用为0 的一条边,从每个房子到汇点建立一个容量为1,费用为0 的一条边;每个人到每个房子建立一条容量为1,费用为两者距离的边。图建好之后就可以直接求最小费用最大流了#include <iostream> #include <
【最小费用最大流】【HDU1533】【Going Home】
题意  给你一个类似这样的图 ...H.... ...H.... ...H.... mmmHmmmm ...H.... ...H.... ...H.... 问所有H移动到所有m上花费最少的步数 以所有H 到 所有m 连一条边,边的权重为2者距离,这样其实就是一个二分图带权匹配 也可以用KM算法来做 网络流做法
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 最小费用最大流
最小费用最大流,KM
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(最小费用最大流)
题意:有n个人,n个房子,一个人每走一步(可上、下、左、右取一个方向)花费1美元,问让这n个人走到n个房子里最少需要多少美元(n 题目链接:http://poj.org/problem?id=2195 ——>>在学最小费用最大流,找模版题找到了这道。 建图:1到n为人的编号,n+1到2*n为房子的编号,另加上源点0和汇点2*n+1; 源点到每个人各建立一条容量为1的流,费用为0; 每个
Going Home
点击打开链接 题意:在一张N * M 的图中,有 n个房子和n个人。问最少使用多少总步数让每个房子都有且仅有一个人. 解析:构图。选取源点和汇点,从源点到人连通,费用为0(因为题目要求的是人到房子的费用)。以第i个人与第j所房子的距离作为当前费用进行构图,由于题目并不需要求出最大流( 也没给出来),因此所有连通路径的流量设置为一个相同的权值即可。 然后使用费用流求出最小费用。 #inclu