【BZOJ3996】[TJOI2015]线性代数【最小割】

【题目链接】

大爷的题解【POPOQQQ的题解】

/* Telekinetic Forest Guard */
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 300005, maxm = 1000005, inf = 0x3f3f3f3f;

int n, head[maxn], cur[maxn], cnt, bg, ed, depth[maxn], q[maxn];

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 = 0; 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() {
	n = iread(); bg = 0; ed = n * n + n + 1;
	for(int i = 0; i <= ed; i++) head[i] = -1; cnt = 0;

	int ans = 0;
	for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) {
		int w = iread(), now = (i - 1) * n + j; ans += w;
		insert(bg, now, w);
		insert(now, n * n + i, inf);
		insert(now, n * n + j, inf);
	}
	for(int i = 1; i <= n; i++) insert(n * n + i, ed, iread());

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

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