The Perfect Stall(二分图最大匹配)

转载 2015年07月09日 20:41:20
The Perfect Stall
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 20251   Accepted: 9130

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

5 5
2 2 5
3 2 3 4
2 1 5
3 1 2 5
1 2 

Sample Output

4


#include<cstdio>
#include<iostream>
#include<cstring>
const int maxs=215;
using namespace std;
int n,m;
int vis[maxs];
int map[maxs][maxs];
int liked[maxs];
int success(int x)
{
    int i;
    for(i=1;i<=m;i++)
    {
        if(!vis[i]&&map[x][i]==1)
        {
            vis[i]=1;
            if(!liked[i]||success(liked[i]))
            {
                liked[i]=x;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int k,a,num,i;
    while(cin>>n>>m)
    {
        num=0;
        memset(map,0,sizeof(map));
        memset(liked,0,sizeof(liked));
        for(i=1;i<=n;i++)
        {
            cin>>k;
            while(k--)
            {
                cin>>a;
                map[i][a]=1;
            }
        }
        for(i=1;i<=n;i++)
        {
            memset(vis,0,sizeof(vis));
            if(success(i))
            {
                num++;
            }
        }
        cout<<num<<endl;
    }
}


The Perfect Stall(最大二分匹配)

Link:http://poj.org/problem?id=1274
  • Enjoying_Science
  • Enjoying_Science
  • 2014年11月03日 13:34
  • 513

POJ 1274-The Perfect Stall(二分图匹配/最大流问题)

The Perfect Stall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23108...
  • MIKASA3
  • MIKASA3
  • 2016年08月12日 17:21
  • 249

POJ 1274 The Perfect Stall 二分匹配||最大流(简单题)

点击打开链接   The Perfect Stall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16555 ...
  • Dinivity123
  • Dinivity123
  • 2013年09月23日 21:17
  • 1329

The Perfect Stall POJ - 1274 (二部图的最大匹配)

The Perfect Stall POJ - 1274 Farmer John completed his new barn just last week, complete with al...
  • codeswarrior
  • codeswarrior
  • 2017年11月21日 16:00
  • 77

poj 1274 The Perfect Stall 【二分匹配裸题】【练模板】

The Perfect Stall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 20776...
  • chenzhenyu123456
  • chenzhenyu123456
  • 2015年08月24日 20:22
  • 282

poj 1274 The Perfect Stall(匈牙利算法模板)

The Perfect Stall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 22896...
  • acm_cxq
  • acm_cxq
  • 2016年07月26日 17:47
  • 130

(二分图最大匹配)The Perfect Stall

题目链接:http://poj.org/problem?id=1274 入门题目,暖身。 改最大流模板的解法: #include #include #include #include #inc...
  • better_life30
  • better_life30
  • 2015年04月10日 22:38
  • 164

POJ 题目1274 The Perfect Stall(二分图最大匹配)

The Perfect Stall Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 19252...
  • yu_ch_sh
  • yu_ch_sh
  • 2015年01月10日 15:15
  • 307

POJ-1274-The Perfect Stall【二分图最大匹配】【模板题】

1274-The Perfect Stall
  • loy_184548
  • loy_184548
  • 2016年03月30日 19:13
  • 379

poj1274 The Perfect Stall(二分图匹配 / 最大流)

题意:n头牛,m个位置,每头牛可以待在s个位置上,给每个牛分配一个位置,求问最多几头牛可以分配到位置。 这是二分图匹配的基础题,也可以用最大流来做,直接贴代码。。 二分图匹配: #include #...
  • Willona_C
  • Willona_C
  • 2015年08月06日 10:24
  • 324
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:The Perfect Stall(二分图最大匹配)
举报原因:
原因补充:

(最多只允许输入30个字)