POJ - 3281 Dining 网络流

#include <iostream>
#include <cstring>
#include <queue>
#include <stdio.h>
using namespace std;
#define INF 0x7ffffff
const int M = 1000005;
struct E{
	int nxt,v,w;
};
E edge[M];
int dpth[M],head[M],cnt;
int n,m,s,t;
void add(int u,int v,int w){
	cnt++;
	edge[cnt].v = v;
	edge[cnt].w = w;
	edge[cnt].nxt = head[u];
	head[u] = cnt;
	cnt++;
	edge[cnt].v = u;
	edge[cnt].w = 0;
	edge[cnt].nxt = head[v];
	head[v] = cnt;
}
//初始化从0开始存边 i^1是i的反向边
void init(){
	cnt=-1;
	memset(head,-1,sizeof(head));
}
//初始化分层图
bool bfs(){
	memset(dpth,0,sizeof(dpth));
	queue<int> q;	q.push(s); dpth[s] = 1;
	while(!q.empty()){
		int u = q.front(); q.pop();
		for(int v,i=head[u];i!=-1;i=edge[i].nxt){
			{
				v = edge[i].v;  
				if(edge[i].w>0&&dpth[v]==0){
					dpth[v] = dpth[u]+1;
					q.push(v);
				}
			}
		}
	}
	if(dpth[t]!=0)
	return true;
	else return false;
}
int dfs(int u,int dist){
	if(u==t)
	 return dist; 
	for(int v,i=head[u];i!=-1;i=edge[i].nxt){
		v = edge[i].v;
		if((dpth[v]==dpth[u]+1)&&edge[i].w!=0)
		{
			int di = dfs(v,min(dist,edge[i].w));
			if(di>0){
				edge[i].w-=di;
				edge[i^1].w+=di;
				return di; 
			}
		}
	}
	return 0;
}
int dinic(){
	int ans=0;
	while(bfs())
		while(int di = dfs(s,INF))
			ans+=di;
	return ans;
}
int main(){
	int f,d;
	scanf("%d %d %d",&n,&f,&d);
	init();
	for(int i=1;i<=n;i++){
		int f1,d1;
		scanf("%d %d",&f1,&d1);
		for(int j=1;j<=f1;j++){
			int k;
			scanf("%d",&k);
			add(k,i+100,1);	
		} 
		for(int j=1;j<=d1;j++){
			int k;
			scanf("%d",&k);
			add(i+200,k+300,1); 
		}
		add(i+100,i+200,1);
	} 
	for(int i=1;i<=f;i++)add(0,i,1);
	for(int i=1;i<=d;i++)add(i+300,401,1); 
	
	s = 0; t = 401;
	cout<<dinic();
	return 0;
}