poj 1274 The Perfect Stall【匈牙利算法模板题】

时间：2015-09-14 15:23:41 阅读：172 评论：0 收藏：0 [点我收藏+]

标签：

The Perfect Stall

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 20874		Accepted: 9421

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

4

题意：奶牛只在指定的摊位才肯产奶，第一行输入n，m分别代表母牛数量和摊位的数量，接下来m行，第i行就代表第i头奶牛，每行开头一个数k代表接下来这一行要输入的摊位号

匈牙利算法模板都快忘了  复习一下 以后也不能老刷模板题

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAX 210
using namespace std;
int n,m;
int cow[MAX][MAX],space[MAX];
int vis[MAX];
int find(int x)
{
    int i,j;
	for(i=1;i<=m;i++)
	{
		if(cow[x][i]&&!vis[i])
		{
			vis[i]=1;
			if(space[i]==0||find(space[i]))
			{
				space[i]=x;
				return 1;
			}
		}
	}	
	return 0;
}
int main()
{
	int i,j,t,a;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(cow,0,sizeof(cow));
		memset(space,0,sizeof(space));
		for(i=1;i<=n;i++)
		{
			scanf("%d",&t);
			for(j=1;j<=t;j++)
			{
				scanf("%d",&a);
				cow[i][a]=1;
			}
		}
		int sum=0;
		for(i=1;i<=n;i++)
		{
			memset(vis,0,sizeof(vis));
			if(find(i))
			    sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}

poj 1274 The Perfect Stall【匈牙利算法模板题】

标签：

原文地址：http://www.cnblogs.com/tonghao/p/4806992.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行