POJ 2239 Selecting Courses
题意:n个课程,每个课程有一些上课时间,同一时间只能上一门课,计算最大能有多少课程能上上课(每个课程只要有一个上课时间即可)
思路:二分图匹配,对应课程时间建边
代码:
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
const int N = 305;
int n;
vector<int> g[N];
int left[N], vis[N];
bool dfs(int u) {
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
if (vis[v]) continue;
vis[v] = 1;
if (left[v] == -1 || dfs(left[v])) {
left[v] = u;
return true;
}
}
return false;
}
int hungary() {
int ans = 0;
memset(left, -1, sizeof(left));
for (int i = 0; i < n; i++) {
memset(vis, 0, sizeof(vis));
if (dfs(i)) ans++;
}
return ans;
}
int main() {
while (~scanf("%d", &n)) {
for (int i = 0; i < n; i++) g[i].clear();
int t, a, b;
for (int i = 0; i < n; i++) {
scanf("%d", &t);
while (t--) {
scanf("%d%d", &a, &b);
g[i].push_back((a - 1) * 12 + b - 1);
}
}
printf("%d\n", hungary());
}
return 0;
}