poj--1274--The Perfect Stall(最大匹配)
来源:互联网 发布:软件开发三层架构 编辑:程序博客网 时间:2024/05/14 04:49
The Perfect Stall
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21665 Accepted: 9735
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
#include<stdio.h>#include<string.h>#include<vector>#include<algorithm>using namespace std;vector<int>map[220];int pipei[220],used[220];int find(int x){for(int i=0;i<map[x].size();i++){int y=map[x][i];if(!used[y]){used[y]=1;if(!pipei[y]||find(pipei[y])){pipei[y]=x;return 1;}}}return 0;}int main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF){int num,y;memset(pipei,0,sizeof(pipei));for(int i=1;i<=n;i++){map[i].clear();scanf("%d",&num);while(num--){scanf("%d",&y);map[i].push_back(y);}}int sum=0;for(int i=1;i<=n;i++){memset(used,0,sizeof(used));sum+=find(i);}printf("%d\n",sum);}return 0;}
0 0
- POJ 1274 The Perfect Stall 最大匹配
- POJ 1274The Perfect Stall(二分图最大匹配)
- poj--1274--The Perfect Stall(最大匹配)
- poj The Perfect Stall 1274 (二分图最大匹配)
- POJ-1274 The Perfect Stall(二分图最大匹配)
- POJ 1274 The Perfect Stall(最大二分匹配)
- POJ 1274 The Perfect Stall 二分图最大匹配
- 二分图最大基数匹配 POJ 1274 The Perfect Stall
- POJ 1274 The Perfect Stall(二分图最大匹配)
- 【二分图+最大匹配】北大 poj 1274 The Perfect Stall
- Poj 1274 The Perfect Stall[二分图最大匹配]
- POJ 1274 The Perfect Stall 二分图最大匹配
- POJ 1274 The Perfect Stall(二分图最大匹配)
- POJ 1274-The Perfect Stall(二分图_最大匹配)
- POJ - 1274 The Perfect Stall 二分图 最大匹配
- POJ 1274 The Perfect Stall(二分图最大匹配)
- POJ 1274 The Perfect Stall(最大二分图匹配)
- POJ 1274 The Perfect Stall(二分图最大匹配)
- REST与SOAP之比较
- 2016年要学会用存储过程向关联的几张表里面插入数据。
- Android5.X新特性
- JAVA_JCF(Java Collection Framework)学习笔记(三)
- android 拍照,裁切,上传圆形头像, 图片等比缩放
- poj--1274--The Perfect Stall(最大匹配)
- SSM框架——详细整合教程(Spring+SpringMVC+MyBatis)
- 华为机试题:汽水瓶
- SSH多数据库连接
- objc/runtime.h之Associated Objects ==关联
- Mac OS下安装MyEclipse报错:Your system does not have sufficient memory to support MyEclipse
- Caused by: java.lang.ClassNotFoundException: org.hibernate.engine.transaction.spi.TransactionContext
- 深入浅出Alljoyn与互联网通讯
- 对象XMLHttpRequest readyState 和status状态对照 (收集)