【GDOI2010】【最小割】圈地计划

纠结了比较久的题。

对应前两个矩阵的条件联系最小割的意义很容易明白构图

先黑白染色，对于黑色格子来说s -> p边权为map1[i][j],p -> t边权为map2[i][j]

对于白色格子来说s -> p边权为map2[i][j],p -> t边权为map1[i][j]

然后对于相邻的格子连边，边权为map3[i][j] + map3[i'][j'](这点想了很久。。。也是这道题比较关键的一点)

代码:

#include<cstdio>
#include<cstring>
using namespace std;
const int maxp = 100 + 10;
const int maxn = maxp * maxp;
const int maxm = 200000;
struct Edge
{
	int pos,c;
	int next;
}E[maxm];
int map1[maxp][maxp],map2[maxp][maxp],map3[maxp][maxp];
int dis[maxn],gap[maxn],cur[maxn],pre[maxn];
int head[maxn];
int com = 0;
int s,t,NE,nodenum;
int n,m;
void init()
{
	freopen("bzoj2132.in","r",stdin);
	freopen("bzoj2132.out","w",stdout);
}

void readdata()
{
	scanf("%d%d",&n,&m);
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= m;j++)
			scanf("%d",&map1[i][j]),com += map1[i][j];
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= m;j++)
			scanf("%d",&map2[i][j]),com += map2[i][j];
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= m;j++)
			scanf("%d",&map3[i][j]);
}

void add(int u,int v,int c)
{
	E[NE].pos = v;E[NE].c = c;
	E[NE].next = head[u];head[u] = NE++;
	E[NE].pos = u;E[NE].c = 0;
	E[NE].next = head[v];head[v] = NE++;
}

void build_map()
{
	memset(E,0,sizeof(E));
	memset(head,-1,sizeof(head));
	s = 0,t = n * m + 1;
	nodenum = t + 1;
	NE = 0;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= m;j++)
		{
			if(!((i + j) & 1))add(s,(i - 1) * m + j,map1[i][j]),add((i - 1) * m + j,t,map2[i][j]);
			else add(s,(i - 1) * m + j,map2[i][j]),add((i - 1) * m + j,t,map1[i][j]);
			if(i > 1)add((i - 1) * m + j,(i - 2) * m + j,map3[i][j] + map3[i-1][j]),com += map3[i][j];
			if(i < n)add((i - 1) * m + j,i * m + j,map3[i][j] + map3[i+1][j]),com += map3[i][j];
			if(j > 1)add((i - 1) * m + j,(i - 1) * m + j - 1,map3[i][j] + map3[i][j-1]),com += map3[i][j];
			if(j < m)add((i - 1) * m + j,(i - 1) * m + j + 1,map3[i][j] + map3[i][j+1]),com += map3[i][j];
		}
	}
}

void checkmin(int &a,int b)
{
	if(a == -1 || a > b)a = b;
}

int sap()
{
	memset(dis,0,sizeof(dis));
	memset(gap,0,sizeof(gap));
	for(int i = s;i <= t;i++)cur[i] = head[i];
	int u = pre[s] = s,maxflow = 0,aug = -1;
	gap[s] = nodenum;
	while(dis[s] < nodenum)
	{
loop:   for(int &i = cur[u];i != -1;i = E[i].next)
		{
			int v = E[i].pos;
			if(E[i].c && dis[u] == dis[v] + 1)
			{
				checkmin(aug,E[i].c);
				pre[v] = u;
				u = v;
				if(v == t)
				{
					maxflow += aug;
					for(u = pre[u];v != s;v = u,u = pre[u])
					{
						E[cur[u]].c -= aug;
						E[cur[u]^1].c += aug;
					}
					aug = -1;
				}
				goto loop;
			}
		}
		int mind = nodenum;
		for(int i = head[u];i != -1;i = E[i].next)
		{
			int v = E[i].pos;
			if(E[i].c && (mind > dis[v]))
			{
				cur[u] = i;
				mind = dis[v];
			}
		}
		if((--gap[dis[u]]) == 0)break;
		gap[dis[u] = mind + 1]++;
		u = pre[u];
	}
	return maxflow;
}

void solve()
{
	build_map();
	printf("%d\n",com - sap());
}

int main()
{
	init();
	readdata();
	solve();
	return 0;
}