POJ1274 The Perfect Stall
来源:互联网 发布:python自然语言处理包 编辑:程序博客网 时间:2024/05/17 07:58
The Perfect Stall
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25739 Accepted: 11444
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.
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 52 2 53 2 3 42 1 53 1 2 51 2
Sample Output
4
Source
USACO 40
————————————————————————————————题目的意思是给出n头牛喜欢机器的关系,求最大匹配
思路:二分图最大匹配模板题
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <cmath>#include <algorithm>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;const int MAXN=1000;int uN,vN; //u,v数目int g[MAXN][MAXN];int linker[MAXN];bool used[MAXN];bool dfs(int u){ int v; for(v=1; v<=vN; v++) if(g[u][v]&&!used[v]) { used[v]=true; if(linker[v]==-1||dfs(linker[v])) { linker[v]=u; return true; } } return false;}int hungary(){ int res=0; int u; memset(linker,-1,sizeof(linker)); for(u=1; u<=uN; u++) { memset(used,0,sizeof(used)); if(dfs(u)) res++; } return res;}int main(){ int k,m,x; while(~scanf("%d%d",&uN,&vN)) { memset(g,0,sizeof g); for(int i=1;i<=uN;i++) { scanf("%d",&k); for(int j=0;j<k;j++) { scanf("%d",&x); g[i][x]=1; } } printf("%d\n",hungary()); } return 0;}
阅读全文
0 0
- POJ1274 The Perfect Stall
- POJ1274 The Perfect Stall
- poj1274 - The Perfect Stall
- poj1274 The Perfect Stall
- POJ1274 The Perfect Stall
- 【poj1274】 The Perfect Stall
- POJ1274 The Perfect Stall
- POJ1274-The Perfect Stall
- POJ1274 The Perfect Stall
- POJ1274-The Perfect Stall
- POJ1274: The Perfect Stall 题解
- poj1274 The Perfect Stall (匈牙利算法)
- POJ1274--The Perfect Stall(最大流)
- 解题报告 之 POJ1274 The Perfect Stall
- POJ1274 The Perfect Stall(二分图)
- poj1274 The Perfect Stall(二分图匹配)
- USACO Section4.2 The Perfect Stall &&POJ1274
- poj1274 The Perfect Stall【二分图匹配】
- C/C++:string.c_str()
- $("#loginname").tips和jQuery中 的ajax
- hdu 3535 混合背包
- 实战:Nodejs+Mongodb+Elasticsearch 实现简单的搜索
- HBuilder打包Vue-cli构建的APP
- POJ1274 The Perfect Stall
- Java菜鸟学习日记1
- Python 函数参数魔法
- stderr和stdout(printf、fprintf、sprintf)
- YANG语法
- 矩形面积相交
- mysql 字符串转数字并排序
- Mysql、Oracle、DB2、Sqlserver 随机查询语句
- leetcode_median of two sorted arrays