【LOJ6006】【网络流24题】试题库

Description

https://loj.ac/problem/6006

---

Solution

从源点向所有试题连边，流量为1；
从试题向所属的类型连边，流量为1；
从类型向汇点连边，流量为汇点所需试题数量。
跑网络流即可。

---

Code

/************************************************
 * Au: Hany01
 * Date: Jul 12th, 2018
 * Prob: LOJ6006
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1005, maxk = 25, maxv = 1025, maxm = maxv * maxv;

int n, k, T, S, beg[maxv], nex[maxm], v[maxm], f[maxm], e = 1, d[maxv], gap[maxv], sum, ans;
vector<int> prt[maxk];

inline void add(int uu, int vv, int ff, int fl = 1) {
    v[++ e] = vv, f[e] = ff, nex[e] = beg[uu], beg[uu] = e;
    if (fl) add(vv, uu, 0, 0);
}

int sap(int u, int flow)
{
    if (u == T) return flow;
    int t, res = flow;
    for (register int i = beg[u]; i; i = nex[i]) if (f[i] && d[u] == d[v[i]] + 1) {
        t = sap(v[i], min(res, f[i])), f[i] -= t, f[i ^ 1] += t;
        if (!(res -= t)) return flow;
    }
    if (!--gap[d[u]]) d[S] = T;
    return ++gap[++d[u]], flow - res;
}

int main()
{
#ifdef hany01
    File("loj6006");
#endif

    T = (S = (k = read()) + (n = read()) + 1) + 1;
    For(i, 1, k) add(i + n, T, read()), sum += f[e ^ 1];
    For(i, 1, n) {
        add(S, i, 1);
        for (register int tot = read(); tot --; ) add(i, read() + n, 1);
    }

    for (gap[0] = T; d[S] < T; ) ans += sap(S, INF);
    if (ans != sum) return puts("No Solution!"), 0;

    For(i, 1, n)
        for (register int j = beg[i]; j; j = nex[j])
            if (v[j] != S && !f[j]) prt[v[j] - n].pb(i);
    For(i, 1, k) {
        printf("%d:", i);
        rep(j, SZ(prt[i])) printf(" %d", prt[i][j]);
        putchar('\n');
    }

    return 0;
}
//西风稍急喧窗竹，停又续，腻脸悬双玉。
//    -- 阎选《河传·秋雨》