BZOJ2502【上下界最小流】

/* I will wait for you */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

const int maxn=10010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;

struct edge{ int a,v,next; }e[100*maxn];

int cnt=0,ans=0;
int head[maxn],cur[maxn],dis[maxn],in[maxn],out[maxn],q[100*maxn];

void insert(int u,int v,int a)
{
	e[cnt]=(edge){a,v,head[u]};head[u]=cnt++;
	e[cnt]=(edge){0,u,head[v]};head[v]=cnt++;
}

bool bfs(int s,int t)
{
	memset(dis,-1,sizeof(dis));
	int a=0,b=0;q[0]=dis[s]=s;
	
	while(a<=b)
	{
		int u=q[a++];
		for(int i=head[u];i!=-1;i=e[i].next)
		{
			int v=e[i].v;
			if(e[i].a&&dis[v]==-1) dis[v]=dis[u]+1,q[++b]=v;
		}
	}
	
	return dis[t]!=-1;
}

int dfs(int u,int t,int a)
{	
	if(u==t) return a;
	int ans=0,f;
	
	for(int &i=cur[u];a&&i!=-1;i=e[i].next)
	{
		int v=e[i].v;
		if(e[i].a&&dis[v]==dis[u]+1&&(f=dfs(v,t,min(a,e[i].a)))>0)
			e[i].a-=f,e[i^1].a+=f,a-=f,ans+=f;
	}
	
	if(!ans) dis[u]=-1;
	return ans;
}

void dinic(int s,int t)
{	
	while(bfs(s,t)) memcpy(cur,head,sizeof(cur)),ans+=dfs(s,t,INF);
}

int main()
{
	int n,m=0;scanf("%d",&n);
	
	memset(head,-1,sizeof(head));
	
	int s=0,ns=n+1,nt=n+2;
	
	for(int i=1;i<=n;i++)
	{
		int s;scanf("%d",&s);
		for(int k=1;k<=s;k++)
		{
			int j;scanf("%d",&j);m++;
			insert(i,j,INF);
			in[j]++;out[i]++;
		}
	}

	for(int i=1;i<=n;i++) insert(s,i,INF),insert(ns,i,in[i]),insert(i,nt,out[i]);
	
	for(int i=1;ans!=m&&i<maxn;i++)
	{
		insert(ns,s,1);dinic(ns,nt);
		if(ans==m) printf("%d\n",i);
	}
	
	return 0;
}