POJ 3281 Dining (最大流)

题意：

告诉你每个牛喜欢的食物和饮料，每个食物和每个饮料只能给一只牛，求最大有多少牛 能得到喜欢的食物和饮料？

思路：

给每个食物向牛连边， 给每个饮料向喜欢的牛连边， 牛拆点 容量为1 保证前面只有一种食物，后面只有一种饮料。

食物连源， 饮料连汇，求最大流即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define Siz(x) (int)x.size()
using namespace std;
const int maxn = 1000 + 7;
const int inf = 1000000;

struct Edge{
    int from, to, cap, flow;
};

struct Dinic{
    int n, m, s, t;
    vector<Edge>edges;
    vector<int>G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];

    void init(int nn){
        edges.clear();
        for (int i = 0; i < nn; ++i)G[i].clear();
    }

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

    bool BFS(){
        memset(vis,0,sizeof vis);
        queue<int>Q;
        Q.push(s);
        d[s] = 0;
        vis[s] = 1;
        while(!Q.empty()){
            int x = Q.front(); Q.pop();
            for (int i = 0; i < G[x].size(); ++i){
                Edge& e = edges[G[x][i]];
                if (!vis[e.to] && e.cap > e.flow) {
                    vis[e.to] = 1;
                    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 = edges[G[x][i]];
            if (d[x] + 1 == d[e.to] && (f = DFS(e.to,min(a,e.cap-e.flow))) > 0){
                e.flow += f;
                edges[G[x][i]^1 ].flow -= f;
                flow += f;
                a -= f;
               if (!a)break;


            }

        }
        return flow;
    }

    int Maxflow(int s,int t){
        this->s = s; this->t = t;
        int flow = 0;
        while(BFS()){
            memset(cur,0,sizeof cur);
            flow += DFS(s,inf);
        }
        return flow;
    }

}dic;
int main(){
    int n,f,d;
    scanf("%d %d %d",&n, &f, &d);
    dic.init(2*n+f+d+10);
    for (int i = 1; i <= n; ++i){
        dic.AddEdge(i,i+n,1);
    }

    for (int i = 1; i <= f; ++i){
        dic.AddEdge(0,2*n+i,1);
    }
    for (int i  =1; i <= d; ++i){
        dic.AddEdge(2*n+f+i,2*n+f+d+1,1);
    }

    for (int i = 1; i <= n; ++i){
        int ff,dd;
        scanf("%d%d",&ff, &dd);
        while(ff--){
            int x;
            scanf("%d",&x);
            dic.AddEdge(2*n+x,i,1);
        }
        while(dd--){
            int x;
            scanf("%d",&x);
            dic.AddEdge(n+i,2*n+f+x,1);
        }
    }

    printf("%d\n",dic.Maxflow(0,2*n+f+d+1));

    return 0;
}
/**

**/

Dining Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 17090   Accepted: 7572 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  Fi and  Di, the number of dishes that cow  i likes and the number of drinks that cow  i likes. The next  Fi integers denote the dishes that cow  i will eat, and the  Di 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. Source USACO 2007 Open Gold

[Submit]   [Go Back]   [Status]   [Discuss]