P2763 试题库问题 · 网络流

题解

题目有误，一个题目被采用，只能对应一个类型，
关键 · 大佬的图：

关于路径：
枚举每个类型，枚举其与试题的连边，如果反向边（从类型出发到试题的边是反向边）有值输出，因为正向边一定为0，也就是从试题流向了类型，

---

---

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;

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

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

    int head[N], tot = 1;

    void add(int u, int v, int 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; 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 pre[N];
    int dfs(int u, int Flow) {
        if (u == ed) return Flow;
        int now_flow = 0;//跑残流
        for (int i = head[u]; i; 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(f) pre[v]=u;
                if (now_flow == Flow) return Flow;
            }
        }
        if (now_flow == 0)dep[u] = -1;
        return now_flow;
    }

#define max_flow dinic
    int dinic() {//最大流
        int 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;

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

    cin>>k>>n;
    st=0,ed=n+k+1;
    for (int i = 1,x; i <= k; ++i) {
        cin>>x;
        add(n+i,ed,x);
        m+=x;
    }
    for (int i = 1,cnt; i <= n; ++i) {
        cin>>cnt;
        add(st,i,1);
        for (int j = 1 ,x; j <= cnt; ++j) {
            cin>>x;
            add(i,x+n,1);
        }
    }

    int res=dinic();
    if(res==m){
        for (int i = 1; i <= k; ++i) {
            printf("%d:",i);
            for(int j=head[i+n];j;j=e[j].next){
                int v=e[j].to;
                if(e[j].flow)printf(" %d",v);
            }
            puts("");
        }
    }else{
        puts("No Solution!");
    }

    return 0;
}