51nod2856 Muddy Fields

题目

题目链接

题解

首先应该注意，木板是可以交叉覆盖的。
对于每个横向木板和纵向木板进行编号。
我们发现对于一个坑而言，横向木板和纵向木板必须至少选一个。
建立二分图，横向木板在左，纵向木板在右，对于每个坑而言，将其对应的横纵向木板连边。
这样，这个问题转化成了图的最小点覆盖。
根据定理可知，二分图的最小点覆盖等于最大匹配。

代码

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;

typedef long long ll;

const ll INF = 1e16;
const int N = 1e5 + 100;
const int M = 55;

struct edge {
	ll to, cap, rev;
	edge() {}
	edge(ll to, ll cap, ll rev):to(to), cap(cap), rev(rev) {}
};

vector<edge> G[N];
ll level[N], iter[N];

void addedge(ll from, ll to, ll cap) {
	G[from].push_back(edge(to, cap, G[to].size()));
	G[to].push_back(edge(from, 0, G[from].size() - 1));
}

void bfs(ll s) {
	memset(level, -1, sizeof(level));
	queue<int> que;
	level[s] = 0;
	que.push(s);
	while (!que.empty()) {
		ll v = que.front();
		que.pop();
		for (edge e : G[v]) {
			if (e.cap > 0 && level[e.to] < 0) {
				level[e.to] = level[v] + 1;
				que.push(e.to);
			}
		}
	}
}

ll dfs(ll v, ll t, ll f) {
	if (v == t) return f;
	for (ll &i = iter[v]; i < G[v].size(); i++) {
		edge &e = G[v][i];
		if (e.cap > 0 && level[v] < level[e.to]) {
			ll d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}

ll max_flow(ll s, ll t) {
	ll flow = 0;
	while (true) {
		bfs(s);
		if (level[t] < 0) return flow;
		memset(iter, 0, sizeof(iter));
		ll f;
		while ((f = dfs(s, t, INF)) > 0)
			flow += f;
	}
}

int n, m, tot;
int id1[M][M], id2[M][M];
char str[M][M];

int main() {
	//freopen("0.txt", "r", stdin);
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++) scanf("%s", str[i]);
	int S = ++tot, T = ++tot;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (str[i][j] == '.') continue;
			if (j == 0 || str[i][j - 1] == '.') id1[i][j] = ++tot, addedge(S, tot, 1);
			else id1[i][j] = id1[i][j - 1];
		}
	}
	for (int j = 0; j < m; j++) {
		for (int i = 0; i < n; i++) {
			if (str[i][j] == '.') continue;
			if (i == 0 || str[i - 1][j] == '.') id2[i][j] = ++tot, addedge(tot, T, 1);
			else id2[i][j] = id2[i - 1][j];
		}
	}
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (str[i][j] == '*')
				addedge(id1[i][j], id2[i][j], 1);
	printf("%lld\n", max_flow(S, T));
	return 0;
}