POJ 1274-The Perfect Stall(二分图_最大匹配)
来源:互联网 发布:psp值得玩的游戏知乎 编辑:程序博客网 时间:2024/05/05 23:19
The Perfect Stall
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19272 Accepted: 8737
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
题意:有n头奶牛,m个牛圈,奶牛只有在自己喜欢的牛圈里才会产奶,接下来n行(例题中为5,所以为1-5号牛),第一个为k,接下来k个数是第i个牛喜欢的牛圈,求有多少奶牛能最好的产奶。
思路:裸地二分图
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>#include <queue>using namespace std;int map[210][210];int vis[210];int link[210];int n,m;int dfs(int u){ int i; for(i=1;i<=n;i++){ if(!vis[i]&&map[u][i]){ vis[i]=1; if(link[i]==0||dfs(link[i])){ link[i]=u; return 1; } } } return 0;}int main(){ int i,j,k,t; int sum; while(~scanf("%d %d",&n,&m)){ memset(map,0,sizeof(map)); memset(link,0,sizeof(link)); for(i=1;i<=n;i++){ scanf("%d",&k); while(k--){ scanf("%d",&t); map[i][t]=1; } } sum=0; for(i=1;i<=n;i++){ memset(vis,0,sizeof(vis)); if(dfs(i)) sum++; } printf("%d\n",sum); } return 0;}
0 0
- POJ 1274-The Perfect Stall(二分图_最大匹配)
- POJ 1274 The Perfect Stall 二分图最大匹配
- 二分图最大基数匹配 POJ 1274 The Perfect Stall
- POJ 1274 The Perfect Stall(二分图最大匹配)
- 【二分图+最大匹配】北大 poj 1274 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 二分图 最大匹配
- POJ 1274 The Perfect Stall(二分图最大匹配)
- poj The Perfect Stall 1274 (二分图最大匹配)
- POJ 1274 The Perfect Stall(最大二分图匹配)
- POJ 1274 The Perfect Stall(二分图最大匹配)
- POJ-1274 The Perfect Stall(二分图最大匹配)
- POJ 1274 The Perfect Stall(最大二分匹配)
- (二分图最大匹配)The Perfect Stall
- 【POJ】1274 The Perfect Stall 二分匹配
- php+ajax 实现web页面无闪烁刷新 页面前端和后端交互
- Java 反射
- IOS的 Cocoa Touch Static Library制作
- Python线程指南
- Android SDK开发包国内下载地址
- POJ 1274-The Perfect Stall(二分图_最大匹配)
- ThinkPHP3.2.2 Widget扩展以及widget demo实例
- android 图片阅读 之 穹の思念
- C语言辗转相除法求最大公约数(欧几里得算法)
- Android 中 EditText 如何隐藏系统提供的键盘总结
- 数据结构课程设计【附上代码】
- C3P0,Proxool,BoneCP,Druid等连接池的断开自动重联功能
- gwt + ckeditor config.js定制化问题
- ubuntu下MySQL数据库中文乱码问题解决