POJ 1274--The Perfect Stall【二分图 && 最大匹配数 && 水题】
2015-08-26 21:00
573 查看
The Perfect Stall
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
Sample Output
水题瞬秒:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 20795 | Accepted: 9386 |
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
水题瞬秒:
#include <cstdio> #include <cstring> #include <algorithm> #define maxn 220 using namespace std; int n, m; int map[maxn][maxn]; int used[maxn]; int link[maxn]; void init(){ memset(map, 0, sizeof(map)); } void getmap(){ for(int i = 1; i <= n; ++i){ int k; scanf("%d", &k); while(k--){ int a; scanf("%d", &a); map[i][a] = 1; } } } bool dfs(int x){ for(int i = 1; i <= m; ++i){ if(map[x][i] && !used[i]){ used[i] = 1; if(link[i] == -1 || dfs(link[i])){ link[i] = x; return true; } } } return false; } int hungary(){ int ans = 0; memset(link, -1, sizeof(link)); for(int i = 1; i <= n; ++i){ memset(used, 0, sizeof(used)); if(dfs(i)) ans++; } return ans; } int main (){ while(scanf("%d%d", &n, &m) != EOF){ init(); getmap(); int sum = hungary(); printf("%d\n", sum); } return 0; }
相关文章推荐
- JQUERY延迟对象
- json字符串的类型以及在javascript中的解析方式
- JSTL标签结合EL表达式——java web前端瘦身器
- pdf2htmlEX将pdf文件转化为html最优参数以及把生成文件等比例缩小
- css3的display定义不同类型的盒
- JS变量名命名规范
- hdoj 1015 Safecracker【DFS】
- css图片垂直居中
- sharedPreference的奇怪bug
- Jquery操作Cookie,保存商品ID值至本地文件中
- caffe优化算法
- hdoj 1203 I NEED A OFFER! 【01背包】
- 【JavaScript】正则表达式
- HDOJ 1203 I NEED A OFFER!(01背包)
- HTML5语言的28个新特性学习
- jquery学习——选择器
- Could not initialize class net.sf.json.util.JSONUtils
- poj1990MooFest(树状数组)
- HTML 5 <input> placeholder 属性
- HTML 5 <input> placeholder 属性