HDU 5855 二分搜索+最大流

题目链接

题意

---

一个商店的货源，需要k个工厂同时供货，若满足则收到pro[i]的利益，但是需要减去成本pay，注意工厂建造好，只需一个商店支出成本。建造工厂时，每个工厂都需要ti的时间。最后求最小时间内收到大于等于L的利益。

---

解析

---

根据题意，可以建图超级源点到工厂，工厂到商店，商店到超级汇点。在最小时间内，求出最小割即可，超级源点到工厂时间满足便建容量为pay[i]的边，不满足容量无穷大即可。工厂和商店根据他们的供应关系建边，容量为无穷大。二分时间即可。

---

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 400+10;
int pay[maxn], ti[maxn];
const int inf=0x3f3f3f3f;

vector<int>shop[maxn];
int S, T;
int pro[maxn];
int n, m, L, P;
struct node {
    int t;
    int v;
    int next;
}edge[100000+10];
int head[maxn];
int level[maxn];
int cnt=0;
void init() {
    cnt = 0;
    memset(head, -1, sizeof(head));
}

void add(int u, int v, int c) {
    edge[cnt].t = v;
    edge[cnt].v = c;
    edge[cnt].next = head[u];
    head[u] = cnt;
    cnt++;
    edge[cnt].t = u;
    edge[cnt].v = 0;
    edge[cnt].next = head[v];
    head[v] = cnt;
    cnt++;
}

bool bfs() {
    int q[maxn], front=0, tail = 0;
    memset(level, -1, sizeof(level));
    level[0] = 1;
    q[tail++] = 0;
    while (tail > front) {
        int u = q[front];
        front++;
        if (u == T)
            return true;
        for (int i=head[u]; i!=-1; i=edge[i].next) {
            int v = edge[i].t;
            if (level[v] == -1 && edge[i].v) {
                level[v] = level[u]+1;
                q[tail++] = v;;
            }
        }
    }
    return false;
}

int dfs(int u, int minf) {  // 增广多条路
    if (u == T)
        return minf;
    int ret  = 0;   //记录所有增广路的流量和
    for (int i=head[u]; i!=-1; i=edge[i].next) {
        int v = edge[i].t, f;
        if (level[v] == level[u]+1 && edge[i].v) {
            int Min = min(minf-ret, edge[i].v);
            f = dfs(v, Min);
            edge[i].v -= f;
            edge[i^1].v += f;
            ret += f;
            if (ret == minf)
                return ret;
        }
    }
    return ret;
}

int dinic() {
    int flow = 0;
    while (bfs())
    flow += dfs(0, inf);
    return flow;
}

int build(int t) {
    init();
    for (int i=1; i<=n; i++) {
        if (ti[i] <= t)
            add(S, i, pay[i]);
        else 
            add(S, i, inf);
    }
    int ans = 0;
    for (int i=1; i<=m; i++) {
        for (int j=0; j<shop[i].size(); j++)
            add(shop[i][j], i+n, inf);
        add(i+n, T, pro[i]);
        ans += pro[i];
    }

    int res = dinic();
//    cout<<t << ' ' << res <<endl;
    if (ans <= res)
        return 0;
    else
        return ans-res;
}

int main()
{
    int t;
    scanf("%d", &t);
    int ca = 1;
    while (t--) {
        scanf("%d%d%d", &n, &m, &L);
        init();
        S = 0, T = n+m+1;
        for (int i=1; i<=m; i++)
            shop[i].clear();

        for (int i=1; i<=n; i++)
            scanf("%d%d", &pay[i], &ti[i]);

        for (int i=1; i<=m; i++) {
            scanf("%d", &pro[i]);
            int k;
            scanf("%d", &k);
            while (k--) {
                int v;
                scanf("%d", &v);
                shop[i].push_back(v);
            }
        }

        int l = 1, r = 1000000000+1;
        int flag = 0;
        int ans = 0;
        while (l<=r) {
            int mid = (l+r)>>1;
            if (build(mid) >= L) {
                r = mid-1;
                ans = mid;
                flag = 1;
            }
            else
                l = mid+1;
        }
        if (flag == 1)
            printf("Case #%d: %d %d\n", ca++, ans, build(ans));
        else
            printf("Case #%d: impossible\n", ca++);
    }
    return 0;
}