The Perfect Stall
2016-04-07 23:50
316 查看
算法:二分图匹配+匈牙利算法;
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
代码:
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 <cstring> #include <string> #include <iomanip> #include <algorithm> #include <vector> using namespace std; vector<int>map[205]; int cx[205],cy[205],n,m; int vis[205]; int find(int u) { for(int i=0;i<map[u].size();i++) { if(!vis[map[u][i]]) { vis[map[u][i]]=1; if(cy[map[u][i]]==-1||find(cy[map[u][i]])) { cx[u]=map[u][i]; cy[map[u][i]]=u; return 1; } } } return 0; } int main() { int i,j,k,p,q; while(cin>>n>>m) { for(i=1;i<=n;i++) { cin>>k; for(j=0;j<k;j++) { cin>>p; map[i].push_back(p); } } memset(cx,-1,sizeof(cx)); memset(cy,-1,sizeof(cy)); int sum=0; for(i=1;i<=n;i++) { if(cx[i]==-1) { memset(vis,0,sizeof(vis)); if(find(i))sum++; } } cout<<sum<<endl; for(i=0;i<=n;i++) map[i].clear(); } return 0; }
相关文章推荐
- 解决jsp页面中始终报错无法引用WEB-INF下面js文件夹里的js文件
- css3 图片翻转效果
- jquery动画累积执行解决方法
- Bootstrap起步介绍
- easyui + jquery 提交form表单 jquery submit失效
- jQuery——小案例:点击图片放大缩小
- javascript基础语法(做题)
- 阿里2016实习offer五面经验与总结
- bootstrap编码规范
- JS匿名函数
- 在NodeJS中使用流程控制工具Async
- 一看就懂的ReactJs入门教程(精华版)
- String and StringBuffer
- 给 JavaScript 初心者的 ES2015 实战
- angularjs使用中国的一些细节
- swap nodes in pairs
- 结构-行为-样式-angularJs ngAnimate(Js实现)
- SASS的简单运用,css更快
- Array类型(声明与属性)
- jquery如何遍历json字符串