The Perfect Stall
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 21967 | Accepted: 9853 |
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
如题,裸的最大二分图匹配,直接用匈牙利算法,该算法核心是用dfs寻找增光路,详见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int n,m; //n头牛,m个机器
vector<int> v[500];//邻接表
bool use[500];//标记dfs时是否访问过
int book[500];//记录当前机器i匹配的牛为book[i]
bool find(int x){
int t;
for (int i=0;i<v[x].size();i++){
t=v[x][i];
if (!use[t]){//如果没有访问过
use[t]=1;//标记为1
if (book[t]==0||find(book[t])){//如果当前机器t没有匹配或者和它匹配的牛可以有其他匹配
book[t]=x; //修改当前t的匹配为x
return 1; //找到一条增光路
}
//注意这里没有将use[t]修改为0,和以往dfs不一样
//因为如果此次寻找增光路找过t,没有找到,那么在其他时候再访问该点一点没有匹配
}
}
return 0;
}
int main(){
int t,x;
while(scanf("%d%d",&n,&m)!=EOF){
for (int i=0;i<500;i++) v[i].clear();
memset(book,0,sizeof(book));
for (int i=1;i<=n;i++){
scanf("%d",&t);
while(t--){
scanf("%d",&x);
v[i].push_back(x);
}
}
int ans=0;
//对每一头牛都找一个匹配
for (int i=1;i<=n;i++){
memset(use,0,sizeof(use));
if (find(i)) ans++;
}
printf("%d\n",ans);
}
}