POJ 2195 - Going Home(二分图最大权匹配)

题目：

http://poj.org/problem?id=2195

题意：

N个人N个房子，每个人到房间都会有一定的距离，要求所有的人都回到房间中，求出最小的总距离。

思路：

二分图最大匹配模板。

将每个人到所有的房间建边，边的权值为人到房子的距离，因为是求最小权值则将边的权值取反。最后答案取反即可。

AC.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 105;
char mp[105][105];
struct node {
    int x, y;
}M[maxn], H[maxn];
int nx, ny;
int g[maxn][maxn];
int linker[maxn], lx[maxn], ly[maxn];
int slack[maxn];
bool visx[maxn], visy[maxn];

bool dfs(int x)
{
    visx[x] = true;
    for(int y = 0; y < ny; ++y) {
        if(visy[y]) continue;
        int tmp = lx[x] + ly[y] - g[x][y];
        if(tmp == 0) {
            visy[y] = true;
            if(linker[y] == -1 || dfs(linker[y])) {
                linker[y] = x;
                return true;
            }
        }
        else if(slack[y] > tmp) slack[y] = tmp;
    }
    return false;
}
int KM()
{
    memset(linker, -1, sizeof(linker));
    memset(ly, 0, sizeof(ly));
    for(int i = 0; i < nx; ++i) {
        lx[i] = -INF;
        for(int j = 0; j < ny; ++j) {
            if(g[i][j] > lx[i]) lx[i] = g[i][j];
        }
    }
    for(int x = 0; x < nx; ++x) {
        for(int  i = 0; i < ny; ++i)
            slack[i] = INF;

        while(true) {
            memset(visx, 0, sizeof(visx));
            memset(visy, 0, sizeof(visy));
            if(dfs(x)) break;
            int d = INF;
            for(int i = 0; i < ny; ++i)
                if(!visy[i] && d > slack[i]) d = slack[i];
            for(int i = 0; i < nx; ++i)
                if(visx[i]) lx[i] -= d;
            for(int i = 0; i < ny; ++i) {
                if(visy[i]) ly[i] += d;
                else slack[i] -= d;
            }
        }
    }
    int res = 0;
    for(int i = 0; i < ny; ++i) {
        if(linker[i] != -1) res += g[linker[i]][i];
    }
    return res;
}
int main()
{
//freopen("in", "r", stdin);
    int n, m;
    while(~scanf("%d %d", &n, &m)) {
        if(n == 0 && m == 0) break;
        int sm = 0, sh = 0;
        //memset(g, 0, sizeof(g));

        for(int i = 0; i < n; ++i) {
            scanf("%s", mp[i]);
            for(int j = 0; j < m; ++j) {
                if(mp[i][j] == 'H') {
                    H[sh].x = i;
                    H[sh++].y = j;
                }
                if(mp[i][j] == 'm') {
                    M[sm].x = i;
                    M[sm++].y = j;
                }
            }
        }

        for(int i = 0; i < sm; ++i) {
            for(int j = 0; j < sh; ++j) {
                g[i][j] = -(abs(M[i].x - H[j].x) + abs(M[i].y - H[j].y));
            }
        }
        nx = ny = sm;
        int ans = -KM();
        printf("%d\n", ans);
    }
    return 0;
}