bzoj2127: happiness

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<queue>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
int read(){
	int x=0;char c=getchar();
	while(!isdigit(c)) c=getchar();
	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
	return x;
} 
const int nmax=6e4+5;
const int maxn=4e5+5;
const int inf=0x7f7f7f7f;
struct edge{
	int to,cap;edge *next,*rev;
};
edge es[maxn],*pt=es,*head[nmax];
void add(int u,int v,int d){
	pt->to=v;pt->cap=d;pt->next=head[u];head[u]=pt++;
	pt->to=u;pt->cap=0;pt->next=head[v];head[v]=pt++;
	head[u]->rev=head[v];head[v]->rev=head[u];
}
edge *p[nmax],*cur[nmax];
int h[nmax],cnt[nmax],id[105][105];
int maxflow(int s,int t,int n){
	cnt[0]=n;int x=s,flow=0,a=inf;edge *e;
	while(h[s]<n){
		for(e=cur[x];e;e=e->next) if(e->cap>0&&h[e->to]+1==h[x]) break;
		if(e){
			a=min(a,e->cap);cur[x]=p[e->to]=e;x=e->to;
			if(x==t){
				while(x!=s) p[x]->cap-=a,p[x]->rev->cap+=a,x=p[x]->rev->to;
				flow+=a,a=inf;
			}
		}else{
			if(!--cnt[h[x]]) break;
			h[x]=n;
			for(e=head[x];e;e=e->next) if(e->cap>0&&h[x]>h[e->to]+1) h[x]=h[e->to]+1,cur[x]=e;
			cnt[h[x]]++;
			if(x!=s) x=p[x]->rev->to;
		}
	}
	return flow;
}
int main(){
	int n=read(),m=read(),s=0,t=1,cnt=1,tmp,sm=0;
	rep(i,1,n) rep(j,1,m) id[i][j]=++cnt;
	rep(i,1,n) rep(j,1,m) add(s,id[i][j],tmp=read()),sm+=tmp;
	rep(i,1,n) rep(j,1,m) add(id[i][j],t,tmp=read()),sm+=tmp;
	rep(i,1,n-1) rep(j,1,m) add(s,++cnt,tmp=read()),add(cnt,id[i][j],inf),add(cnt,id[i+1][j],inf),sm+=tmp;
	rep(i,1,n-1) rep(j,1,m) add(++cnt,t,tmp=read()),add(id[i][j],cnt,inf),add(id[i+1][j],cnt,inf),sm+=tmp;
	rep(i,1,n) rep(j,1,m-1) add(s,++cnt,tmp=read()),add(cnt,id[i][j],inf),add(cnt,id[i][j+1],inf),sm+=tmp;
	rep(i,1,n) rep(j,1,m-1) add(++cnt,t,tmp=read()),add(id[i][j],cnt,inf),add(id[i][j+1],cnt,inf),sm+=tmp;
	printf("%d\n",sm-maxflow(s,t,cnt+1));
	return 0;
}
/*
1 2
1 1
100 110
1
1000 
*/