hdu 1082 Courses 二分图最大匹配（匈牙利算法）

Courses

                                                                    Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Problem Description

Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies simultaneously the conditions:

. every student in the committee represents a different course (a student can represent a course if he/she visits that course)

. each course has a representative in the committee

Your program should read sets of data from a text file. The first line of the input file contains the number of the data sets. Each data set is presented in the following format:

P N
Count1 Student1 1 Student1 2 ... Student1 Count1
Count2 Student2 1 Student2 2 ... Student2 Count2
...... 
CountP StudentP 1 StudentP 2 ... StudentP CountP

The first line in each data set contains two positive integers separated by one blank: P (1 <= P <= 100) - the number of courses and N (1 <= N <= 300) - the number of students. The next P lines describe in sequence of the courses . from course 1 to course P, each line describing a course. The description of course i is a line that starts with an integer Count i (0 <= Count i <= N) representing the number of students visiting course i. Next, after a blank, you'll find the Count i students, visiting the course, each two consecutive separated by one blank. Students are numbered with the positive integers from 1 to N.

There are no blank lines between consecutive sets of data. Input data are correct.

The result of the program is on the standard output. For each input data set the program prints on a single line "YES" if it is possible to form a committee and "NO" otherwise. There should not be any leading blanks at the start of the line.

An example of program input and output:

 

Sample Input

2 3 3 3 1 2 3 2 1 2 1 1 3 3 2 1 3 2 1 3 1 1

 

Sample Output

YES NO

题意：有p门课程，n个学生，每个学生在一个 committee代表一门课程，求学生和课程的最大匹配，若最大匹配等于p，输出YES，否则输出NO。

直接用匈牙利算法就可以求解。

代码如下：

#include
#include
int map[301][301],vis[301],flag[301],n,p;
bool find(int m)
{
    int j;
    for(j=1;j<=n;j++)
    {
        if(!vis[j]&&map[m][j])
        {
            vis[j]=1;
            if(flag[j]==0||find(flag[j]))
            {
                flag[j]=m;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    int T,i,count,num,j,k;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&p,&n);
        memset(map,0,sizeof(map)); //保存关系
        memset(flag,0,sizeof(flag));  //保存匹配信息
        for(i=1;i<=p;i++)
        {
            scanf("%d",&num);
            for(j=1;j<=num;j++)
            {
                scanf("%d",&k);
                map[i][k]=1;
            }
        }
        count=0; //记录最大匹配
        for(i=1;i<=p;i++)
        {
            memset(vis,0,sizeof(vis));
            if(find(i))
             count++;    
        }
        if(count!=p)
            printf("NO\n");
        else
            printf("YES\n");
    }
    return 0;
}

这是我做的第一个二分匹配的题，感觉还不错。