kyeremal-网络流24题T7-试题库问题

题意：
假设一个试题库中有 n 道试题。每道试题都标明了所属类别。同一道题可能有多个类别属性。
现要从题库中抽取 m 道题组成试卷。并要求试卷包含指定类型的试题。试设计一个满足要求的组卷算法。

思路：
1. 试卷和属性分别定义为 X, Y 集。每个试卷有多重属性，二分图多重匹配。

code：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>

using namespace std;
 
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define REP(i, l, r) for (int i = l; i >= r; i--)
#define MAXN 100010
 
int n, m, sum = 0, N = -1, first[MAXN], next[MAXN], S, T, dis[MAXN];
struct tlist {int x, y, f;} a[MAXN];
queue<int> q;
vector<int> v;
 
inline void add(int x, int y, int f) {
    a[++N].x = x, a[N].y = y, a[N].f = f, next[N] = first[x], first[x] = N;
    a[++N].x = y, a[N].y = x, a[N].f = 0, next[N] = first[y], first[y] = N;
}

inline bool bfs() {
	q.push(S);
	memset(dis, -1, sizeof(dis));
	dis[S] = 0;
	while (!q.empty()) {
		int x = q.front();
		q.pop();
		for (int i = first[x]; ~i; i = next[i])
			if (!~dis[a[i].y] && a[i].f) {
				dis[a[i].y] = dis[x] + 1;
				q.push(a[i].y);
			}
	}
	return ~dis[T];
}

inline int find(int x, int low) {
	if (x == T) return low;
	int temp, sum = 0;
	for (int i = first[x]; ~i; i = next[i])
		if ((dis[a[i].y] == dis[x] + 1) && (a[i].f) && (temp = find(a[i].y, min(low-sum, a[i].f)))) {
			a[i].f -= temp;
			a[i^1].f += temp;
			sum += temp;
		}
	return sum;
}

inline int dinic(int begin, int end) {
	int ans = 0, temp;
    S = begin, T = end;
    while (bfs())
    	while (temp = find(S, 0x7fffffff))
    		ans += temp;
    return ans;
}
 
int main() {
    cin >> n >> m;
    int temp, T_T;
    memset(first, -1, sizeof(first));
    memset(next, -1, sizeof(next));
    rep(i, 1, n) scanf("%d", &temp), sum += temp, add(0, i, temp);
    rep(i, 1, m) {
        scanf("%d", &T_T);
        rep(j, 1, T_T) scanf("%d", &temp), add(temp, n + i, 1);
    }
    rep(i, 1, m) add(n + i, n + m + 1, 1);
    dinic(0, n + m + 1);
	rep(_, 1, n) {
		printf("%d:", _);
		v.clear();
		for (int i = first[_]; ~i; i = next[i]) if (!a[i].f) v.push_back(a[i].y - n);
		sort(v.begin(), v.end());
		rep(i, 0, int(v.size())-2) printf("%d ", v[i]); printf("%d\n", v[int(v.size())-1]);
	}

    return 0;
}