[网络流24题]P2763 试题库

#include 
using namespace std;
#define endl '\n'
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int N = 2e3 + 5;
const int M = N * N + 5;
struct edge {
    int v, w, to;
} e[M * 2];
int pre[N], cnt_edge, dep[N];
int S, T, z, head[N], sum;
int n, m, q[N], cur[N];
void add(int u, int v, int w) {
    // cout<<"add: "<> k >> n;
    S = n + k + 1, T = S + 1;
    int val;
    int sum = 0;
    for (int i = 1; i <= k; i++) {
        cin >> val;
        add(id(i, 1), T, val);
        sum += val;
    }
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        cin >> cnt;
        for (int j = 0, v; j < cnt; j++) {
            cin >> v;
            add(id(i, 0), id(v, 1), 1);
        }
        add(S, id(i, 0), 1);
    }
    int ans = dinic();
    // cout << ans << endl;
    if (ans == sum) {
        for (int i = 1; i <= k; i++) {
            cout << i << ":";
            for (int j = head[i + n]; ~j; j = e[j].to) {
                int v = e[j].v;
                // cout<<" "<