POJ3281Dining(最大流入门题)

AC代码，题解后期补

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int max_m = 1e6+1000;
const int max_n = 400+10;
int head[max_n],deep[max_n],cnt,MaxFlow;
int N,F,D;
struct Info{
	int from,to,c,flow,next;
}edge[max_m<<1];
void Init(){
	memset(head,-1,sizeof(head));
	cnt = MaxFlow = 0;
}
void ADD(int u,int v,int w){
	edge[cnt].from = u;
	edge[cnt].to = v;
	edge[cnt].c = edge[cnt].flow = w;
	edge[cnt].next = head[u];
	head[u] = cnt++;

	edge[cnt].from = v;
	edge[cnt].to = u;
	edge[cnt].c = edge[cnt].flow = 0;
	edge[cnt].next = head[v];
	head[v] = cnt++;
}
int bfs(int S,int E){
	memset(deep,-1,sizeof(deep));
	queue<int>Q;
	deep[S] = 0;
	Q.push(S);
	while(!Q.empty()){
		int u = Q.front();
		Q.pop();
		for(int i = head[u]; ~i; i = edge[i].next){
			int v = edge[i].to;
			if(deep[v] == -1 && edge[i].flow > 0){
				deep[v] = deep[u]+1;
				Q.push(v);
				if(v == E)
					return 1;
			}
		}
	}
	return 0;
}
int Find(int now,int low,int E){
	if(now == E)
		return low;
	for(int i = head[now]; ~i; i = edge[i].next){
		int v = edge[i].to;
		if(deep[v] == deep[now]+1 && edge[i].flow){
			int Minflow = Find(v,min(low,edge[i].flow),E);
			if(!Minflow)
				continue;
			edge[i].flow -= Minflow;
			edge[i^1].flow += Minflow;
			return Minflow;
		}
	}
	return 0;
}
void Dinic(int S,int E){
	while(bfs(S,E)){
		int temp = Find(S,INF,E);
		MaxFlow += temp;
	}
	printf("%d\n",MaxFlow);
}
int main(){
	while(~scanf("%d %d %d",&N,&F,&D)){
		Init();
		int num1,num2,kind;
		int E = F+N*2+D+1;
		for(int i = 1; i <= F; i++)
			ADD(0,i,1);

		for(int i = 1; i <= N; i++)
			ADD(F+i,F+i+N,1);

		for(int i = 1; i <= D; i++)
			ADD(F+i+N*2,E,1);

		for(int i = 1; i <= N; i++){
			scanf("%d %d",&num1,&num2);
			for(int j = 1; j <= num1; j++){
				scanf("%d",&kind);
				ADD(kind,F+i,1);
			}
			for(int j = 1; j <= num2; j++){
				scanf("%d",&kind);
				ADD(i+F+N,2*N+F+kind,1);
			}
		}
		Dinic(0,E);
	}
	return 0;
}