POJ1274_The Perfect Stall(二分图最大匹配)
来源:互联网 发布:ubuntu卸载skype 编辑:程序博客网 时间:2024/06/05 20:39
解题报告
http://blog.csdn.net/juncoder/article/details/38136193
题目传送门
题意:
n头m个机器,求最大匹配。
ps
一分钟前刚做了POJ1469 直接改了输入输出就交了,题意完全一样,,,sad ,代码传送门
The Perfect Stall
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18108 Accepted: 8227
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
0 0
- POJ1274_The Perfect Stall(二分图最大匹配)
- (二分图最大匹配)The Perfect Stall
- usaco 4.2 The Perfect Stall 二分图最大匹配
- POJ 1274 The Perfect Stall 二分图最大匹配
- 二分图最大基数匹配 POJ 1274 The Perfect Stall
- POJ1274 The Perfect Stall [二分图最大匹配 匈牙利算法]
- POJ 1274 The Perfect Stall(二分图最大匹配)
- 【二分图+最大匹配】北大 poj 1274 The Perfect Stall
- USCAO4.2 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(二分图_最大匹配)
- POJ1274 The Perfect Stall【二分图最大匹配】
- POJ - 1274 The Perfect Stall 二分图 最大匹配
- The Perfect Stall(二分图最大匹配)
- poj1274 The Perfect Stall(二分图匹配 / 最大流)
- 如何在写GUI程序时,将调试信息打印在控制台窗口
- 哈佛结构与普林斯顿结构的区别通俗易懂
- Centos bridge 上网配置
- java.lang.OutOfMemoryError: Java heap space 解决
- 南阳理工acm
- POJ1274_The Perfect Stall(二分图最大匹配)
- js中关于setTimeOut()循环的问题
- 关于java中getClass()和super.getClass()
- 一键显示电脑IP
- 计算机学院研发第二轮考核-------浏览器之无图模式
- 使用memcpy缓冲区溢出了
- Adobe DreamWeaver 8.0激活码
- 方便快捷的小工具<<<---->>>日历
- Java程序的编译、执行和打包