POJ 2195 Going Home【KM算法-二分图的最优匹配】

最新推荐文章于 2020-08-14 20:52:29 发布

bobten2008

最新推荐文章于 2020-08-14 20:52:29 发布

阅读量1.5k

点赞数

分类专栏：二分图文章标签：算法 each input output integer rest

本文链接：https://blog.csdn.net/bobten2008/article/details/5688261

版权

本文介绍了如何运用KM算法解决POJ 2195 Going Home题目中的二分图最优匹配问题。通过解析输入输出样例，详细阐述了算法的应用过程。

摘要由CSDN通过智能技术生成

Going Home

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8380		Accepted: 4324

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 col