【LOJ6001】【网络流24题】太空飞行问题

Description

https://loj.ac/problem/6001

---

Solution

考虑最小割建模。
左边一列点代表仪器，右边一列点表示实验。
从$S$向仪器连边，流量为仪器费用；从实验向${T}$连边，流量为实验利润。仪器向实验连边，流量为$+\infty$。

这里要么割仪器的边表示耗费仪器所需要的费用，要么割实验的边表示放弃实验利润。
YMY说也可以理解为不能同时不买仪器还执行实验，所以要连$+\infty$。

最后还要跑一遍BFS，找出哪些在S集，哪些在T集，并输出方案。

---

Code

/************************************************
 * Au: Hany01
 * Date: Jul 10th, 2018
 * Prob: LOJ6001 太空飞行计划
 * 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 _ * __;
}

int ised;
inline int spr() {
    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);
    if (c_ != ' ') ised = 1;
    return _ * __;
}

const int maxn = 55;

int n, m, e = 1, beg[maxn << 1], nex[maxn * maxn * 3], v[maxn * maxn * 3], f[maxn * maxn * 3], S, T, sz, ans, d[maxn << 1], gap[maxn << 1];

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;
    register int res = flow, t;
    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 + 1;
    return ++ gap[++ d[u]], flow - res;
}

queue<int> q;
int mark[maxn << 1];
inline void BFS(int st, int mk)
{
    q.push(st);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (register int i = beg[u]; i; i = nex[i])
            if (f[i] && !mark[v[i]]) mark[v[i]] = mk, q.push(v[i]);
    }
}

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

    n = read(), m = read(), T = (S = n + m + 1) + 1;
    For(i, 1, n) {
        ised = 0, add(i + m, T, spr()), ans += f[e ^ 1];
        while (!ised) add(spr(), i + m, INF);
    }
    For(i, 1, m) add(S, i, read());

    for (gap[0] = T; d[S] <= T; ) ans -= sap(S, INF);

    BFS(S, 1), BFS(T, 2);
    For(i, 1, n) if (mark[m + i] == 2) printf("%d ", i);
    putchar('\n');
    For(i, 1, m) if (mark[i] == 2) printf("%d ", i);
    putchar('\n');

    printf("%d\n", ans);

    return 0;
}
//江天一色无纤尘，皎皎空中孤月轮。
//    -- 张若虚《春江花月夜》