POJ1274(二分图最大匹配)
2024-09-04 17:15:41
The Perfect Stall
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 23356 | Accepted: 10405 |
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 5
2 2 5
3 2 3 4
2 1 5
3 1 2 5
1 2
Sample Output
4 比较裸的二分图最大匹配。
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int MAXN=;
vector<int> arc[MAXN];
int n,m;
int match[MAXN],vis[MAXN];
bool dfs(int u)
{
for(int i=;i<arc[u].size();i++)
{
int to=arc[u][i];
if(!vis[to])
{
vis[to]=;
int w=match[to];
if(w==-||(dfs(w)))
{
match[to]=u;
match[u]=to;
return true;
}
}
}
return false;
}
int max_flow()
{
int ans=;
memset(match,-,sizeof(match));
for(int i=;i<=n;i++)
{
if(match[i]==-)
{
memset(vis,,sizeof(vis));
if(dfs(i)) ans++;
}
}
return ans;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=;i<=n;i++) arc[i].clear();
for(int i=;i<=n;i++)
{
int s;
scanf("%d",&s);
for(int j=;j<s;j++)
{
int u;
scanf("%d",&u);
u+=n;
arc[i].push_back(u);
arc[u].push_back(i);
}
}
int res=max_flow();
printf("%d\n",res);
}
return ;
}
最新文章
- MySQL GROUP BY用法
- selenium借助AutoIt识别上传(下载)详解
- workerman是一个高性能的PHP socket服务器框架
- log4j日志的打印
- MySQL显示连接的数据库名
- ASP.NET 3.5路由总结篇
- C#中单问号,双问号的用法(转)
- c语言,链表
- HDU 2668 Daydream
- 浅谈Java的集合体系
- opencv-python与c++ opencv中的一些区别和基础的知识
- linuxDNS
- OO第二阶段纪实
- Leetcode 283.移动零 By Python
- python读取大文件
- 用Java随机生成四则运算
- [转]Using Browser Link in Visual Studio 2013
- linux-shell-screen后台调用-后台运行脚本和命令-仿start命令-伪窗口界面
- TCP&;UDP基础
- 查杀病毒的NB命令