poj--1274--The Perfect Stall(匈牙利裸题)
来源:互联网 发布:知柏地黄丸不良反应 编辑:程序博客网 时间:2024/06/05 00:44
The Perfect Stall
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21868 Accepted: 9809
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
#include<cstdio>#include<cstring>#include<queue>#include<vector>#include<algorithm>using namespace std;#define MAXN 100000+10vector<int>G[10000];int pipei[MAXN],used[MAXN],n,m;int find(int u){for(int i=0;i<G[u].size();i++){int v=G[u][i];if(!used[v]){used[v]=1;if(pipei[v]==-1||find(pipei[v])){pipei[v]=u;return 1;}}}return 0;}int main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF){for(int i=1;i<=n;i++)G[i].clear();memset(pipei,-1,sizeof(pipei));for(int i=1;i<=n;i++){int t;scanf("%d",&t);while(t--){int a;scanf("%d",&a);G[i].push_back(a);}}int ans=0;for(int i=1;i<=n;i++){memset(used,0,sizeof(used));ans+=find(i);}printf("%d\n",ans);}return 0;}
0 0
- 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-1274The 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
- Redis集群管理之Redis Cluster集群节点增减
- MySQLInnoDBDialect和MySQLMyISAMDialect的差别
- LeetCode 319 Bulb Switcher(灯泡切换)(从规律中发现算法……)
- 解决“无法完成操作,因为文件包含病毒或潜在的垃圾软件”
- Java中的匿名内部类总结
- poj--1274--The Perfect Stall(匈牙利裸题)
- 工作生活感悟
- 隐藏输入法
- Ubuntu设置ssh免密码登陆
- 安卓通知的使用系列6:对话框通知的使用之自定义对话框
- iOS将字符串3DES加密后转Base64
- overridePendingTransition()的作用
- WEB开发者必备的7个JavaScript函数
- Vijos P1123均分纸牌