二分图的最优匹配 going home
2011-08-31 14:33
176 查看
View Code
Going Home
Time Limit:1000MS Memory Limit:65536K
Total Submit:45 Accepted:38
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
Sample Output
注意,应该是单向的,x->y,因为。。。。反正就是单向的,不想了。。。。。
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<algorithm> using namespace std; #define MIN(a,b) a<b?a:b #define INF 99999999 #define MAX 5005 int n,match[MAX]; bool sx[MAX],sy[MAX]; int lx[MAX],ly[MAX],map[MAX][MAX]; char str[105][105]; bool path(int u) { sx[u]=true; for(int v=0;v<n;v++) if(!sy[v]&&lx[u]+ly[v]==map[u][v]) { sy[v]=true; if(match[v]==-1||path(match[v])) { match[v]=u; return true; } } return false; } int KM(bool truth)//truth 为真,求最大权匹配;为假,求最小权匹配 { int i,j; if(!truth) { for(i=0;i<n;i++) for(j=0;j<n;j++) map[i][j]=-map[i][j]; } for(i=0;i<n;i++) { lx[i]=-INF; ly[i]=0; for(j=0;j<n;j++) if(lx[i]<map[i][j]) lx[i]=map[i][j]; } memset(match,-1,sizeof(match)); for(int u=0;u<n;u++) while(1) { memset(sx,0,sizeof(sx)); memset(sy,0,sizeof(sy)); if(path(u)) break; int dmin=INF; for(i=0;i<n;i++) if(sx[i]) for(j=0;j<n;j++) if(!sy[j]) dmin=MIN(lx[i]+ly[j]-map[i][j],dmin); for(i=0;i<n;i++) { if(sx[i]) lx[i]-=dmin; if(sy[i]) ly[i]+=dmin; } } int sum=0; for(j=0;j<n;j++) sum+=map[match[j]][j]; if(!truth) { sum=-sum; for(i=0;i<n;i++) for(j=0;j<n;j++) map[i][j]=-map[i][j]; } return sum; } void Map_Init(int a,int b) { int i,j,k,x,tx=0,ty; for(i=0;i<a;i++) for(j=0;j<b;j++) if(str[i][j]=='m') { ty=-1; for(k=0;k<a;k++) for(x=0;x<b;x++) if(str[k][x]=='H') { ty++; map[tx][ty]=abs(k-i)+abs(x-j); } tx++; } } int main() { int a,b,i,j; while(~scanf("%d%d",&a,&b)) { if(a==0&&b==0) break; for(i=0;i<a;i++) scanf("%s",str[i]); n=0; for(i=0;i<a;i++) for(j=0;j<b;j++) if(str[i][j]=='m') n++; Map_Init(a,b); int cost=KM(false); printf("%d\n",cost); } return 0; }
Going Home
Time Limit:1000MS Memory Limit:65536K
Total Submit:45 Accepted:38
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
注意,应该是单向的,x->y,因为。。。。反正就是单向的,不想了。。。。。
相关文章推荐
- POJ 2195 Going Home(二分图最优匹配)
- POJ 2195 Going Home(二分图最优匹配)
- POJ 2195 Going Home【KM算法-二分图的最优匹配】
- POJ 2195 Going Home【最小费用流 二分图最优匹配】
- poj 2195 Going Home(二分图最优匹配KM算法)
- POJ 2195 Going Home【二分图最优匹配.KM】
- poj 2195 - Going Home 二分图最优匹配 ek
- 二分图的最优匹配 going home
- hdu1533 going home 二分图最优匹配
- POJ 2195 Going Home(二分图最优匹配)
- POJ 2195 Going Home(KM算法——二分图最小权匹配)
- 二分图最优匹配 模板
- HDU 3718 Similarity(二分图最优匹配)
- hdu 3722 二分图 最优完备匹配 KM算法
- 【POJ - 2195】Going Home(KM算法求二分图最小权匹配)
- HDU 3435 A new Graph Game(二分图最优匹配:有向环覆盖)
- HDUOJ 2195 二分图最优匹配
- POJ2195 Going Home——二分图最大带权匹配的KM算法——pku2195
- hdu 3722 二分图 最优完备匹配 KM算法
- 二分图大讲堂——彻底搞定最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配