VJ HDU 1083 Courses（二分图最大匹配）

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:

Input
2
3 3
3 1 2 3
2 1 2
1 1
3 3
2 1 3
2 1 3
1 1

Output
YES
NO

题目分析：一共有P门课程，N名学生，每名学生可以选任意多门课程，但不能选两门一样的课程。
是否可以满足：
1.每个学生选的都是不同的课(即不能有两个学生选同一门课)
2.每门课都有一个代表(即P门课都被成功选过)
如果可以满足就输出YES，否则就输出NO。

解题思路：一道二分图最大匹配的模板题，题目的关键在于最大匹配数和课程数P是否相等，即是否每门课都被成功选过。

ac代码：

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

int n, p, match[500];
bool book[500], e[500][500];

int dfs(int u) {//匈牙利算法
    int i;
    for (i = 1; i <= p; i++) {
        if (e[u][i] == 1 && book[i] == 0) {
            book[i] = 1;
            if (match[i] == 0 || dfs(match[i])) {
                match[i] = u;
                return 1;
            }
        }
    }
    return 0;
}

int main(int argc, char const *argv[]) {
    int t, i, j, x, y, sum;
    scanf("%d", &t);
    while (t--) {
        sum = 0;//注意每组数据的初始化
        memset(e, 0, sizeof(e));
        memset(match, 0, sizeof(match));
        scanf("%d %d", &p, &n);
        for (i = 1; i <= p; i++) {
            scanf("%d", &x);
            while (x--) {
                scanf("%d", &y);
                e[y][i] = 1;
            }
        }
        for (i = 1; i <= n; i++) {
            memset(book, 0, sizeof(book));
            if (dfs(i)) sum++;
        }
        if (sum == p)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}