bzoj2929 [Poi1999]洞穴攀行（最大流）

裸题。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 210
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,h[N],num=1,cur[N],T,lev[N],ans=0;
struct edge{
    int to,next,val;
}data[50500];
inline void add(int x,int y,int val){
    data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].val=val;
    data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].val=0;
}
inline bool bfs(){
    queue<int>q;memset(lev,0,sizeof(lev));
    q.push(1);lev[1]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=h[x];i;i=data[i].next){
            int y=data[i].to;if(lev[y]||!data[i].val) continue;
            lev[y]=lev[x]+1;if(y==T) return 1;q.push(y);
        }
    }return 0;
}
inline int dinic(int x,int low){
    if(x==T) return low;int tmp=low;
    for(int &i=cur[x];i;i=data[i].next){
        int y=data[i].to;if(lev[y]!=lev[x]+1||!data[i].val) continue;
        int res=dinic(y,min(tmp,data[i].val));
        if(!res) lev[y]=0;else tmp-=res,data[i].val-=res,data[i^1].val+=res;
        if(!tmp) return low;
    }return low-tmp;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();int owo=read();T=n;
    while(owo--) add(1,read(),1);
    for(int i=2;i<=n-1;++i){
        int owo=read();while(owo--){int x=read();add(i,x,x==n?1:inf);}
    }while(bfs()){memcpy(cur,h,sizeof(h));ans+=dinic(1,inf);}
    printf("%d\n",ans);
    return 0;
}