The Perfect Stall_poj1274_匹配
2016-07-26 16:45
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.Source
USACO 40Analysis
二分图的最大匹配,c++的vector不会用只好套fp的邻接表模板惹(哭泣)匈牙利算法,话说为什么poj题目这么多要用eof被坑惨
Code
#include <stdio.h> #include <cstring> using namespace std; struct edge { int x,y,next; }; edge e[40001]; bool v[201]; int n,k,ans=0,maxE=0; int link[201],ls[40001]; void add(int x,int y) { e[++maxE].x=x; e[maxE].y=y; e[maxE].next=ls[x]; ls[x]=maxE; } bool find(int x) { for (int i=ls[x];i;i=e[i].next) if (!v[e[i].y]) { int p=link[e[i].y]; link[e[i].y]=x; v[e[i].y]=true; if (!p||find(p)) return true; link[e[i].y]=p; } return false; } int main() { while(scanf("%d%d",&n,&k)!=EOF) { maxE=0; ans=0; memset(ls,0,sizeof(ls)); memset(link,0,sizeof(link)); for (int i=1;i<=n;i++) { int x,y; scanf("%d",&x); for (int j=1;j<=x;j++) { scanf("%d",&y); add(i,y); } } for (int i=1;i<=n;i++) { memset(v,false,sizeof(v)); if (find(i)) ans++; } printf("%d\n",ans); } return 0; }
相关文章推荐
- 利用H5Canvas进行前端图片压缩再上传笔记
- js运算符知识总结
- HTML系列(1)简介
- 当引入多个js库,解决jquery冲突
- html json串动态传入方法并执行
- javascript解析json格式的数据
- css3制作正方体
- javascript中的浅拷贝和深拷贝例子
- 廖雪峰JS教程学习记录----循环
- 玩转HTML5移动页面——动效篇
- EJS 模板快速入门
- lintcode paint-fence 栅栏染色
- AngularJS路由嵌套,通过ui-route实现深层路由
- caffe 编译中出现的错误——fatal error: hdf5.h: 没有那个文件或目录
- 更改浏览器滚动条样式(火狐改不了)
- js运算符隐式类型转换
- 实用前端技巧之输入框提示语句
- 实用前端技巧之输入框提示语句
- 廖雪峰JS教程--条件判断
- html头文件设置常用之<meta>设置缓存