The Perfect Stall_poj1274_匹配
来源:互联网 发布:腾讯漫画破解软件 编辑:程序博客网 时间:2024/06/07 02:37
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 40
Analysis
二分图的最大匹配,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;}
- The Perfect Stall_poj1274_匹配
- USACO: the perfect stall 二分图匹配
- 【POJ】1274 The Perfect Stall 二分匹配
- The Perfect Stall(最大二分匹配)
- (二分图最大匹配)The Perfect Stall
- POJ-The Perfect Stall-最大图匹配
- POJ 1274 The Perfect Stall 最大匹配
- Poj 1274 The Perfect Stall【二分匹配】
- The Perfect Stall_usaco4.2_匹配
- poj1274 The Perfect Stall(二分图匹配)
- poj1274 The Perfect Stall【二分图匹配】
- usaco 4.2 The Perfect Stall 二分图最大匹配
- POJ 1274 The Perfect Stall(最大二分匹配)
- POJ 1274 The Perfect Stall 二分图最大匹配
- 二分图匹配(简单题)POJ 1274 The Perfect Stall
- 二分图最大基数匹配 POJ 1274 The Perfect Stall
- POJ1274 The Perfect Stall 简单最大二分匹配
- POJ1274 The Perfect Stall [二分图最大匹配 匈牙利算法]
- Ldap活动目录属性
- (枚举)HDU 3711 Binary Number
- mybatis配置详解
- Matlab 7.0 中XML文件读写测试
- iOS 图片拉伸
- The Perfect Stall_poj1274_匹配
- Maven学习笔记一:Maven的安装与配置
- 归并排序与快速排序
- spring quartz 初级配置
- Android 更换新logo图标后,运行项目图标没有变化的bug
- CPU的工作原理
- 2016 DevOps 新趋势调查报告
- MySQL的InnoDB索引原理详解
- LDAP的相关概念与objectClass介绍