POJ - 2195 Going Home 最小费用最大流

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

题意：n个人，n个房子，让每个人都回到一个房子里面，使得所有人走的步数和最小

题解：建一个源点，分别指向人，对应flow为1，cost为0，建一个汇点所有房子指向他，flow为1，cost为0，跑一下最小费用最大流即可。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
#define INF 0x3f3f3f3f
const int N = 210;
struct edge {
	int to, nex, flow, cost;
}e[N * N];
int n, m;
char s[N];
vector<pair<int, int> > Man, Home;
int len1, len2;
int head[N], len;
int vis[N], dis[N], pre[N], pid[N];
void init() {
	memset(head, -1, sizeof(head));
	len = 0;
	len1 = 0;
	len2 = 0;
	Man.clear();
	Home.clear();
}
void Add_edge(int from, int to, int flow, int cost) {
	e[len].to = to;
	e[len].flow = flow;
	e[len].cost = cost;
	e[len].nex = head[from];
	head[from] = len++;
	
	e[len].to = from;
	e[len].flow = 0;
	e[len].cost = -cost;
	e[len].nex = head[to];
	head[to] = len++;
}
bool Spfa(int from, int to) {
	memset(vis, 0, sizeof(vis));
	memset(dis, INF, sizeof(dis));
	queue<int> q;
	int now, id;
	q.push(from);
	vis[from] = 1;
	dis[from] = 0;
	while(!q.empty()) {
		now = q.front(); q.pop();
		vis[now] = 0;
		for(int i = head[now]; i != -1; i = e[i].nex) {
			id = e[i].to;
			if(e[i].flow > 0 && dis[id] > dis[now] + e[i].cost) {
				dis[id] = dis[now] + e[i].cost;
				pre[id] = now;
				pid[id] = i;
				if(!vis[id]) {
					q.push(id);
					vis[id] = 1;
				}
			}
		}
	}
	return dis[to] != INF;
}
int Dinic(int from, int to) {
	int res = 0, minn, id;
	while(Spfa(from, to)) {
		minn = INF;
		id = to;
		while(id != from) {
			minn = min(minn, e[pid[id]].flow);
			id = pre[id];
		}
		id = to;
		while(id != from) {
			res += e[pid[id]].cost * minn;
			e[pid[id]].flow -= minn;
			e[pid[id] ^ 1].flow += minn;
			id = pre[id];
		}
	}
	return res;
}
int main() {
	while(scanf("%d %d", &n, &m) && n && m) {
		init();
		for(int i = 1; i <= n; i++) {
			scanf("%s", s + 1);
			for(int j = 1; j <= m; j++) {
			 	if(s[j] == 'm') {
			 		len1++;
			 		Man.push_back(make_pair(i, j) ) ;
					Add_edge(0, len1, 1, 0);	
				} else if(s[j] == 'H') {
					len2++;
					Home.push_back(make_pair(i, j) );
					Add_edge(100 + len2, N - 1, 1, 0);
				}
			}
		}
		for(int i = 0; i < len1; i++) {
			for(int j = 0; j < len2; j++) {
				Add_edge(i + 1, j + 100 + 1, 1, abs(Man[i].first - Home[j].first) + abs(Man[i].second - Home[j].second));
			}
				
		}
		printf("%d\n", Dinic(0, N - 1));
	}
	return 0;
}
/*
2 2
.m
H.
*/