自从有了课件,我就不想打字了
代码(交在BZOJ的时候记得把组数删掉)
//By AcerMo%%%尹兄
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=3050;
int A,B,m,ans,tot,T1,T2;
int a[M],b[M];
bool map[M][M];
int head[M],to[M*M/2],nxt[M*M/2];
int mat[M],sta[M],vis[M],tim[M];
inline int read()
{
int x=0;char ch=getchar();
while (ch>'9'||ch<'0') ch=getchar();
while (ch<='9'&&ch>='0') x=x*10+ch-'0',ch=getchar();
return x;
}
inline void add(int x,int y)
{
to[++tot]=y,nxt[tot]=head[x];head[x]=tot;
return ;
}
inline int Count(int x)
{
int re=0;
while(x) x-=x&-x,++re;
return re;
}
inline bool mid(int x)
{
if(vis[x]==T1) return 1;
for(int i=head[x];i;i=nxt[i])
if(vis[to[i]]!=T1&&sta[to[i]]!=T2)
{
sta[to[i]]=T2;
if( tim[to[i]]!=T1||!mat[to[i]]||mid(mat[to[i]]) )
{
tim[to[i]]=T1;mat[to[i]]=x;return 1;
}
}
return 0;
}
inline int maxx(int x=0,int y=0)
{
int i,re=0;++T1;
for(i=1;i<=B;i++)
if(map[x][i]||map[y][i])
vis[i]=T1,++re;
for(i=1;i<=B;i++)
if(b[i]&1)
{
++T2;
if(mid(i)) ++re;
}
return B-re;
}
inline void clean()
{
memset(head,0,sizeof(head));
memset(tim,0,sizeof(tim));
memset(vis,0,sizeof(vis));
memset(sta,0,sizeof(sta));
memset(mat,0,sizeof(mat));
memset(map,1,sizeof(map));
return (void)(tot=T1=T2=0);
}
int main()
{
int t;t=read();
while (t--)
{
A=read();B=read();m=read();
int x,y;clean();
for(int i=1;i<=A;i++) a[i]=read();
for(int i=1;i<=B;i++) b[i]=read();
for(int i=1;i<=m;i++)
x=read(),y=read(),map[x][y]=0;
for(int i=1;i<=B;i++)
if(b[i]&1)
for(int k=1;k<=B;k++)
if(~b[k]&1)
if(~Count(b[i]|b[k])&1)
add(i,k);
for(int i=1;i<=B;i++) map[0][i]=0;
ans=maxx();
for(int i=1;i<=A;i++)
ans=max(maxx(i)+1,ans);
for(int i=1;i<=A;i++)
if(a[i]&1)
for(int k=1;k<=A;k++)
if(~a[k]&1)
ans=max(maxx(i,k)+2,ans);
cout<<ans<<endl;
}
return 0;
}