The Perfect Stall(POJ_1274)
来源:互联网 发布:服装生产库存软件 编辑:程序博客网 时间:2024/05/16 14:58
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
USACO 40
代码
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int MAXN=222;int n,m;int un,vn;int g[MAXN][MAXN];int linker[MAXN];bool vis[MAXN];bool dfs(int u){ int v; for(v=0; v<vn; v++) { if(g[u][v]&&!vis[v]) { vis[v]=1; if(linker[v]==-1||dfs(linker[v])) { linker[v]=u; return 1; } } } return 0;}int hungary(){ int u; int res=0; memset(linker,-1,sizeof(linker)); for(u=0; u<un; u++) { memset(vis,0,sizeof(vis)); if(dfs(u)) res++; } return res;}int main(){ int a,b; while(~scanf("%d%d",&n,&m)) { memset(g,0,sizeof(g)); for(int i=0; i<n; i++) { scanf("%d",&a); while(a--) { scanf("%d",&b); g[i][b-1]=1; } } un=n; vn=m; printf("%d\n",hungary()); } return 0;}
- poj_1274 The Perfect Stall
- The Perfect Stall(POJ_1274)
- POJ1274 The Perfect Stall
- POJ1274 The Perfect Stall
- The Perfect Stall
- poj1274 - The Perfect Stall
- poj1274 The Perfect Stall
- The Perfect Stall
- POJ1274 The Perfect Stall
- The Perfect Stall
- poj The Perfect Stall
- The Perfect Stall
- The Perfect Stall
- 【poj1274】 The Perfect Stall
- POJ1274 The Perfect Stall
- POJ1274-The Perfect Stall
- POJ1274 The Perfect Stall
- POJ1274-The Perfect Stall
- 浅谈zookeeper的在hbase集群中的作用
- Deep Learning论文笔记之(四)CNN卷积神经网络推导和实现
- Deep Learning论文笔记之(五)CNN卷积神经网络代码理解
- 《Java设计模式》之状态模式
- 过度疲劳易诱发癌症!从疲劳到癌症只有5步!我们要把危险扼杀在摇篮!
- The Perfect Stall(POJ_1274)
- hdu 5396 Expression 区间DP+排列组合 2015 Multi-University Training Contest 9
- 数据持久化
- 《Java设计模式》之策略模式
- Android学习之ScollView嵌套ListView和GridView问题
- asp.net CheckBox 綁定Boolean 類型
- scikit-learn:class and function reference(看看你到底掌握了多少。。)
- android studio的安装
- iOS的电话号码344格式以及判断电话号码的正则表达式