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
| #include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int n,n1,n2,n3,p=1,s1,s2,t[10001],f[10001];
struct str
{
int m,q,r;
}a[1000001];
void road(int x,int y,int r)
{
a[++p].m=y;
a[p].q=t[x];
t[x]=p;
a[p].r=r;
}
bool bfs()
{
queue<int> Q;
Q.push(s1);
for(int i=1;i<=n;++i) f[i]=0;
f[s1]=1;
while(!Q.empty())
{
int k=Q.front();
Q.pop();
for(int i=t[k];i!=0;i=a[i].q)
{
if(f[a[i].m]==0&&a[i].r!=0)
{
f[a[i].m]=f[k]+1;
Q.push(a[i].m);
}
}
}
return f[s2]!=0;
}
int dfs(int x,int r)
{
if(x==s2) return r;
int s=0;
for(int i=t[x];i!=0;i=a[i].q)
{
if(f[a[i].m]==f[x]+1&&a[i].r!=0)
{
int z=dfs(a[i].m,min(r,a[i].r));
if(z!=0)
{
a[i].r-=z;
a[i^1].r+=z;
r-=z;
s+=z;
}
}
}
return s;
}
int main()
{
scanf("%d%d%d",&n1,&n2,&n3);
n=n1*2+n2+n3+2;
s1=1;
s2=n;
for(int i=1;i<=n1;++i)
{
for(int j=1;j<=n2;++j)
{
int x;
scanf("%d",&x);
if(x==1)
{
road(j+n1*2+1,i+1,1);
road(i+1,j+n1*2+1,0);
}
}
}
for(int i=1;i<=n1;++i)
{
for(int j=1;j<=n3;++j)
{
int x;
scanf("%d",&x);
if(x==1)
{
road(i+n1+1,j+n1*2+n2+1,1);
road(j+n1*2+n2+1,i+n1+1,0);
}
}
}
for(int i=1;i<=n1;++i)
{
road(i+1,i+n1+1,1);
road(i+n1+1,i+1,0);
}
for(int i=1;i<=n2;++i)
{
road(1,i+n1*2+1,1);
road(i+n1*2+1,1,0);
}
for(int i=1;i<=n3;++i)
{
road(i+n1*2+n2+1,n,1);
road(n,i+n1*2+n2+1,0);
}
int r=0;
while(bfs())
{
r+=dfs(s1,1e9);
}
printf("%d",r);
return 0;
}
|