Poj(1274)，二分图匹配

题目链接：http://poj.org/problem?id=1274

The Perfect Stall

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 23088		Accepted: 10285

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

Source

USACO 40

 

题意：

有n个奶牛和m个谷仓，现在每个奶牛有自己喜欢去的谷仓，并且它们只会去自己喜欢的谷仓吃东西，问最多有多少奶牛能够吃到东西

输入第一行给出n与m
接着n行
每行第一个数代表这个奶牛喜欢的谷仓的个数P，后面接着P个数代表这个奶牛喜欢哪个谷仓

分析： 最大匹配，用匈牙利即可。

#include <stdio.h>
#include <string.h>

bool maps[205][205];
bool use[205];
int match[205];
int n,m;


bool DFS(int u)
{
    for(int i=1;i<=m;i++)
    {
        if(!use[i]&&maps[u][i])
        {
            use[i] = true;
            if(match[i]==-1||DFS(match[i]))
            {
                match[i] = u;
                return true;
            }
        }
    }
    return false;
}

int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        memset(match,-1,sizeof(match));
        memset(maps,false,sizeof(maps));
        for(int i=1;i<=n;i++)
        {
            int num;
            scanf("%d",&num);
            for(int j=1;j<=num;j++)
            {
                int v;
                scanf("%d",&v);
                maps[i][v] = true;
            }
        }

        int num = 0;
        for(int i=1;i<=n;i++)
        {
            memset(use,false,sizeof(use));
            if(DFS(i))
                num++;
        }
        printf("%d
",num);

    }
    return 0;
}