zoukankan      html  css  js  c++  java
  • poj1274(匈牙利算法)

    The Perfect Stall
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 22809   Accepted: 10161

    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

    Source

     

    最简单的匈牙利算法
    直接套两个模块就行了
    之前把n,m搞反了
    题意:其实n指的是牛的头数,而m是牛栏,接下来n行意思是第i头牛愿意在哪些牛栏产奶
    实际就是一个最大匹配问题
    AC代码
    #include<cstdio>
    #include<cstring>
    #include<iostream>
    using namespace std;
    int cow[205];
    int fence[205];
    int map[205][205];
    int match[205];
    bool visited[205];
    int count;
    int n,m;
    bool DFS(int k)
    {
        for(int i=1;i<=m;i++)
        if(map[k][i]&&!visited[i])
        {
            visited[i]=true;
            if(match[i]==-1||DFS(match[i]))
            {
                match[i]=k;
                return true;
            }
        }
        return false;
    }
    void hungary()
    {
        count=0;
        for(int i=1;i<=n;i++)
        {
            memset(visited,0,sizeof(visited));
            if(DFS(i))count++;
        }
        cout<<count<<endl;
    }
    int main()
    {
        while(~scanf("%d %d",&n,&m))
        {
            memset(map,0,sizeof(map));
            for(int i=1;i<=n;i++)//n,m读题!!! 
            {int f;
                cin>>f;
                for(int j=1;j<=f;j++)
                {int c;
                    cin>>c;
                    map[c][i]=1;//  牛指向牛栏 
                }
            }
            memset(match,-1,sizeof(match));
            hungary();
        } 
        return 0;
    }
  • 相关阅读:
    ArcGis面要素空间连接,取相交面积最大者 C#
    迅雷下载器无限制版_无敏感_无限速
    redhat 6.8 配置 centos6 163 的 yum 源
    apache cgi 程序: End of script output before headers
    centos php 安装 decrypt
    url传输中+转为%2B取到变空格的问题
    快速搭建自己的搜索引擎
    ffmpeg 文件推流 rtsp和rtmp
    svn 服务器操作
    edusoho迁移
  • 原文地址:https://www.cnblogs.com/lwhinlearning/p/5682340.html
Copyright © 2011-2022 走看看