POJ_3281_Dining(最大流dinic模板)

Dining

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 11703		Accepted: 5380

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 preparedD (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种饮料。题目给出每头牛喜欢吃的食物与饮料。问给每头牛指定一种食物与一种饮料，最多能满足多少头牛？

分析：一看感觉是二分图匹配问题，然而他是一头牛匹配两种物品，所以可以用网络流来做。关键在于建图，可以建立（s - 食物 - 牛 - 饮料 - t）这样的图，容量为1。但是这样子还是会出错，一头牛可能匹配多种食物，我们可以把一头牛拆成两个点，那么构成图（s - 食物 - 牛 - 牛 - 饮料 - t），这样子每头牛就限定只能一种食物一种饮料了。然后就是使用最大流模板了。

这题用EK算法也能过，我用的是dinic算法，留做模板。

题目链接：http://poj.org/problem?id=3281
代码清单：

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<ctime>
#include<cctype>
#include<string>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;

typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;

const int maxn = 500 + 5;
const int INF = 0x7f7f7f7f;

struct Edge{
    int from,to,cap,flow;
    Edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){}
};

struct dinic{
    int n,m,s,t; //结点数，边数(包括反向弧)，源点，汇点
    vector<Edge>edge;//边表。edge[e]和edge[e^1]互为反向弧
    vector<int>G[maxn];//邻接表。G[i][j]表示结点i的第j条边在e数组的序号
    bool vis[maxn]; //bfs用
    int d[maxn]; //从起点到i的距离
    int cur[maxn]; //当前弧下标

    void init(int n,int s,int t){
        this -> n = n;
        this -> s = s;
        this -> t = t;
        for(int i=0;i<=n;i++) G[i].clear();
        edge.clear();
    }

    void addEdge(int from,int to,int cap){
        edge.push_back(Edge(from,to,cap,0));
        edge.push_back(Edge(to,from,0,0));
        m=edge.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool bfs(){
        memset(vis,false,sizeof(vis));
        queue<int>q;
        q.push(s);
        d[s]=0;
        vis[s]=true;
        while(!q.empty()){
            int x=q.front();q.pop();
            for(int i=0;i<G[x].size();i++){
                Edge& e=edge[G[x][i]];
                if(!vis[e.to]&&e.cap>e.flow){ //只考虑残量网络中的弧
                    vis[e.to]=true;
                    d[e.to]=d[x]+1;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }

    int dfs(int x,int a){
        if(x==t||a==0) return a;
        int flow=0,f;
        for(int& i=cur[x];i<G[x].size();i++){ // & -> 从上次考虑的弧
            Edge& e=edge[G[x][i]];
            if(d[x]+1==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0){
                e.flow+=f;
                edge[G[x][i]^1].flow-=f;
                flow+=f;
                a-=f;
                if(a==0) break;
            }
        }
        return flow;
    }

    int maxflow(){
        int flow=0;
        while(bfs()){
            memset(cur,0,sizeof(cur));
            flow+=dfs(s,INF);
        }
        return flow;
    }
};

int N,F,D,Fi,Di,fo,dr;
int s,t;
dinic dc;

void input(){
    scanf("%d%d%d",&N,&F,&D);

    s=0,t=F+2*N+D+1;
    dc.init(t+1,s,t);

    for(int i=1;i<=F;i++) dc.addEdge(0,i,1);
    for(int i=1;i<=N;i++) dc.addEdge(F+i,F+i+N,1);
    for(int i=1;i<=D;i++) dc.addEdge(F+2*N+i,t,1);

    for(int i=1;i<=N;i++){
        scanf("%d%d",&Fi,&Di);
        for(int j=0;j<Fi;j++){
            scanf("%d",&fo);
            dc.addEdge(fo,F+i,1);
        }
        for(int j=0;j<Di;j++){
            scanf("%d",&dr);
            dc.addEdge(F+i+N,F+2*N+dr,1);
        }
    }
}

void solve(){
    printf("%d\n",dc.maxflow());
}

int main(){
    input();
    solve();
    return 0;
}