POJ 题目1274 The Perfect Stall(二分图最大匹配)
2015-01-10 15:15
513 查看
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
Source
USACO 40
ac代码
#include<stdio.h>
#include<string.h>
int link[1010],v[1010],map[1010][1010],m,n;
int dfs(int x)
{
int i,j;
for(i=1;i<=m;i++)
{
if(!v[i]&&map[x][i])
{
v[i]=1;
if(link[i]==-1||dfs(link[i]))
{
link[i]=x;
return 1;
}
}
}
return 0;
}
int main()
{
//int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
int i,ans=0;
memset(map,0,sizeof(map));
memset(link,-1,sizeof(link));
for(i=1;i<=n;i++)
{
int num;
scanf("%d",&num);
while(num--)
{
int number;
scanf("%d",&number);
map[i][number]=1;
}
}
for(i=1;i<=n;i++)
{
memset(v,0,sizeof(v));
if(dfs(i))
ans++;
}
printf("%d\n",ans);
}
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 19252 | Accepted: 8729 |
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
Source
USACO 40
ac代码
#include<stdio.h>
#include<string.h>
int link[1010],v[1010],map[1010][1010],m,n;
int dfs(int x)
{
int i,j;
for(i=1;i<=m;i++)
{
if(!v[i]&&map[x][i])
{
v[i]=1;
if(link[i]==-1||dfs(link[i]))
{
link[i]=x;
return 1;
}
}
}
return 0;
}
int main()
{
//int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
int i,ans=0;
memset(map,0,sizeof(map));
memset(link,-1,sizeof(link));
for(i=1;i<=n;i++)
{
int num;
scanf("%d",&num);
while(num--)
{
int number;
scanf("%d",&number);
map[i][number]=1;
}
}
for(i=1;i<=n;i++)
{
memset(v,0,sizeof(v));
if(dfs(i))
ans++;
}
printf("%d\n",ans);
}
}
相关文章推荐
- [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-1274-The Perfect Stall【二分图最大匹配】【模板题】
- POJ 1274 The Perfect Stall (二分图最大匹配入门题,匈牙利算法)
- POJ1274 The 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 (二分图最大匹配模板题)
- POJ1274:The Perfect Stall(二分图最大匹配 匈牙利算法)
- POJ - 1274 The Perfect Stall 二分图 最大匹配
- Pku acm 1274 The Perfect Stall 数据结构题目解题报告(十三)---- 匈牙利算法求二分图的最大匹配
- POJ 1274 The Perfect Stall(二分图最大匹配)
- POJ 1274-The Perfect Stall(二分图_最大匹配)