poj 3281 Dining（分点，最大流）

Dining

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 14136		Accepted: 6424

Description

Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.

Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against their preferences. Although he might not be able to stuff everybody, he wants to give a complete meal of both food and drink to as many cows as possible.

Farmer John has cooked F (1 ≤ F ≤ 100) types of foods and prepared D (1 ≤ D ≤ 100) types of drinks. Each of his N (1 ≤ N ≤ 100) cows has decided whether she is willing to eat a particular food or drink a particular drink. Farmer John must assign a food type and a drink type to each cow to maximize the number of cows who get both.

Each dish or drink can only be consumed by one cow (i.e., once food type 2 is assigned to a cow, no other cow can be assigned food type 2).

Input

Line 1: Three space-separated integers:  N,  F, and  D 
Lines 2.. N+1: Each line  i starts with a two integers  F_i and  D_i, the number of dishes that cow  i likes and the number of drinks that cow  i likes. The next  F_i integers denote the dishes that cow  i will eat, and the D_i integers following that denote the drinks that cow  i will drink.

Output

Line 1: A single integer that is the maximum number of cows that can be fed both food and drink that conform to their wishes

Sample Input

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

Sample Output

3

Hint

One way to satisfy three cows is: 
Cow 1: no meal 
Cow 2: Food #2, Drink #2 
Cow 3: Food #1, Drink #1 
Cow 4: Food #3, Drink #3 
The pigeon-hole principle tells us we can do no better since there are only three kinds of food or drink. Other test data sets are more challenging, of course.

题意：n只奶牛，f份食物，d份饮料。每只奶牛有自己喜欢的食物和饮料，奶牛选择了第i份食物或者饮料的时候其他奶牛不能选择，问最多有几只奶牛能吃到食物和饮料。

思路：最大流，主要在构图。此题巧妙在一个顶点有多个入度的时候，通过分一个点出来，边流量为1，从而达到只有一个可以流出的图。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define N 5005
#define INF 0x3f3f3f3f
struct Edge
{
    int to,next,cap;
} edge[N*N];
int cnt,head[N],d[N];
int ma[N];
int a[N];
void init()
{
    cnt=0;
    memset(head,-1,sizeof(head));
}
void addedge(int from,int to,int cap)
{
    edge[cnt].to=to;
    edge[cnt].cap=cap;
    edge[cnt].next=head[from];
    head[from]=cnt++;

    edge[cnt].to=from;
    edge[cnt].cap=0;
    edge[cnt].next=head[to];
    head[to]=cnt++;
}

int bfs(int s,int t)
{
    memset(d,-1,sizeof(d));
    queue<int> q;
    q.push(s);
    d[s]=0;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int i=head[u]; i!=-1; i=edge[i].next)
        {
            int v=edge[i].to;
            if(d[v]==-1&&edge[i].cap>0)
            {
                d[v]=d[u]+1;
                q.push(v);
            }
        }
    }
    return d[t]!=-1;
}
int dfs(int s,int t,int f)
{
    if(s==t||f==0) return f;
    int flow=0;
    for(int i=head[s]; i!=-1&&flow<f; i=edge[i].next)
    {
        int v=edge[i].to;
        if(d[v]==d[s]+1&&edge[i].cap>0)
        {
            int x=min(f-flow,edge[i].cap);
            x=dfs(v,t,x);
            flow+=x;
            edge[i].cap-=x;
            edge[i^1].cap+=x;
            if(f==0) break;
        }
    }
    if(!flow) d[s]=-2;
    return flow;
}
int Dinic(int s,int t)///起点s终点t
{
    int flow=0,f;
    while(bfs(s,t))
    {
        while(f=dfs(s,t,INF))
            flow+=f;
    }
    return flow;
}
int main()
{
    int n,f,d,t;
    int f1,d1;
    while(~scanf("%d %d %d",&n,&f,&d))
    {
        init();
        int S=0,T=n+f+d+2;
        for(int i=1; i<=n; i++)
        {
            scanf("%d %d",&f1,&d1);
            for(int j=1; j<=f1; j++)
            {
                scanf("%d",&t);
                addedge(n+t,i,1);
            }
            addedge(i,T,1);
            for(int j=1; j<=d1; j++)
            {
                scanf("%d",&t);
                addedge(T,n+f+t,1);
            }
            T++;
        }
        for(int i=1; i<=f; i++)
            addedge(S,n+i,1);
        for(int i=1; i<=d; i++)
            addedge(n+f+i,T,1);
        printf("%d\n",Dinic(S,T));
    }
    return 0;
}