POJ2195-Going Home（最小费用最大流）

题目链接

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

题意

一个N * M的地图，由.（空地）和H（房子）和m（人）组成，其中人的数目等于房子的数目，要求将每个人位移到不同的房子里面 ，要求总位移最小

思路

将房子看做点集u，人看做点集v，并且u中的点x到v中的点y有连线，连线的权值为x到y的距离，即转化为求二分图的最佳完美匹配。转化为最小费用最大流
建图方案
房子：点集u
人：点集v
u中的每个点和v中的每个点的连线的费用cost为最短距离，容量cap为1
新建超级源S和超级汇T，其中S连到u中的每个点，v连到T中的每个点。cap = 1， cost = 0
然后跑一遍最小费用最大流即可

代码

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)
#define pr(x) cout << #x << " = " << x << endl
#define lc o << 1
#define rc o << 1 | 1
#define pl() cout << endl

const int MAX_MAP_SIZE = 100 + 5;
const int MAXN = 300;
const int INF = 0x3e3e3e3e;

int N, M;
char Map[MAX_MAP_SIZE][MAX_MAP_SIZE];
PII peo[MAX_MAP_SIZE], hou[MAX_MAP_SIZE];

struct Edge {
    int from, to, cap, flow, cost;
};

struct MCMF {
    int s, t, n, m;
    int d[MAXN], p[MAXN], inq[MAXN], a[MAXN];
    vector<int> G[MAXN];
    vector<Edge> edges;

    void init(int n) {
        this->n = n;
        for (int i = 0; i < n; i++) G[i].clear();
        edges.clear();
    }

    void addedge(int from, int to, int cap, int cost) {
        edges.push_back((Edge){from, to, cap, 0, cost});
        edges.push_back((Edge){to, from, 0, 0, -cost});
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }

    bool bellman_ford(int s, int t, int &flow, int &cost) {
        memset(inq, 0, sizeof(inq));
        for (int i = 0; i < n; i++) d[i] = INF;
        d[s] = 0; inq[s] = 1; p[s] = 0; a[s] = INF;
        queue<int> Q;
        Q.push(s);
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            inq[u] = 0;
            for (int i = 0; i < G[u].size(); i++) {
                Edge &e = edges[G[u][i]];
                if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {
                    d[e.to] = d[u] + e.cost;
                    p[e.to] = G[u][i];
                    a[e.to] = min(a[u], e.cap - e.flow);
                    if (!inq[e.to]) {
                        Q.push(e.to);
                        inq[e.to] = 1;
                    }
                }
            }
        }
        if (d[t] == INF) return false;
        flow += a[t];
        cost += d[t] * a[t];
        int u = t;
        while (u != s) {
            edges[p[u]].flow += a[t];
            edges[p[u] ^ 1].flow -= a[t];
            u = edges[p[u]].from;
        }
        return true;
    }

    int min_cost(int s, int t) {
        int flow = 0, cost = 0;
        while (bellman_ford(s, t, flow, cost));
        return cost;
    }
};

int main() {
    while (scan2(N, M) && N + M != 0) {
        int hnum = 0, mnum = 0;
        for (int i = 0; i < N; i++) {
            scanf("%s", Map[i]);
            for (int j = 0; j < M; j++) {
                if (Map[i][j] == 'H') hou[hnum++] = mp(i, j);
                if (Map[i][j] == 'm') peo[mnum++] = mp(i, j);
            }
        }

        //house_num: 0 ~ hnum - 1;
        //man_num: hnum ~ 2hnum - 1;
        //s: 2 * hnum, t : 2 * hnum + 1;
        MCMF _M;
        _M.init(2 * hnum + 2);
        int S = 2 * hnum, T = 2 * hnum + 1;
        for (int i = 0; i < hnum; i++) {
            _M.addedge(S, i, 1, 0);
            _M.addedge(i + hnum, T, 1, 0);
            for (int j = 0; j < hnum; j++) {
                int dist = abs(hou[i].first - peo[j].first) + abs(hou[i].second - peo[j].second);
                _M.addedge(i, j + hnum, 1, dist); 
            }
        }

        int ans = _M.min_cost(S, T); 
        printf("%d\n", ans);
    }
    return 0;
}