POJ 1274 二分图/匈牙利算法
2014-09-16 22:28
288 查看
The Perfect Stall
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 18657 Accepted: 8503
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
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 18657 Accepted: 8503
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
<span style="color:#000099;">/**************************************** author : Grant Yuan time : 2014/9/16/ 22:19 algorithm : 二分图/匈牙利算法 source : POJ 1274 ****************************************/ #include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<vector> #define MAX 207 using namespace std; vector<int> G[MAX]; bool used[MAX]; int match[MAX]; int n,m; bool dfs(int v) { for(int i=0;i<G[v].size();i++) { int u=G[v][i],w=match[u]; if(!used[u]){ used[u]=1; if(match[u]==-1||dfs(match[u])) { match[u]=v; return true; } } } return false; } int bipartite_matching() { int res=0; memset(match,-1,sizeof(match)); for(int v=1;v<=n;v++) { memset(used,0,sizeof(used)); if(dfs(v)) res++; } return res; } int main() { while(~scanf("%d%d",&n,&m)){ for(int i=0;i<MAX;i++) while(!G[i].empty()) G[i].pop_back(); for(int i=1;i<=n;i++) { int k,v=i; scanf("%d",&k); for(int j=0;j<k;j++) { int u; scanf("%d",&u); G[v].push_back(u); } } int ans=bipartite_matching(); printf("%d\n",ans); } return 0; } </span>
相关文章推荐
- POJ 1274 二分图/匈牙利算法
- POJ 1274 The Perfect Stall ( 匈牙利算法 )
- POJ 3041 Asteroids 二分图匹配 匈牙利算法
- 匈牙利算法之POJ1087
- poj 3041 二分匹配 基础题(整理版:基础知识)匈牙利算法
- poj 3715 Blue and Red(二分图最大匹配匈牙利算法)
- POJ二分匹配总结_匈牙利算法
- poj 3041 匈牙利算法 最小点覆盖
- POJ 1274 The Perfect Stall (匈牙利算法)
- POJ 3020 Antenna Placement 匈牙利算法
- Poj1469_匈牙利算法_最大二分匹配
- POJ 2584 最大匹配。匈牙利算法
- poj 3020(匈牙利算法的简单应用,关键是构图)
- poj 3020 匈牙利算法
- Poj 2446 Chessboard 匈牙利算法
- POJ 3041 Asteroids 二分图匹配 匈牙利算法
- poj 3041 匈牙利算法
- Poj 2446 Chessboard 匈牙利算法
- POJ 2239 Selecting Courses匈牙利算法
- 匈牙利算法 (poj1422-Air Raid,poj1469-COURSES)