zoukankan      html  css  js  c++  java
  • POJ 3281 最大流

    Dining
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 17251   Accepted: 7643

    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: NF, 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

    题意:
    有n头牛,m中食物,p种饮料,又给出每头牛喜欢的食物和饮料编号,问有多少头牛能够即可以吃食物又可以喝饮料。
    代码:
    //源点向食物权值为1的建边,饮料向汇点建权值为1的边,把牛拆点后连接食物和饮料。
    //求最大流即可。
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<vector>
    #include<queue>
    using namespace std;
    const int maxn=409;
    const int inf=0x7fffffff;
    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>edges;
        vector<int>g[maxn];
        bool vis[maxn];
        int d[maxn];
        int cur[maxn];
        void Init(int n){
            this->n=n;
            for(int i=0;i<n;i++) g[i].clear();
            edges.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<(int)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<(int)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==0) 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;
        }
    }dc;
    int n,m,p,x,y,a;
    int main()
    {
        while(scanf("%d%d%d",&n,&m,&p)==3){
            dc.Init(m+p+2*n+2);
            for(int i=1;i<=n;i++)
                dc.Addedge(i,i+n,1);
            for(int i=1;i<=m;i++)
                dc.Addedge(0,i+2*n,1);
            for(int i=1;i<=p;i++)
                dc.Addedge(i+2*n+m,2*n+m+p+1,1);
            for(int i=1;i<=n;i++){
                scanf("%d%d",&x,&y);
                while(x--){
                    scanf("%d",&a);
                    dc.Addedge(a+2*n,i,1);
                }
                while(y--){
                    scanf("%d",&a);
                    dc.Addedge(i+n,a+2*n+m,1);
                }
            }
            printf("%d
    ",dc.Maxflow(0,2*n+m+p+1));
        }
        return 0;
    }
  • 相关阅读:
    MaskRCNN路标:TensorFlow版本用于抠图
    TensorFlow: Could not load requested Qt binding.
    OpenCV3 Java 机器学习使用方法汇总
    pycuda installation error: command 'gcc' failed with exit status 1
    OpenCV:使用OpenCV3随机森林进行统计特征多类分析
    CNN结构:Windows使用FasterRCNN-C++版本
    CNN结构:色彩特征提取-从RGB空间到HSV空间(色彩冷暖判断)
    CNN结构:色温-冷暖色的定义和领域区分(一)
    CNN结构:色彩空间建模-色彩空间分析
    windows编译MaskRCNN
  • 原文地址:https://www.cnblogs.com/--ZHIYUAN/p/6739157.html
Copyright © 2011-2022 走看看