HDU 1179 Ollivanders: Makers of Fine Wands since 382 BC.（二分图匹配--匈牙利算法）

Ollivanders: Makers of Fine Wands since 382 BC.

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 1314 Accepted Submission(s): 718

Problem Description
In Diagon Alley ,there is only one Wand-seller,peeling gold letters over the door read Ollivanders: Makers of Fine Wands since 382 BC.A single wand lay on a faded purple cushion in the dusty window.
A tinkling bell rang somewhere in the depths of the shop as they stepped inside.It was a tiny place,empty execpt for a single spindly chair which Hagrid sat on to wait.Harry felt strangely as though he had entered a very strict library;he swallowd a log of new questions which had just occurred to him and looked instead at the thousands of narrow boxes piled neatly right up to the ceiling.For some reason,the back of his neck prickled.The very dust and silence in here seemed to tingle with some secret magic.
‘Good afternoon,’said a soft voice.Harry jumped.Hagrid must have jumped,too,because there was a loud crunching noise and he got quickly off the spindly chair.
An old man was standing before them, his wide pale eyes shining like moons through the gloom of the shop.
‘Hello,’ said Harry awkwardly.
‘Ah yes,’ said the man. ‘Yes,yes. I thought I’d be seeing you soon,Harry Potter.’It wasn’t a question.You have your mother’s eyes. It seems only yesterday she was in here herself,buying her first wand. Ten and a quarter inches long, swishy, made of willow. Nice wand for charm work.’
Mor Ollivander moved closer to Harry.Harry wished he would blink.Those sivery eyes were a bit creepy.
‘Your father, on the other hand, favoured a mahogany wand.Eleven inches.Pliable.A little more power and excellent for transfiguration.Well ,I say your father favoured it - it’s really the wand that choosed the wizard, of cource.’

Yes, some wands fit some wizards ,as we all know.But what Harry doesn’t know is Ollivander have met a big trouble.That’s more than twenty years ago,When Harry’s father James Potter was still a student in Hogwarts.He went Diagon Alley to buy new books,passing by Ollivander’s shop.Ollivander was crazy for a problem:He was too busy to choose most suitable wand for every wizard.Even more,there are too many customer that day.Though Ollivader knew every wand’s favourite,he could not choose as many wizards as possible to get the wands. So James Potter,a very clever man ,gave him a magic disk with your program ,to help him sell wands as many as possible.

Please notice: one wand can only be sold to one wizard, and one wizard can only buy one wand,too.

Input
There are several cases. For each case, there is two integers N and M in the first line,which mean there is N wizards and M wands(0 < N <= M <= 100).
Then M lines contain the choices of each wand.The first integer in i+1th line is Ki,and after these there are Ki integers Bi,j which are the wizards who fit that wand. (0<=Ki<=N,1<=Bi,j<=N)

Output
Only one integer,shows how many wands Ollivander can sell.

Sample Input
3 4
3 1 2 3
1 1
1 1
0

Sample Output
2

有n个巫师，有m个巫棒。每个巫师棒都适合一定的巫师。
下面是巫棒匹配巫师的代码：

/*
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int match[200],e[205][205],book[205],n,m;

int dfs(int u)
{
    for(int i=1; i<=m; i++)
    {
        if(book[i]==0&&e[u][i]==1)
        {
            book[i]=1;
            if(match[i]==-1||dfs(i)==1)
            {
                match[i]=u;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(e,0,sizeof(e));
        memset(match,-1,sizeof(match));
        int t1,t2;
        for(int i=1; i<=m; i++)
        {
            scanf("%d",&t1);
            for(int j=0; j<t1; j++)
            {
                scanf("%d",&t2);
                e[t2][i]=1;
            }
        }
        int sum=0;
        //memset(book,0,sizeof(book));
        for(int i=1; i<=n; i++)
        {
            if(dfs(i))
            {
                memset(book,0,sizeof(book));
                sum++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}
/*
#include<stdio.h>
#include<string.h>
int map[110][110],last_y[110],hav[110],N,M;
int findmax(int m);
int main()
{
    int i,j,a,b,Sum;
    while(scanf("%d %d",&N,&M)!=EOF)
    {
        memset(map,0,sizeof(map));
        memset(last_y,-1,sizeof(last_y));
        Sum=0;
        for(i=1;i<=M;i++)
        {
            scanf("%d",&a);
            for(j=0;j<a;j++)
            {
                scanf("%d",&b);
                map[b][i]=1;
            }
        }
        for(i=1;i<=N;i++)
        {
            if(findmax(i))
            {
                memset(hav,0,sizeof(hav));
                Sum++;
            }
        }
        printf("%d\n",Sum);
    }
    return 0;
}
int findmax(int m)
{
    int i;
    for(i=1;i<=M;i++)
    {
        if(!hav[i]&&map[m][i])
        {
            hav[i]=1;
            if(last_y[i]==-1||findmax(last_y[i]))
            {
                last_y[i]=m;
                return 1;
            }
        }
    }
    return 0;
}
*/

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

int match[200],e[200][200],book[200],n,m;

int dfs(int u)
{
    for(int i=1;i<=n;i++)
    {
        if(book[i]==0&&e[u][i]==1)
        {
            book[i]=1;
            if(match[i]==0||dfs(match[i]))
            {
                match[i]=u;
                return 1;
            }
        }
    }
    return 0;
}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(e,0,sizeof(e));
        memset(book,0,sizeof(book));
        memset(match,0,sizeof(match));
        int t1,t2;
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&t1);
            for(int j=0;j<t1;j++)
            {
                scanf("%d",&t2);
                e[i][t2]=1;
            }
        }
        int sum=0;
        for(int i=1;i<=m;i++)
        {
            memset(book,0,sizeof(book));
            if(dfs(i))
            {
                sum++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}