1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<bitset>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-12
#define succ(x) (1LL<<(x))
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define pb push_back
#define NM 30005
#define nm 400005
#define pi 3.1415926535897931
const int inf=1e9+7;
using namespace std;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct edge{int t,v;edge*next,*rev;}e[nm],*h[NM],*o=e,*p[NM],*tmp[NM];
void _add(int x,int y,int v){o->t=y;o->v=v;o->next=h[x];h[x]=o++;}
void add(int x,int y,int v){_add(x,y,v);_add(y,x,0);h[x]->rev=h[y];h[y]->rev=h[x];}
int d[NM],cnt[NM],t;
int n,m,_x,_y,_t,tot,b[105][105];
int s;
const int dir[][2]={{0,0},{1,0},{0,1},{-1,0},{0,-1}};
int maxflow(){
int flow=0;edge*j;
inc(i,0,tot)tmp[i]=h[i];
cnt[0]=++tot;
for(int x=0,s=inf;d[x]<tot;){
for(j=tmp[x];j;j=j->next)if(j->v&&d[j->t]+1==d[x])break;
if(j){
s=min(j->v,s);tmp[x]=p[j->t]=j;
if((x=j->t)==n){
for(;x;x=p[x]->rev->t)p[x]->v-=s,p[x]->rev->v+=s;
flow+=s;s=inf;
}
}else{
if(!--cnt[d[x]])break;d[x]=tot;
link(x)if(j->v&&d[x]>d[j->t]+1)d[x]=d[j->t]+1,tmp[x]=j;
cnt[d[x]]++;
if(p[x])x=p[x]->rev->t;
}
}
return flow;
}
int main(){
n=read();m=read();
inc(i,1,n)inc(j,1,m)b[i][j]=++tot;
tot++;
inc(i,1,n)inc(j,1,m){
_t=read();if(_t==0)continue;
add(0,b[i][j],_t),s+=_t;
}
inc(i,1,n)inc(j,1,m){
_t=read();if(_t==0)continue;
add(b[i][j],tot,_t);s+=_t;
}
inc(i,1,n)inc(j,1,m){
_t=read();if(_t==0)continue;
s+=_t;tot++;
add(0,tot,_t);
inc(k,0,4)if(b[i+dir[k][0]][j+dir[k][1]])
add(tot,b[i+dir[k][0]][j+dir[k][1]],inf);
}
inc(i,1,n)inc(j,1,m){
_t=read();if(_t==0)continue;
s+=_t;tot++;
add(tot,n*m+1,_t);
inc(k,0,4)if(b[i+dir[k][0]][j+dir[k][1]])add(b[i+dir[k][0]][j+dir[k][1]],tot,inf);
}
n=n*m+1;
printf("%d\n",s-maxflow());
return 0;
}
|
