hdu1068 Girls and Boys 匈牙利算法（邻接表）

 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <vector>
 using namespace std;

 const int maxn = ;
 vector<int>map[maxn];
 bool mark[maxn];
 int link[maxn];
 int n;

 void init(){
     for (int i = ; i <= n; i++){
         map[i].clear();
     }
     memset(mark, false, sizeof(mark));
     memset(link, -, sizeof(link));
 }

 bool dfs(int x){
     int k = map[x].size();
     for (int j = ; j < k; j++){
         int v = map[x][j];
         if (!mark[v]){
             mark[v] = true;
             if (link[v] == - || dfs(link[v])){
                 link[v] = x;
                 return true;
             }
         }
     }
     return false;
 }

 int main(){
     while (scanf("%d", &n) != EOF){
         init();
         for (int i = ; i < n; i++){
             int x, y;
             scanf("%d: (%d)", &x, &y);
             for (int j = ; j < y; j++){
                 scanf("%d", &x);
                 map[i].push_back(x);
             }
         }

         int ans = ;
         for (int i = ; i < n; i++){
             memset(mark, false, sizeof(mark));
             if (dfs(i))
                 ans++;
         }
         printf("%d\n", n - ans / );
     }
     //system("pause");
     return ;
 }