The Perfect Stall（网络流）

Description

Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall.
Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.

Input

The input includes several cases. For each case, the first line contains two integers, N (0 <= N <= 200) and M (0 <= M <= 200). N is the number of cows that Farmer John has and M is the number of stalls in the new barn. Each of the following N lines corresponds to a single cow. The first integer (Si) on the line is the number of stalls that the cow is willing to produce milk in (0 <= Si <= M). The subsequent Si integers on that line are the stalls in which that cow is willing to produce milk. The stall numbers will be integers in the range (1..M), and no stall will be listed twice for a given cow.

Output

For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.

Sample Input

5 5
2 2 5
3 2 3 4
2 1 5
3 1 2 5
1 2 

Sample Output

4

题意：n头牛，m个牛棚，每头牛都有一些自己喜欢的，问最多能让几头牛住进自己喜欢的牛棚

思路：源点每头牛连边，每个牛棚和汇点连边，牛和牛棚连边，权值都是1，然后跑dinic1求最大流就好了

#include<stdio.h>
#include<queue>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
#define inf 1e9
#define maxn 1005
struct Edge
{
    int to,next,flow;
} e[maxn*maxn*5];
int d[maxn],n,m,head[maxn],cur[maxn],cnt,s,t;
void add(int u,int v,int flow)
{
    e[cnt].flow=flow;
    e[cnt].to=v;
    e[cnt].next=head[u];
    head[u]=cnt++;
}
void init()
{
    cnt=0;
    s=0;
    t=n+m+1;
    memset(head,-1,sizeof(head));
}
int dfs(int now,int t,int lim)
{
    if(now==t||!lim)
    {
        return lim;
    }
    int flow=0,f;
    for(int i=cur[now]; i!=-1; i=e[i].next)
    {
        cur[now]=i;
        int v=e[i].to;
        if(d[v]==d[now]+1&&(f=dfs(v,t,min(e[i].flow,lim))))
        {
            flow+=f;
            lim-=f;
            e[i].flow-=f;
            e[i^1].flow+=f;
            if(!lim)
                break;
        }
    }
    return flow;
}
int bfs(int s,int t)
{
    for(int i=0; i<=t; i++)
    {
        cur[i]=head[i];
        d[i]=0x7f7f7f7f;
    }
    queue<int>q;
    d[s]=0;
    q.push(s);
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        //printf("u=%d\n",u);
        for(int i=head[u]; i!=-1; i=e[i].next)
        {
            int v=e[i].to;
            //printf(" d[%d]=%d e[i].flow=%d\n",v,d[v],e[i].flow);
            if(d[v]>inf&&e[i].flow)
            {

                d[v]=d[u]+1;
                q.push(v);
            }
        }
    }
    if(d[t]<inf)
        return 1;
    else
        return 0;
}
int slove()
{
    int ans=0;
    while(bfs(s,t))
    {
        ans+=dfs(s,t,inf);
    }

    return ans;
}
int main()
{
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        init();
        for(int i=1; i<=n; i++)
        {
            add(s,i,1);
            add(i,s,0);
            int k;
            scanf("%d",&k);
            for(int j=1; j<=k; j++)
            {
                int x;
                scanf("%d",&x);
                add(i,x+n,1);
                add(n+x,i,0);
            }
        }
        for(int i=1; i<=m; i++)
        {
            add(n+i,t,1);
            add(t,n+i,0);

        }
        int ans=slove();
        printf("%d\n",ans);
    }
}

---