洛谷P2762 太空飞行计划问题 网络流

洛谷P2762 太空飞行计划问题 网络流 

#include<bits/stdc++.h>
#define LL long long
#define GG int
#define For(i, j, k) for(int i=j; i<=k; i++)
#define Dow(i, j, k) for(int i=j; i>=k; i--)
using namespace std;
inline GG read() {
    GG x = 0, f = 1;
    char ch = getchar();
    while(ch<'0'||ch>'9') { if(ch=='-') f = -1; ch = getchar(); }
    while(ch>='0'&&ch<='9') { x = x*10+ch-48; ch = getchar(); }
    return x * f;
}
inline void write(GG x) {
    if(x<0) putchar('-'), x = -x;
    if(x>9) write(x/10);
    putchar(x%10+48);
}
inline void writeln(GG x) {
    write(x); puts("");
}

const int N = 61, M = 4011, INF = 1e9; 
struct edge{
    int to, pre, val; 
}e[M*2];
int head[N*2], cur[N*2], vis[N*2]; 
int nedge; 

inline void add(int x, int y, int v) {
    e[++nedge] = (edge){ y, head[x], v}; 
    head[x] = nedge; 
}

namespace work_1 {
    int n, m, S, T; 
    int dep[N*2]; 
    inline void pre(int nn, int mm, int ss, int tt) {
        n = nn; m = mm; S = ss; T = tt; 
    }
    inline int bfs() {
        For(i, 0, n) dep[i] = 0; 
        memset(vis, 0, sizeof vis); 
        queue<int> Q; 
        Q.push(S); 
        dep[S] = 1; 
        while(!Q.empty()) {
            int u = Q.front(); Q.pop(); 
            for(int i=head[u]; i!=-1; i=e[i].pre) {
                int v = e[i].to; 
                if(e[i].val>0 && dep[v]==0) {
                    dep[v] = dep[u]+1;
                    vis[v] = 1;  
                    Q.push(v); 
                }
            }
        }
        return dep[T]; 
    }
    int dfs(int u, int dist) {
        if(u == T) return dist; 
        for(int& i=cur[u]; i!=-1; i=e[i].pre) {
            int v = e[i].to; 
            if(e[i].val>0 && dep[v]==dep[u]+1) {
                int flow = dfs(v, min(e[i].val, dist)); 
                if(flow > 0) {
                    e[i].val -= flow; 
                    e[i^1].val += flow; 
                    return flow; 
                }
            }
        }
        return 0; 
    }
    inline int Dinic() {
        int ans = 0; 
        while( bfs() ) {
            for(int i=0; i<=n; i++) cur[i] = head[i]; 
            while(int d = dfs(S, INF)) 
                ans += d;     
        }
        return ans; 
    }
}

int main() {
    int m = read(), n = read(); 
    nedge = -1; 
    int sum = 0; 
    memset(head, -1, sizeof(head)); 
    For(i, 1, m) {
        int x = read(); 
        sum += x; 
        add(0, i, x); add(i, 0, 0); 
        char ch;  
        while((ch=getchar()) != '
') {
            x = ch-'0'; 
            while((ch=getchar())&&ch>='0'&&ch<='9') 
                x=x*10+ch-'0'; 
            add(i, x+m, INF); add(x+m, i, 0); 
            if(ch=='
') break; 
        }
    }
    For(i, 1, n) {
        int x = read(); 
        add(i+m, m+n+1, x); add(m+n+1, i+m, 0); 
    }
    work_1 :: pre(n+m+1, nedge, 0, n+m+1); 
    int ans = work_1 :: Dinic(); 
    ans = sum - ans; 
    For(i, 1, m) if(vis[i]) printf("%d ",i); 
    puts(""); 
    For(i, 1, n) if(vis[i+m]) printf("%d ",i); 
    puts(""); 
    writeln(ans); 
}