Codeforces 1214 D. Treasure Island 网络流

题意：给一个n*m的图，’.‘表示空地，’#'表示障碍，起点为左上角，终点为右下角，只能向下或向右走到空地，求为了使不能从起点走到终点，需要放置的最少障碍数
思路：官方题解思路为用两遍dfs，若求出两次相交点数大于2，答案就是2（(1,2)和(2,1)处放障碍就行）。实际上这题可以用网络流来解，除了起点和终点外，每个点拆成两个点，容量为1，表示每个点只能被访问一次（若超过1次就可以在这个点放障碍），每个点与右方和下方可走的点之间也连一条边，容量为1。起点和终点也拆成两个点，边容量为无穷大，求出起点到终点的最大流即可

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 4e6+5;
const int inf = 0x3f3f3f3f;
int n, m, level[maxn], vis[maxn], iter[maxn];
vector<string> Map;
struct edge {
	int rev, to, c;
	edge(int rev = 0, int to = 0, int c = 0) : rev(rev), to(to), c(c) {}
};
vector<edge> g[maxn];
void addedge(int u, int v, int c)
{
	g[u].push_back(edge(g[v].size(), v, c));
	g[v].push_back(edge(g[u].size()-1, u, 0));
}
void bfs(int s)
{
	memset(level, -1, sizeof(level));
	queue<int> q;
	level[s] = 0;
	q.push(s);
	while (!q.empty()) {
		int t = q.front(); q.pop();
		for (int i = 0; i < g[t].size(); i++) {
			edge &e = g[t][i];
			if (e.c > 0 && level[e.to] < 0) {
				level[e.to] = level[t] + 1;
				q.push(e.to);
			}
		}
	}
}
int dfs(int v, int t, int f)
{
	if (v == t) return f;
	vis[v] = 1;
	for (int &i = iter[v]; i < g[v].size(); i++) {
		edge &e = g[v][i];
		if (level[v] < level[e.to] && e.c > 0) {
			int d = dfs(e.to, t, min(f, e.c));
			if (d > 0) {
				e.c -= d;
				g[e.to][e.rev].c += d;
				return d;
			}
		}
	}
	return 0;
}
int solve(int s, int t)
{
	int flow = 0;
	memset(vis, 0, sizeof(vis));
	for (;;) {
		bfs(s);
		if (level[t] < 0) return flow;
		memset(iter, 0, sizeof(iter));
		int f;
		while ((f = dfs(s, t, inf)) > 0)
			flow += f;
	}
}
int main()
{
	cin >> n >> m;
	string s;
	for (int i = 0; i < n; i++) {
		cin >> s;
		Map.push_back(s);
	}
	int cnt = 0;
	addedge(1, 2, inf);
	addedge(2*(n*m)-1, 2*(n*m), inf);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cnt++;
			if (!(i == 0 && j == 0) && !(i == n-1 && j == m-1))
				addedge(2*cnt-1, 2*cnt, 1);
			if (Map[i][j] == '.') {
				if (i+1 < n && Map[i+1][j] == '.') {
					addedge(2*cnt, 2*(cnt+m)-1, inf);
				}
				if (j+1 < m && Map[i][j+1] == '.') {
					addedge(2*cnt, 2*(cnt+1)-1, inf);
				}
			}
		}
	}
	int res = solve(1, 2*(n*m));
	cout << res << "\n";
	return 0;
}