模板题吧
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int N=100010,inf=1<<30;
int n,cnt=1,G[N],S,T,ss,tt;
struct edge{
int t,nx,f;
}E[N<<2];
inline void addedge(int x,int y,int f){
E[++cnt].t=y; E[cnt].nx=G[x]; G[x]=cnt; E[cnt].f=f;
E[++cnt].t=x; E[cnt].nx=G[y]; G[y]=cnt; E[cnt].f=0;
}
int ans=0;
queue<int> Q;
int vis[N],dis[N];
inline bool bfs(){
while(!Q.empty()) Q.pop();
for(int i=1;i<=n+4;i++) dis[i]=0;
dis[S]=1; Q.push(S);
while(!Q.empty()){
int x=Q.front(); Q.pop();
for(int i=G[x];i;i=E[i].nx)
if(!dis[E[i].t] && E[i].f){
dis[E[i].t]=dis[x]+1; Q.push(E[i].t);
if(E[i].t==T) return true;
}
}
return false;
}
int dfs(int x,int f){
if(x==T || !f) return f;
int used=0,w;
for(int i=G[x];i;i=E[i].nx)
if(dis[E[i].t]==dis[x]+1 && E[i].f){
w=dfs(E[i].t,min(f-used,E[i].f));
E[i].f-=w; E[i^1].f+=w;
if((used+=w)==f) return f;
}
if(!used) dis[x]=-1;
return used;
}
int main(){
scanf("%d",&n); S=n+1; T=n+2; ss=n+3; tt=n+4;
for(int i=1;i<=n;i++){
int k; scanf("%d",&k);
addedge(ss,i,inf); addedge(i,tt,inf);
while(k--){
int x; scanf("%d",&x);
addedge(S,x,1); addedge(i,T,1);
addedge(i,x,inf);
}
}
addedge(tt,ss,inf);
while(bfs()) dfs(S,inf);
ans=E[cnt].f;
for(int i=G[S];i;i=E[i].nx) E[i].f=E[i^1].f=0;
for(int i=G[T];i;i=E[i].nx) E[i].f=E[i^1].f=0;
E[cnt].f=E[cnt-1].f=0;
S=tt; T=ss;
while(bfs()) ans-=dfs(S,inf);
printf("%d\n",ans);
return 0;
}