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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
| #include <map>
#include <set>
#include <cmath>
#include <queue>
#include <bitset>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define FO(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
#define fo(i,j,k) for(int i=(j),end_i=(k);i<=end_i;i++)
#define ff(i,j,k) for(int i=(j),end_i=(k);i< end_i;i++)
#define fd(i,j,k) for(int i=(j),end_i=(k);i>=end_i;i--)
#define DEBUG(x) cerr<<#x<<"="<<x<<endl
#define all(x) (x).begin(),(x).end()
#define cle(x) memset(x,0,sizeof(x))
#define lowbit(x) ((x)&-(x))
#define ll long long
#define ull unsigned ll
#define db double
#define lb long db
#define pb push_back
#define mp make_pair
#define fi first
#define se second
inline int read()
{
int x=0; char ch=getchar(); bool f=0;
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<3)+(x<<1)+(ch^48);
return f?-x:x;
}
#define CASET fo(___,1,read())
const int inf=0x3f3f3f3f;
const int N=405;
const int M=100000;
namespace Dinic{
int SS,TT,S,T,cnt;
int ver[M],val[M],ne[M],head[N],tot;
inline void init()
{
fo(i,0,cnt) head[i]=0;
tot=1;
}
inline void add(int x,int y,int d)
{
ver[++tot]=y; val[tot]=d; ne[tot]=head[x]; head[x]=tot;
ver[++tot]=x; val[tot]=0; ne[tot]=head[y]; head[y]=tot;
}
int d[N],cur[N];
queue<int> q;
inline bool bfs()
{
fo(i,0,cnt) d[i]=-1,cur[i]=head[i];
for(;!q.empty();q.pop());
q.push(SS); d[SS]=0;
for(int u;!q.empty();)
{
u=q.front(); q.pop();
for(int i=head[u],v;i;i=ne[i])
if(val[i]&&d[v=ver[i]]==-1)
{
d[v]=d[u]+1;
q.push(v);
}
}
return d[TT]!=-1;
}
int dfs(int u,int flow)
{
if(u==TT||!flow) return flow;
int res=flow,v,r;
for(int &i=cur[u];i;i=ne[i])
if(val[i]&&d[v=ver[i]]==d[u]+1)
{
if(!(r=dfs(v,min(res,val[i])))) continue;
res-=r;
val[i]-=r; val[i^1]+=r;
if(!res) break;
}
return flow-res;
}
inline int dinic()
{
int flow=0;
for(;bfs();) flow+=dfs(SS,inf);
return flow;
}
}
using Dinic::SS;
using Dinic::TT;
using Dinic::T;
using Dinic::S;
int n,m,L,R;
int c[N],d[N],a[N][N],in[N];
inline void add(int x,int y,int l,int r)
{
Dinic::add(x,y,r-l);
in[x]-=l; in[y]+=l;
}
inline bool check(int k)
{
int sum=0;
Dinic::init();
fo(i,1,n) add(S,i,c[i]-k,c[i]+k);
fo(i,1,m) add(i+n,T,d[i]-k,d[i]+k);
fo(i,1,n) fo(j,1,m) add(i,j+n,L,R);
Dinic::add(T,S,inf);
fo(i,0,Dinic::cnt)
{
if(in[i]>0) Dinic::add(SS,i,in[i]),sum+=in[i];
if(in[i]<0) Dinic::add(i,TT,-in[i]);
in[i]=0;
}
return Dinic::dinic()==sum;
}
int main()
{
n=read(); m=read(); Dinic::cnt=n+m+3;
S=0; T=n+m+1; SS=T+1; TT=T+2;
fo(i,1,n) fo(j,1,m) a[i][j]=read();
fo(i,1,n) fo(j,1,m) c[i]+=a[i][j],d[j]+=a[i][j];
L=read(); R=read();
int l=0,r=200000,mid;
for(;l<=r;)
{
mid=l+r>>1;
if(check(mid)) r=mid-1;
else l=mid+1;
}
printf("%d",r+1);
return 0;
}
|