洛谷P1894 [USACO4.2]完美的牛栏The Perfect Stall

二分图匹配直接网络流水一下。。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n,s=0,t,num_e=1,m,l,ss;
const int maxn=10005;
const int inf=2147483647;
int head[maxn],dis[maxn];
struct edge{
    int to,rest,next;
}e[maxn];
inline void add_edge(int x,int y,int z){
    e[++num_e].to=y;e[num_e].rest=z;e[num_e].next=head[x];head[x]=num_e;
    e[++num_e].to=x;e[num_e].rest=0;e[num_e].next=head[y];head[y]=num_e;
}
bool bfs(){
    memset(dis,0,sizeof(dis));
    queue<int> q;
    while(!q.empty()) q.pop();
    q.push(s);
    dis[s]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=head[x];i;i=e[i].next){
            if(e[i].rest&&!dis[e[i].to]){
                dis[e[i].to]=dis[x]+1;
                q.push(e[i].to);
            }
        }
    }
    if(dis[t]) return true;
    return false;
}
int dfs(int x,int minn){
    if(x==t) return minn;
    int sum=0,qq=0;
    for(int i=head[x];i;i=e[i].next){
        int y=e[i].to;
        if(e[i].rest&&dis[y]==dis[x]+1){
            qq=dfs(y,min(e[i].rest,minn-sum));
            e[i].rest-=qq;
            e[i^1].rest+=qq;
            sum+=qq;
            if(sum==minn) return sum;
        }
    }
    if(!sum) dis[x]=0;
    return sum;
}
int dinic(){
    int anss=0;
    while(bfs()) anss+=dfs(s,inf);
    return anss;
}
int main(){
    scanf("%d%d",&n,&m);
    t=m+n+1;
    for(int i=1;i<=n;i++) add_edge(s,i,1);
    for(int i=1;i<=m;i++) add_edge(n+i,t,1);
    for(int i=1;i<=n;i++){
        scanf("%d",&ss);
        for(int k=1;k<=ss;k++){
            scanf("%d",&l);
            add_edge(i,l+n,1);
        }
    }
    cout<<dinic();


}