HDU--1533--Going Home--KM算法
Going Home
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.
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.
2 2
.m
H.
5 5
HH..m
.....
.....
.....
mm..H
7 8
...H....
...H....
...H....
mmmHmmmm
...H....
...H....
...H....
0 0
2
10
28
#include <iostream>
#include <cstring>
#define MAX (1<<30)
#define MIN -MAX
using namespace std;
struct ssss
{
int x,y;
};
ssss s1[111],s2[111];
int n,m,l1,l2,map[111][111];
int rode[111],r[111];
bool vx[111],vy[111];
int sx[111],sy[111];
int dfs(int x)
{
vx[x]=1; //标记增广路左边已訪问的点
int i,j,k,l;
for(i=0;i<l2;i++)
if(!vy[i])
{
k=sx[x]+sy[i]-map[x][i];
if(k==0)
{
vy[i]=1;//訪问它再标记已訪问
if(rode[i]==-1||dfs(rode[i])) //假设右边的点没有匹配或者有匹配(继续用他的匹配点继续找)
{
rode[i]=x; //记录右边点匹配到的左边点的序号
return 1;
}
}else if(r[i]>k)r[i]=k; //记录右端点没訪问的边的最小差值。用来导入
}
return 0;
}
int Dinic()
{
int i,j,k,l;
memset(sy,0,sizeof(sy)); //标记右端点权值
memset(rode,-1,sizeof(rode)); //右端点匹配点初始化为-1
for(i=0;i<l1;i++)
{
sx[i]=MIN;
for(j=0;j<l2;j++)
sx[i]=max(sx[i],map[i][j]); //左端点权值取最大的边的值
}
for(i=0;i<l1;i++)
{
for(j=0;j<l2;j++)r[j]=MAX;
while(1)
{
memset(vx,0,sizeof(vx)); //訪问标记初始化
memset(vy,0,sizeof(vy));
if(dfs(i))break; //匹配到了就结束
k=MAX;
for(j=0;j<l2;j++)
if(!vy[j])k=min(k,r[j]); //不然导入差值最小的边(这是保证匹配的总值从最大逐渐减小)
for(j=0;j<l1;j++)
if(vx[j])sx[j]-=k; //左端点权值减小
for(j=0;j<l2;j++)
if(vy[j])sy[j]+=k; //右端点权值曾加
//这样导入了边之后其它匹配不变x+y=(x-k)+(y+k)
}
}
for(i=k=0;i<l2;i++)
k+=map[rode[i]][i];
return -k;
}
int bb(int x)
{
return x>0?x:-x;
}
int main (void)
{
int i,j,k,l;
char c;
while(cin>>n>>m&&n)
{
l1=l2=0;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
cin>>c;
if(c=='m')
{
s1[l1].x=i;
s1[l1].y=j;
l1++;
}
if(c=='H')
{
s2[l2].x=i;
s2[l2].y=j;
l2++;
}
}
for(i=0;i<l1;i++)
for(j=0;j<l2;j++)
{
k=bb(s1[i].x-s2[j].x)+bb(s1[i].y-s2[j].y);
map[i][j]=(k<0?k:-k);
}
cout<<Dinic()<<endl;
}
return 0;
}
HDU--1533--Going Home--KM算法的更多相关文章
- hdu 1533 Going Home (KM)
Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total ...
- [ACM] HDU 1533 Going Home (二分图最小权匹配,KM算法)
Going Home Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Tota ...
- hdu 2255 奔小康赚大钱--KM算法模板
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2255 题意:有N个人跟N个房子,每个人跟房子都有一定的距离,现在要让这N个人全部回到N个房子里面去,要 ...
- hdu 2853 Assignment KM算法
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2853 Last year a terrible earthquake attacked Sichuan ...
- hdu 2426 Interesting Housing Problem 最大权匹配KM算法
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2426 For any school, it is hard to find a feasible ac ...
- 【HDU 1533】 Going Home (KM)
Going Home Problem Description On a grid map there are n little men and n houses. In each unit time, ...
- 【HDU 2255】奔小康赚大钱 (最佳二分匹配KM算法)
奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Subm ...
- HDU 2255 奔小康赚大钱 (KM算法 模板题)
奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Subm ...
- hdu 3488(KM算法||最小费用最大流)
Tour Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submis ...
- HDU:2255-奔小康赚大钱(KM算法模板)
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=2255 奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Mem ...
随机推荐
- ****Objective-C 中的方法的调用
oc语言中采用特定的语言调用类或者实例(对象)的方法称为发送消息或者方法调用. oc中方法的调用有两种: 第一种: [类名或对象名 方法名]; [ClassOrInstance method]; [C ...
- vs2012+cmake+opencv+opencv unable to find a build program corresponding to "Visual Studio 12 Win64". CMAKE_MAKE_PROGRAM is not set
搜索了下,说什么的都有! 一,提示找不到 cmake-2.8.12.1 的 modles 卸载了cmake后发现 cmd 中的 cmake --version 还是 2.8.11.1 找到是我的cyg ...
- android 自定义按钮的外边框
<?xml version="1.0" encoding="utf-8"?> <shape xmlns:android="http: ...
- http://blog.csdn.net/shirdrn/article/details/6270506
http://blog.csdn.net/shirdrn/article/details/6270506
- easyui源码翻译1.32--ComboBox(下拉列表框)
前言 扩展自$.fn.combo.defaults.使用$.fn.combobox.defaults重写默认值对象.下载该插件翻译源码 下拉列表框显示一个可编辑文本框和下拉式列表,用户可以选择一个值或 ...
- JNI编程(二) —— 让C++和Java相互调用(2)
3.getRamdomOrder() 这个方法会从backend得到一个随机的Order对象(抱歉这里“Random”拼错了),然后再调用java中相应的通知方法来通知foreground.getRa ...
- git push origin master、git pull出现如下错误
git push origin master出现如下错误: Counting objects: , done. Writing objects: % (/), bytes, done. Total ( ...
- hdu4705Y
链接 这题可以算树形DP吧 树上的递推 对于树上的某个节点 反着算比较好做 就是算有多少有simple路径的 固定某个节点u 另两个节点 有两种取法 1.从不同子树里各选一个 2.从所有子树里选一个 ...
- Caused by: java.lang.ClassNotFoundException: javax.persistence.EntityListeners
Answer: This seems to be caused by Hibernate 3.6. It is now dependent on JPA, so it must have a JPA ...
- ☀【JS】Code
1 <!DOCTYPE html> <html lang="zh-CN"> <head> <meta charset="utf- ...