HDU 1083 Courses 二分匹配

题意：有n个学生，p个课程，一个学生可以选多个课程，求出是否可以组成一个集合，集合里正好有p个学生，每个学生正好对应选p个不同的课程
思路：求最大匹配，判断是否等于p即可

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 300+5;
const int inf = 0x3f3f3f3f;
int T, n, p, vis[maxn], have[maxn];
vector<int> g[maxn];
int dfs(int u)
{
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (!vis[v]) {
			vis[v] = 1;
			if (have[v] == -1 || dfs(have[v])) {
				have[v] = u;
				return 1;
			}
		}
	}
	return 0;
}
int main()
{
	cin >> T;
	for (int t = 0; t < T; t++) {
		cin >> p >> n;
		memset(have, -1, sizeof(have));
		for (int i = 0; i <= n; i++)
			g[i].clear();
		for (int i = 0; i < p; i++) {
			int cnt, x;
			cin >> cnt;
			for (int j = 0; j < cnt; j++) {
				cin >> x;
				g[x].push_back(i);
			}
		}
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			memset(vis, 0, sizeof(vis));
			if (dfs(i))
				ans++;
		}
		if (ans == p) {
			printf("YES\n");
		} else {
			printf("NO\n");
		}
	}
	return 0; 
}