[bzoj1324]Exca王者之剑

Exca王者之剑

Time Limit: 10 Sec   Memory Limit: 162 MB
[ Submit][ Status][ Discuss]

Description

 

Input

第一行给出数字N,M代表行列数.N,M均小于等于100 下面N行M列用于描述数字矩阵

Output

输出最多可以拿到多少块宝石

Sample Input

2 2
1 2
2 1

Sample Output

4

HINT

Source

Excalibur！

把点分色即可解决

S->1 权值

0->T 权值

1->0 INF

最小割即可

然而智障的我数组开小T了

#include<iostream>
#include<cstring>
#include<cstdio>
#define INF 100000000
using namespace std;
const int N = 105;
int a[N][N],n,m,sta[N][N],tot,S,T,last[20005],cur[20005],cnt=1,h[20005],q[2000005],ans;
struct Edge{
	int to,next,v;
}e[2100005];
void insert( int u, int v, int w ){
	e[++cnt].to = v; e[cnt].next = last[u]; e[cnt].v = w; last[u] = cnt;
	e[++cnt].to = u; e[cnt].next = last[v]; e[cnt].v = 0; last[v] = cnt;
}
bool bfs(){
	memset(h,-1,sizeof(h));
	int tail = 1, head = 0;
	q[0] = S; h[0] = S;
	while( tail != head ){
		int now = q[head++];
		for( int i = last[now]; i; i = e[i].next )
			if( h[e[i].to] == -1 && e[i].v ){
				h[e[i].to] = h[now] + 1;
				q[tail++] = e[i].to;
			}
	}
	return h[T] != -1;
}
int dfs( int x, int f ){
	int w,used=0;
	if( x == T ) return f;
	for( int i = cur[x]; i; i = e[i].next )
		if( h[e[i].to] == h[x] + 1 ){
			w = dfs(e[i].to,min(e[i].v,f-used));
			e[i].v -= w; e[i^1].v += w; used += w;
			if( e[i].v ) cur[x] = i; if( f == used ) return f;
		}
	if( !used ) h[x] = -1;
	return used;
}
void dinic(){
	while( bfs() ){
		for( int i = S; i <= T; i++ ) cur[i] = last[i];
		ans -= dfs(S,INF);
	}
}
int main(){
	scanf("%d%d", &n, &m);
	for( int i = 1; i <= n; i++ )
		for( int j = 1; j <= m; j++ )
			scanf("%d", &a[i][j]),sta[i][j] = ++tot,ans += a[i][j];
	S = 0, T = m*n+1;
	for( int i = 1; i <= n; i++ )
		for( int j = 1; j <= m; j++ ){
			if((i+j)&1) insert(S,sta[i][j],a[i][j]);
			else insert(sta[i][j],T,a[i][j]);
		}
	for( int i = 1; i <= n; i++ )
		for( int j = 1; j <= m; j++ )
			if( (i+j)&1 ){
				if( i > 1 ) insert( sta[i][j], sta[i-1][j],INF);
				if( i < n ) insert( sta[i][j], sta[i+1][j],INF);
				if( j > 1 ) insert( sta[i][j], sta[i][j-1],INF);
				if( j < m ) insert( sta[i][j], sta[i][j+1],INF);
			}
	dinic();
	printf("%d", ans);
	return 0;
}