洛谷P2774 & bzoj1475 方格取数 —— 网络流24题

所求为最大点权独立集，考虑转化最小点权覆盖集，再转化为最小割问题求解，跑最大流-_-

其实就是染个色再跑个最大流，建图见代码：

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <functional>
#include <cmath>
#include <queue>
using namespace std;

int Mat[40][40];
bool M[40][40];
int ID[40][40];
int cnt;
int CC;
int xt[4] = {0, 1, 0, -1};
int yt[4] = {1, 0, -1, 0};
bool used[40][40];
const int MAXN = 40003;
const int MAXE = 120003;
const int INF = 0x3f3f3f3f;
struct Edge{
	int to, nxt, cap, flow;
	Edge() {}
	Edge(int to, int nxt, int cap, int flow):to(to), nxt(nxt), cap(cap), flow(flow) {}
}e[MAXE];
int n, m;
int h[MAXN], p;
int source, sink, tot;
int pre[MAXN], num[MAXN], cur[MAXN];
int d[MAXN];
bool vis[MAXN];
int sigemain[MAXN], sigemaout[MAXN];
queue<int> q;

inline void add_edge(int x, int y, int cap) {
	e[p] = Edge(y, h[x], cap, 0); h[x] = p++;
	e[p] = Edge(x, h[y], 0, 0); h[y] = p++;
}

void bfs() {
	memset(vis, 0, sizeof(vis));
	q.push(sink);
	vis[sink] = 1;
	d[sink] = 0;
	while(!q.empty()) {
		int u = q.front(); q.pop();
		num[d[u]]++;
		for(int i = h[u]; ~i; i = e[i].nxt) {
			int v = e[i].to;
			if(!vis[v]) {
				vis[v] = 1;
				d[v] = d[u] + 1;
				q.push(v);
			}
		}
	}
}

void augment(int flow) {
	for(int i = source; i != sink; i = e[cur[i]].to) {
		e[cur[i]].flow += flow;
		e[cur[i] ^ 1].flow -= flow;
	}
}

int isap() {
	memset(num, 0, sizeof(num));
	bfs();
	memcpy(cur, h, sizeof(h));
	int u = source, flow = 0, f = INF;
	while(d[source] < tot) {
		bool fg = 0;
		for(int i = cur[u]; ~i; i = e[i].nxt) {
			if(e[i].cap > e[i].flow && d[u] == d[e[i].to] + 1) {
				pre[e[i].to] = u;
				cur[u] = i;
				u = e[i].to;
				f = min(f, e[i].cap - e[i].flow);
				fg = 1;
				if(u == sink) {
					flow += f;
					augment(f);
					f = INF;
					u = source;
				}
				break;
			}
		}
		if(fg) continue;
		if(--num[d[u]] == 0) break;
		int M = tot - 1;
		for(int i = h[u]; ~i; i = e[i].nxt) {
			if(e[i].cap > e[i].flow && M > d[e[i].to]) {
				M = d[e[i].to];
				cur[u] = i;
			}
		}
		num[d[u] = M + 1]++;
		if(u != source) u = pre[u];
	}
	return flow;
}

bool in(int x, int y) {
	if(x >= 1 && x <= m && y >= 1 && y <= n) return 1;
	return 0;
}

void build()
{
	memset(h, -1, sizeof(h));
	source = 0; sink = 10000; tot = sink + 1;
	for(int i = 1; i <= m; i++) {
		for(int j = 1; j <= n; j++) {
			int u = Mat[i][j];
			int c = M[i][j];
			int index = ID[i][j];
			if(c) 
			{
				add_edge(source, index, u);
				for(int k = 0; k < 4; k++) {
					int xx = i + xt[k];
					int yy = j + yt[k];
					if(in(xx, yy)) {
						add_edge(index, ID[xx][yy], INF);
					}
				}
			}
			else add_edge(index, sink, u);
		}
	}
}
/*int getsum(int i, int j){
	return (i - 1) * m + j;
}*/

signed main()
{
	
	scanf("%d%d", &m, &n);
	for(int i = 1; i <= m; i++)
		for(int j = 1; j <= n; j++)
			scanf("%d", &Mat[i][j]), cnt += Mat[i][j], ID[i][j] = ++CC;
	for(int i = 1; i <= m; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			if((i + j) & 1)
			{
				M[i][j] = 1;
			}
		}
	}
	build();
	printf("%d\n", cnt - isap());
	
	return 0;
}