CF 976F 递增容量最大流

给你一个二分图 要求你求出对于k=[0~Mindegree] 每个点的度数至少为k所需要的最少边数 并输出方案

如果是单个询问的话 直接跑一个下界网络流即可 但是有多个询问 重建图强行跑不行

反过来考虑,变成至多能删除多少边则建边[s,i,degree[i]-Mindegree] [i,T,degree[i]-Mindegree] [u,v,1]

这样跑出来的流 二分图中没有流量的边代表是要选的 有流量的是要删的 同时保证了每个点的度数不小于Mindegree

则接下来每次对与S,T相连的边容量++ 得到k=[0~Mindegree-1]的答案

#include<bits/stdc++.h>
using namespace std;
const int MAXN = ;
const int MAXM = ;
const int INF = ;
int Head[MAXN], cur[MAXN], lev[MAXN], to[MAXM << ], nxt[MAXM << ], f[MAXM << ], ed = , S, T;
inline void addedge(int u, int v, int cap)
{
    to[++ed] = v;
    nxt[ed] = Head[u];
    Head[u] = ed;
    f[ed] = cap;
    to[++ed] = u;
    nxt[ed] = Head[v];
    Head[v] = ed;
    f[ed] = ;
    return;
}
inline bool BFS()
{
    int u;
    memset(lev, -, sizeof(lev));
    queue<int>q;
    lev[S] = ;
    q.push(S);
    while (q.size()) {
        u = q.front();
        q.pop();
        for (int i = Head[u]; i; i = nxt[i])
            if (f[i] && lev[to[i]] == -) {
                lev[to[i]] = lev[u] + ;
                q.push(to[i]);
                /*
                if (to[i] == T)
                {
                        return 1;
                }
                magic one way optimize
                */
            }
    }
    memcpy(cur, Head, sizeof Head);
    return lev[T] != -;
}
inline int DFS(int u, int maxf)
{
    if (u == T || !maxf) {
        return maxf;
    }
    int cnt = ;
    for (int &i = cur[u], tem; i; i = nxt[i])
        if (f[i] && lev[to[i]] == lev[u] + ) {
            tem = DFS(to[i], min(maxf, f[i]));
            maxf -= tem;
            f[i] -= tem;
            f[i ^ ] += tem;
            cnt += tem;
            if (!maxf) {
                break;
            }
        }
    if (!cnt) {
        lev[u] = -;
    }
    return cnt;
}
int Dinic()
{
    int ans = ;
    while (BFS()) {
        ans += DFS(S, );
    }
    return ans;
}
void init(int SS, int TT)
{
    memset(Head, , sizeof(Head));
    ed = ;
    S = SS;
    T = TT;
    return;
}
int du[];
int ans[][];
int main()
{
    int n1, n2, m;
    int u, v;
    scanf("%d %d %d", &n1, &n2, &m);
    int n = n1 + n2;
    for (int i = ; i <= m; i++) {
        scanf("%d %d", &u, &v);
        addedge(u, v + n1, );
        du[u]++, du[v + n1]++;
    }
    int Mindegree = INT_MAX;
    for (int i = ; i <= n; i++) {
        Mindegree = min(Mindegree, du[i]);
    }
    S = , T = n + ;
    for (int i = ; i <= n1; i++) {
        addedge(S, i, du[i] - Mindegree);
    }
    for (int i = n1 + ; i <= n; i++) {
        addedge(i, T, du[i] - Mindegree);
    }
    int ansnow = Dinic();
    for (int x = ; x <= n1; x++) {
        for (int i = Head[x]; i; i = nxt[i]) {
            v = to[i];
            if (v >= n1 +  && v <= n) {
                if (f[i] == ) {
                    ans[Mindegree][++ans[Mindegree][]] = i / ;
                }
            }
        }
    }
    for (int i = Head[S]; i; i = nxt[i]) {
        f[i]++;
    }
    for (int x = n1 + ; x <= n; x++) {
        for (int i = Head[x]; i; i = nxt[i]) {
            v = to[i];
            if (v == T) {
                f[i]++;
            }
        }
    }
    for (int i = Mindegree - ; i >= ; i--) {
        ansnow = Dinic();
        for (int x = ; x <= n1; x++) {
            for (int j = Head[x]; j; j = nxt[j]) {
                v = to[j];
                if (v >= n1 +  && v <= n) {
                    if (f[j] == ) {
                        ans[i][++ans[i][]] = j / ;
                    }
                }
            }
        }
        for (int j = Head[S]; j; j = nxt[j]) {
            f[j]++;
        }
        for (int x = n1 + ; x <= n; x++) {
            for (int j = Head[x]; j; j = nxt[j]) {
                v = to[j];
                if (v == T) {
                    f[j]++;
                }
            }
        }
    }
    for (int i = ; i <= Mindegree; i++) {
        printf("%d", ans[i][]);
        for (int j = ; j <= ans[i][]; j++) {
            printf(" %d", ans[i][j]);
        }
        puts("");
    }
    return ;
}