zoukankan      html  css  js  c++  java
  • poj 1274 The Perfect Stall(二分图匹配)

    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

     
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<queue>
     6 #include<vector>
     7 using namespace std;
     8 #define N 206
     9 int n,m;
    10 vector<int> v[N];
    11 int vis[N];
    12 int match[N];
    13 
    14 bool dfs(int u){
    15     for(int i=0;i<v[u].size();i++){
    16         int x=v[u][i];
    17         if(!vis[x]){
    18             vis[x]=1;
    19             if(match[x]==-1 || dfs(match[x])){
    20                 match[x]=u;
    21                 return true;
    22             }
    23         }
    24     }
    25     return false;
    26 }
    27 
    28 void solve(){
    29     int ans=0;
    30     memset(match,-1,sizeof(match));
    31     for(int i=1;i<=n;i++){
    32         memset(vis,0,sizeof(vis));
    33         if(dfs(i)){
    34             ans++;
    35         }
    36     }
    37     printf("%d
    ",ans);
    38 }
    39 int main()
    40 {
    41     
    42     while(scanf("%d%d",&n,&m)==2){
    43         
    44         for(int i=0;i<=n;i++){
    45             v[i].clear();
    46         }
    47         
    48         for(int i=1;i<=n;i++){
    49             int num;
    50             scanf("%d",&num);
    51             int y;
    52             for(int j=1;j<=num;j++){
    53                 scanf("%d",&y);
    54                 v[i].push_back(y);
    55             }
    56         }
    57         
    58         solve();
    59         
    60     }
    61     return 0;
    62 }
    View Code
  • 相关阅读:
    Docker常用命令总结(不断更新)
    Docker容器简介-与虚拟机的区别及安装步骤
    ELK搭建—安装使用Kibana可视化
    使用CURL与ElasticSearch服务进行通信
    安装部署ElasticSearch单节点在Linux服务器上
    ElasticStack分布式引擎技术栈(ELK)介绍
    为Nginx服务器配置黑(白)名单的防火墙
    php大力力 [026节] php开发状态要随时做好整理工作
    php大力力 [025节] 来不及学习和分类的,大力力认为有价值的一些技术文章合集(大力力二叔公)(2015-08-27)
    php大力力 [024节]PHP中的字符串连接操作(2015-08-27)
  • 原文地址:https://www.cnblogs.com/UniqueColor/p/4771632.html
Copyright © 2011-2022 走看看