POJ 2195 Going Home 费用流

题目源：https://vjudge.net/problem/POJ-2195

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

模板源：https://blog.csdn.net/Adolphrocs/article/details/84558274

题解：费用流 将每个人man与每个屋子house，连一条流量为1，费用为（man和house的距离），源点和man连边，house和汇点连一条边

//Accepted 2018.11.30
#include<cstdio>
#include<string.h>
#include<queue>
#include<algorithm>
#include <math.h>
#define inf 1e8
using namespace std;
const int MAXN = 600;
const int MAXM = 51000;
const double eps = 1e-7;
const float EXP = exp(1.0);

int num, head[MAXN];    ///�ڽӱ�ͷ����
struct Edge {
    int u, v, flow, nxt, cost;
    Edge() {}
    Edge(int u, int v, int flow, int cost, int nxt): u(u), v(v), flow(flow), cost(cost), nxt(nxt) {}
} E[MAXM];

int n, m;
struct node {
    int i, j;
}house[MAXN], man[MAXN];

int pre[MAXN], mi[MAXN];
int dis[MAXN];
bool vis[MAXN];
int s, t;            ///Դ������
int minCost;
int flow;
int que[MAXN];

int calc(int i, int j) {
    return abs(man[i].i - house[j].i) + abs(man[i].j - house[j].j);
}

void init() {
    num = 0;
    memset(head, -1, sizeof head);
}

void add(int u, int v, int flow, int cost) {
    E[num] = Edge(u, v, flow, cost, head[u]);
    head[u] = num++;
    E[num] = Edge(v, u, 0, -cost, head[v]);
    head[v] = num++;
}
bool SPFA() {
    for(int i = 0; i <= t; i++)
    	vis[i] = 0, dis[i] = inf, pre[i] = -1;
    dis[s] = 0, mi[s] = inf, vis[s] = true;
    int l = 0, r = 1;
    que[l] = s;
    while(l != r) {
        int u = que[l++];
        if(l == MAXN) l = 0;
        vis[u] = 0;
        for(int i = head[u]; i + 1; i = E[i].nxt) {
            int v = E[i].v;
            if(E[i].flow > 0 && dis[v] > dis[u] + E[i].cost+eps) {
                dis[v] = dis[u] + E[i].cost;
                pre[v] = i;
                mi[v] = min(mi[u], E[i].flow);
                if(!vis[v]) {
                    vis[v] = 1;
                    que[r++] = v;
                    if(r >= MAXN) r -= MAXN;
                }
            }
        }
    }
    if(pre[t] == -1) return false;
    flow += mi[t];
    minCost += mi[t] * dis[t];
    int u = t;
    for(int i = pre[u]; i + 1; i = pre[E[i].u]) {
        E[i].flow -= mi[t];
        E[i ^ 1].flow += mi[t];
    }
    return true;
}

int Mincost() {
    minCost = 0, flow = 0;
    while(SPFA());
    return minCost;
}

int main() {
    while(scanf("%d%d", &n, &m) != EOF && (n || m)){
        //printf("%d %d\n",n, m);
        getchar();
        init();
        s = 1;
        int HOU = 0, MAN = 0;
        for (int  i = 0; i < n; i++){
            for (int j = 0; j < m; j++){
                char ch;
                scanf("%c",&ch);
                if (ch == 'm'){
                    man[MAN].i = i;
                    man[MAN].j = j;
                    MAN++;
                    //printf("%d %d %c\n",i, j, ch);
                 }
                 else if (ch == 'H') {
                     house[HOU].i = i;
                     house[HOU].j = j;
                     HOU++;
                     //printf("%d %d %c\n",i, j, ch);
                 }
            }
            getchar();
        }
        for (int i = 0; i < MAN; i++)
            for (int j = 0; j < HOU; j++){
                int w = calc(i, j);
                add(2 + i, 2 + MAN + j, 1, w);
               // printf("%d -> %d weight = %d\n", 2 + i, 2 + MAN + j, w);
            }
        n = MAN + HOU + 2;
        t = n;
        //printf("%d\n", n);
        for (int i = 0; i < MAN; i++) {
            add(1, 2 + i, 1, 0);
            //printf("%d -> %d\n", 1, 2 + i);
        }
        for (int i = 0; i < HOU; i++) {
            add(MAN + 2 + i, n, 1, 0);
           // printf("%d -> %d\n", MAN + 2 + i, n);
        }
        int tmp = Mincost();
        printf("%d\n", tmp);
    }
    return 0;
}