【BZOJ1458】士兵占领【最大流】

【题目链接】

因为求的是最少，那么要转化成反面思路才可以最大流。

假设现在全部放满，那么可以求最多可以拿走多少。

源点向行连边，容量表示最多可以拿走多少。

列向汇点连边，容量同上。

如果一个点(x, y)可以拿走，那么x行向y列连容量为1的边。

跑最大流，结果一减就行。

/* Pigonometry */
#include <cstdio>
#include <algorithm>

using namespace std;

const int maxg = 105, maxn = 2005, maxm = 40005, maxq = 10000, inf = 0x3f3f3f3f;

int n, m, k, head[maxn], cnt, cur[maxn], bg, ed, depth[maxn], row[maxg], col[maxg], q[maxq], map[maxg][maxg], rowcnt[maxg], colcnt[maxg];

struct _edge {
	int v, w, next;
} g[maxm << 1];

inline int iread() {
	int f = 1, x = 0; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
	return f * x;
}

inline void add(int u, int v, int w) {
	g[cnt] = (_edge){v, w, head[u]};
	head[u] = cnt++;
}

inline void insert(int u, int v, int w) {
	add(u, v, w); add(v, u, 0);
}

inline bool bfs() {
	for(int i = bg; i <= ed; i++) depth[i] = -1;
	int h = 0, t = 0, u, i; depth[q[t++] = bg] = 1;
	while(h != t) for(i = head[u = q[h++]]; ~i; i = g[i].next) if(g[i].w && !~depth[g[i].v]) {
		depth[g[i].v] = depth[u] + 1;
		if(g[i].v == ed) return 1;
		q[t++] = g[i].v;
	}
	return 0;
}

inline int dfs(int x, int flow) {
	if(x == ed) return flow;
	int left = flow;
	for(int i = cur[x]; ~i; i = g[i].next) if(g[i].w && depth[g[i].v] == depth[x] + 1) {
		int tmp = dfs(g[i].v, min(left, g[i].w));
		left -= tmp; g[i].w -= tmp; g[i ^ 1].w += tmp;
		if(g[i].w) cur[x] = i;
		if(!left) return flow;
	}
	if(left == flow) depth[x] = -1;
	return flow - left;
}

int main() {
	m = iread(); n = iread(); k = iread();
	for(int i = 0; i < maxn; i++) head[i] = -1; cnt = 0;

	for(int i = 1; i <= m; i++) row[i] = iread();
	for(int i = 1; i <= n; i++) col[i] = iread();

	for(int i = 1; i <= k; i++) {
		int x = iread(), y = iread();
		rowcnt[x]++; colcnt[y]++;
		map[x][y] = 1;
	}

	for(int i = 1; i <= m; i++) if(n - rowcnt[i] < row[i]) {
		printf("JIONG!\n");
		return 0;
	}
	for(int i = 1; i <= n; i++) if(m - colcnt[i] < col[i]) {
		printf("JIONG!\n");
		return 0;
	}

	bg = 0; ed = n + m + 1;
	for(int i = 1; i <= m; i++) insert(bg, i, n - row[i] - rowcnt[i]);
	for(int i = 1; i <= n; i++) insert(m + i, ed, m - col[i] - colcnt[i]);

	for(int i = 1; i <= m; i++) for(int j = 1; j <= n; j++) if(!map[i][j])
		insert(i, m + j, 1);

	int ans = n * m - k;
	while(bfs()) {
		for(int i = bg; i <= ed; i++) cur[i] = head[i];
		ans -= dfs(bg, inf);
	}

	printf("%d\n", ans);
	return 0;
}

下面这个是很久之前写的代码。

#include <cstdio>
#include <algorithm>
#define rec(i, x, n) for(int i = x; i <= n; i++)
const int maxm = 105, maxn = maxm << 1, maxq = 300, inf = 0x3f3f3f3f;
int n, m, k, cnt, head[maxn], depth[maxn], bg, ed, row[maxm], col[maxm], srow[maxm], scol[maxm], q[maxq];
bool place[maxm][maxm];
struct _edge {int v, w, next;} g[(maxn * maxn) << 1];
inline int iread() {
	int f = 1, x = 0; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
	return f * x;
}
void add(int u, int v, int w) {
	g[cnt] = (_edge) {v, w, head[u]};
	head[u] = cnt++;
}
bool bfs() {
	rec(i, 0, ed) depth[i] = -1;
	int h = 1, t = 0, u, i; depth[q[++t] = bg] = 1;
	while(h <= t) for(i = head[u = q[h++]], h %= maxq; i != -1; i = g[i].next) 
		if(g[i].w && !~depth[g[i].v]) {
			depth[g[i].v] = depth[u] + 1;
			if(g[i].v == ed) return 1;
			++t, t %= maxq, q[t] = g[i].v;
		}
	return 0;
}
int dfs(int x, int flow) {
	if(x == ed) return flow;
	int left = flow;
	for(int i = head[x]; i != -1; i = g[i].next) if(g[i].w && depth[g[i].v] == depth[x] + 1) {
		int tmp = dfs(g[i].v, std::min(left, g[i].w));
		if(!tmp) depth[g[i].v] = -1;
		left -= tmp; g[i].w -= tmp; g[i ^ 1].w += tmp;
	}
	return flow - left;
}
int main() {
	m = iread(); n = iread(); k = iread();
	rec(i, 1, m) row[i] = n - iread();
	rec(i, 1, n) col[i] = m - iread();
	rec(i, 1, k) {
		int x = iread(), y = iread();
		place[x][y] = 1;
		++srow[x]; ++scol[y];
		if(srow[x] > row[x] || scol[x] > col[x]) {
			printf("JIONG!\n"); 
			return 0;
		}
	}
	bg = 0; ed = n + m + 1;
	rec(i, 0, ed) head[i] = -1;
	rec(i, 1, m) add(bg, i, row[i] - srow[i]), add(i, bg, 0);
	rec(i, 1, n) add(i + m, ed, col[i] - scol[i]), add(ed, i + m, 0);
	rec(i, 1, m) rec(j, 1, n) if(!place[i][j]) add(i, j + m, 1), add(j + m, i, 0);
	int ans = 0;
	while(bfs()) ans += dfs(bg, inf);
	printf("%d\n", n * m - k - ans);
	return 0;
}