【LOJ6015】【CTSC1999】【网络流24题】星际转移问题/家园

Description

https://loj.ac/problem/6015

---

Solution

从下到大枚举天数，对于每一天的每一个地点建一个点。
从起点向每一天的地球连边，流量为$+\infty$；
从每一个飞船前一天所在的太空站连向后一天的太空站，流量为飞船可容纳人数；
从前一天的一个地点连向后一天的同一个地点，流量为$+\infty$。
不断加边、跑Dinic即可。

---

Code

/**************************************
 * Au: Hany01
 * Prob: [LOJ6015][网络流24题] 星际转移问题
 * Date: Jul 18th, 2018
 * Email: hany01@foxmail.com
**************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#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 SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif

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() {
    register char c_; register int _, __;
    for (_ = 0, __ = 1, c_ = getchar(); !isdigit(c_); c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_); c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 12005, maxm = 5e6, maxb = 21;

int n, m, V[maxb], R[maxb], beg[maxn], v[maxm], nex[maxm], f[maxm], Flow, lev[maxn], S, T, vis[maxn], e = 1, k;
vector<int> stop[maxb];

#define idx(i, j) ((i) * (n + 2) + j)

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);
}

inline bool BFS() {
    static queue<int> q;
    Set(lev, 0), lev[S] = 1, q.push(S);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (register int i = beg[u]; i; i = nex[i])
            if (f[i] && !lev[v[i]]) lev[v[i]] = lev[u] + 1, q.push(v[i]);
    }
    return lev[T];
}

int DFS(int u, int flow)
{
    if (u == T) return flow;
    int res = flow, t;
    for (register int i = beg[u]; i; i = nex[i]) if (f[i] && lev[v[i]] == lev[u] + 1) {
        f[i] -= (t = DFS(v[i], min(f[i], res))), f[i ^ 1] += t;
        if (!(res -= t)) break;
    }
    if (!res) lev[u] = 0;
    return flow - res;
}

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

    n = read(), m = read(), k = read(), S = 0, T = 10000;
    For(i, 1, m) {
        V[i] = read(), R[i] = read();
        rep(j, R[i]) {
            stop[i].pb(read());
            if (stop[i][j] == -1) stop[i][j] = n + 2;
            else if (!stop[i][j]) stop[i][j] = n + 1;
        }
    }

    add(S, n + 1, INF), add(n + 2, T, INF);
    For(day, 1, 100) {
        For(i, 1, m) add(idx(day - 1, stop[i][(day - 1) % R[i]]), idx(day, stop[i][day % R[i]]), V[i]);
        For(i, 1, n) add(idx(day - 1, i), idx(day, i), INF);
        add(S, idx(day, n + 1), INF), add(idx(day, n + 2), T, INF);
        while (BFS()) do Set(vis, 0), Flow += DFS(S, INF); while (vis[T]);
        if (Flow >= k) { printf("%d\n", day); return 0; }
    }
    puts("0");

    return 0;
}