【bzoj1711】[Usaco2007 Open]Dingin吃饭 最大流

源点S向吃的连一条容量为1的边
吃的向牛连一条容量为1的边
牛拆成两个点之间容量为1的边
牛向喝的连一条容量为1的边

喝的向汇点T连一条容量为1的边

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<iostream>
#define maxn 1010
#define maxm 100010 
#define inf 1000000000

using namespace std;

int head[maxn],to[maxm],c[maxm],next[maxm],d[maxn],q[maxn];
int n,m,num,ans,F,D,s,t;

void addedge(int x,int y,int z)
{
	num++;to[num]=y;c[num]=z;next[num]=head[x];head[x]=num;
	num++;to[num]=x;c[num]=0;next[num]=head[y];head[y]=num;
}

bool bfs()
{
	memset(d,-1,sizeof(d));
	int l=0,r=1;
	q[1]=s;d[s]=0;
	while (l<r)
	{
		int x=q[++l];
		for (int p=head[x];p;p=next[p])
		  if (c[p] && d[to[p]]==-1)
		  {
		  	d[to[p]]=d[x]+1;
		  	q[++r]=to[p];
		  }
	}
	if (d[t]==-1) return 0; else return 1;
}

int find(int x,int low)
{
	if (x==t || low==0) return low;
	int totflow=0;
	for (int p=head[x];p;p=next[p])
	  if (c[p] && d[to[p]]==d[x]+1)
	  {
	  	int a=find(to[p],min(low,c[p]));
	  	c[p]-=a;c[p^1]+=a;
	  	low-=a;totflow+=a;
	  	if (low==0) return totflow;
	  }
	if (low) d[x]=-1;
	return totflow;
}

void Dinic()
{
	while (bfs()) ans+=find(s,inf);
}

int main()
{
	scanf("%d%d%d",&n,&F,&D);
	s=0;t=F+D+2*n+1;num=1;
	for (int i=1;i<=F;i++) addedge(s,i,1);
	for (int i=1;i<=D;i++) addedge(F+i,t,1);
	for (int i=1;i<=n;i++)
	{
		int x,y,z;
		scanf("%d%d",&x,&y);
		for (int j=1;j<=x;j++)
		{
			scanf("%d",&z);
			addedge(z,F+D+i,1);
		}
		for (int j=1;j<=y;j++)
		{
			scanf("%d",&z);
			addedge(F+D+n+i,F+z,1);
		}
		addedge(F+D+i,F+D+n+i,1);
	}
	Dinic();
	printf("%d\n",ans);
	return 0;
}