hdu1068 Girls and Boys 基础匈牙利

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

 #define MAXN 500
 int map[MAXN][MAXN];
 int mark[MAXN];
 int pipei[MAXN];
 int n;

 int search(int a)
 {
     for (int i = ; i < n; i++)
     {
         if (map[a][i] && !mark[i])
         {
             mark[i] = ;
             if (pipei[i] == - || search(pipei[i]))
             {
                 pipei[i] = a;
                 return ;
             }
         }
     }

     return ;
 }

 int main()
 {
     while (~scanf("%d",&n))
     {
         memset(map, , sizeof(map));
         int m;
         for (int i = ; i <n; i++)
         {
             int y;
             scanf("%d: (%d)", &m, &y);
             for (int i = ; i < y; i++)
             {
                 int a;
                 scanf("%d", &a);
                 map[m][a] = ;
             }
         }

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