太空飞行计划问题【网络流24题】【最小割】

题目链接

---

  思路：很多人应该是不解为什么最后返回得到的不是那些正向边"S -> 实验"有流量的边？为什么是那些所谓的还能够bfs()搜索下去到的节点，这就是反映出来的割点的关系了，一开始不懂，一直WA，都是因为直接输出了正向权大于0的那些实验的，然后再以这些实验去找寻对应的器材，但是这样做显然还是不符合的，我们可以考虑成，如果要选实验，那么显然就不能割实验，得去割器材，反之，如果割了实验，就说明我们不选实验了，同时这些器材也不会在被bfs()到，不然选了实验之后，可以发现，最后bfs()的时候，deep[]会停留在割的点。

---

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxE = 2e5 + 5e4 + 7;
const int maxN = 107;
const int S = 0;
bool flag, used[maxN];;
inline int read()
{
    char c = '\0'; int r = 0;
    while (c < '0' || c > '9') c = getchar();
    while (c >= '0' && c <= '9')
    {
        r = r * 10 + c - '0';
        c = getchar();
    }
    if (c == '\r' || c == '\n') flag = true;
    return r;
}
int M, N, head[maxN], cnt, w[maxN], tot, T;
struct Eddge
{
    int nex, to, flow;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int flow)
{
    edge[cnt] = Eddge(head[u], v, flow);
    head[u] = cnt++;
}
struct node
{
    int need[55], tool, pay;
}a[55];
int deep[maxN], cur[maxN];
bool bfs()
{
    memset(deep, 0, sizeof(deep));
    queue<int> Q;   Q.push(S);  deep[S] = 1;
    while(!Q.empty())
    {
        int u = Q.front();  Q.pop();
        for(int i=head[u], v, flow; ~i; i=edge[i].nex)
        {
            v = edge[i].to; flow = edge[i].flow;
            if(!deep[v] && flow)
            {
                deep[v] = deep[u] + 1;
                Q.push(v);
            }
        }
    }
    return deep[T];
}
int dfs(int u, int flow)
{
    if(u == T) return flow;
    for(int &i=cur[u], v, val, di; ~i; i=edge[i].nex)
    {
        v = edge[i].to; val = edge[i].flow;
        if(deep[v] == deep[u] + 1 && val)
        {
            di = dfs(v, min(flow, val));
            if(di)
            {
                edge[i].flow -= di;
                edge[i ^ 1].flow += di;
                return di;
            }
        }
    }
    return 0;
}
int Dinic()
{
    int ans = 0, tmp;
    while(bfs())
    {
        for(int i=S; i<=T; i++) cur[i] = head[i];
        while((tmp = dfs(S, INF))) ans += tmp;
    }
    return ans;
}
bool check(int ti)
{
    for(int i=1; i<=a[ti].tool; i++) if(!used[a[ti].need[i] - M]) return false;
    return true;
}
int ans[maxN], num;
void solve()
{
    int tmp = Dinic();
    for(int i=head[S], v; ~i; i=edge[i].nex)
    {
        v = edge[i].to;
        if(deep[v]) { printf("%d ", v); ans[++num] = v; }
    }
    if(tmp < tot) printf("\n");
    memset(used, false, sizeof(used));
    for(int i=1; i<=num; i++) for(int j=1; j<=a[ans[i]].tool; j++) used[a[ans[i]].need[j] - M] = true;
    for(int i=1; i<=N; i++) if(used[i]) printf("%d ", i);
    if(tmp < tot) printf("\n");
    printf("%d\n", tot - tmp);
}
inline void init()
{
    cnt = num = tot = 0;    T = N + M + 1;
    memset(head, -1, sizeof(head));
    memset(used, false, sizeof(used));
}
int main()
{
    scanf("%d%d", &M, &N);
    init();
    for(int i=1; i<=M; i++)
    {
        scanf("%d", &a[i].pay); tot += a[i].pay;
        addEddge(S, i, a[i].pay);
        addEddge(i, S, 0);
        flag = false;
        a[i].tool = 0;
        while(!flag)
        {
            a[i].need[++a[i].tool] = read() + M;
            addEddge(i, a[i].need[a[i].tool], INF);
            addEddge(a[i].need[a[i].tool], i, 0);
        }
    }
    for(int i=1; i<=N; i++)
    {
        scanf("%d", &w[i]);
        addEddge(i + M, T, w[i]);
        addEddge(T, i + M, 0);
    }
    solve();
    return 0;
}