poj 1274 The Prefect Stall - 二分匹配

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 22736		Accepted: 10144

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

Source

USACO 40

---

　　这道题没有什么特别好说的，直接匈牙利算法不解释

Code:

 /**
  * poj.org
  * Problem#1274
  * Accepted
  * Time:16ms
  * Memory:520k/540k
  */
 #include<iostream>
 #include<queue>
 #include<set>
 #include<map>
 #include<cctype>
 #include<algorithm>
 #include<cstring>
 #include<cstdlib>
 #include<stdarg.h>
 #include<fstream>
 #include<ctime>
 using namespace std;
 typedef bool boolean;
 typedef class Edge {
     public:
         int end;
         int next;
         Edge():end(),next(){}
         Edge(int end, int next):end(end),next(next){}
 }Edge;
 int *h;
 int _count = ;
 Edge* edge;
 inline void addEdge(int from,int end){
     edge[++_count] = Edge(end,h[from]);
     h[from] = _count;
 }
 int result;
 int *match;
 boolean *visited;
 boolean find(int node){
     for(int i = h[node];i != ;i = edge[i].next){
         if(visited[edge[i].end]) continue;
         visited[edge[i].end] = true;
         if(match[edge[i].end] == -||find(match[edge[i].end])){
             match[edge[i].end] = node;
             return true;
         }
     }
     return false;
 }
 int n,m;
 void solve(){
     for(int i = ;i <= n;i++){
         if(match[i] != -)    continue;
         memset(visited, false, sizeof(boolean) * (n + m + ));
         if(find(i)) result++;
     }
 }
 int buf;
 int b;
 boolean init(){
     if(~scanf("%d%d",&n,&m)){
         result = ;
         visited = new boolean[(const int)(n + m + )];
         match = new int[(const int)(n + m + )];
         edge = new Edge[(const int)((n * m) + )];
         h = new int[(const int)(n + m + )];
         memset(h, , sizeof(int)*(n + m + ));
         memset(match, -,sizeof(int)*(n + m + ));
         for(int i = ;i ^ n;i++){
             scanf("%d",&buf);
             for(int j = ;j ^ buf;j++){
                 scanf("%d",&b);
                 addEdge(i + , b + n);
         //        addEdge(b + n, i + 1);
             }
         }
         return true;
     }
     return false;
 }
 void freeMyPoint(){
     delete[] visited;
     delete[] match;
     delete[] edge;
     delete[] h;
 }
 int main(){
     while(init()){
         solve();
         printf("%d\n",result);
         freeMyPoint();
     }
     return ;
 }