“科大讯飞杯”第18届上海大学程序设计联赛春季赛暨高校网络友谊赛 L 动物森友会 · 二分 + 网络流

题解

---

---

代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
const ll INF = 0x7f7f7f7f;
int n, m, E;
int c[N];
int a[8][N];

namespace Network_flows { //网络流板子
    //设定起点和终点
    int st;//起点-源点
    int ed;//终点-汇点

    struct egde {
        int to, next;
        ll flow;//剩余流量
        //int capacity;//容量
    } e[N * 2];

    int head[N], tot = 1;

    void add(int u, int v, ll w) {
        e[++tot] = {v, head[u], w};
        head[u] = tot;
        e[++tot] = {u, head[v], 0};
        head[v] = tot;//网络流反相边流量为0
    }

    int dep[N];//dep[]=-1时为炸点
    queue<int> q;

    bool bfs() {
        memset(dep, 0, sizeof(dep));//顺便起到vis的功能
        q.push(st);
        dep[st] = 1;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (int i = head[u]; i != -1; i = e[i].next) {
                int v = e[i].to;
                if (!dep[v] && e[i].flow) {
                    dep[v] = dep[u] + 1;
                    q.push(v);
                }
            }
        }
        return dep[ed];
    }

    int dfs(int u, ll Flow) {
        if (u == ed) return Flow;
        int now_flow = 0;//跑残流
        for (int i = head[u]; i != -1; i = e[i].next) {
            int v = e[i].to;
            if (dep[v] == dep[u] + 1 && e[i].flow) {
                int f = dfs(v, min(Flow - now_flow, e[i].flow));
                e[i].flow -= f;
                e[i ^ 1].flow += f;
                now_flow += f;
                if (now_flow == Flow) return Flow;
            }
        }
        if (now_flow == 0)dep[u] = -1;
        return now_flow;
    }

#define max_flow dinic

    ll dinic() {//最大流
        ll res = 0;
        while (bfs()) {
            res += dfs(st, INF);
        }
        return res;
    }

    void init() {
        tot = 1;
        memset(head, 0, sizeof(head));
        while (!q.empty()) q.pop();
    }
}
using namespace Network_flows;
ll sum = 0;

bool check(int x) {
	// st=0 1~7 1+7~n+7 ed=n+8
    memset(head, -1, sizeof(head));

    for (int i = 1; i <= 7; ++i) {
        add(0, i, 1ll * E * (x / 7 + (x % 7 >= i))); 
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= 7; ++j) {
            if (a[j][i])
                add(j, i + 7, INF);
        }
        add(i + 7, ed, c[i]);
    }
    return dinic() >= sum;
}


int main() {
    ios::sync_with_stdio(0);

    cin >> n >> E;
    ed = n + 8;

    for (int i = 1; i <= n; ++i) {
        cin >> c[i] >> m; 
        sum += c[i];
        for (int j = 1, x; j <= m; ++j) {
            cin >> x;
            a[x][i] = 1;
        }
    }

    int l = 0, r = 1e9;
    ll ans = 1e9;
    while (l < r) {
        int mid = l + r >> 1;
        if (check(mid)) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    cout << ans << endl;

    return 0;
}