试题库问题【网络流24题】【最大流Dinic】

题目链接

---

  还是挺好的一道题，但是可能我写题的顺序缘故，并不觉得这道题会比之前的题难，既然最后答案要判断是否为M，那么就是问的是最大流的值是否为M，这样子只需要考虑的是最大流的值即可了，我们接下去判断，怎么建边就是个问题了，一共有K个点是所谓 的出题的每个种类的要求的点，然后还有N个是所有的题目的点，然后根据每道题的范围，在对题目种类连接上一条容量为1的边，然后再通过K个点与汇点链接上容量为其需求的边，然后判断即可。

  不难，加了当前弧优化还是30+ms。

---

#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 = 4.5e4 + 7, maxN = 1e3 + 55, S = 0;
int head[maxN], cur[maxN], cnt, K, N, 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 val)
{
    edge[cnt] = Eddge(head[u], v, val);
    head[u] = cnt++;
}
int deep[maxN];
queue<int> Q;
bool bfs()
{
    while(!Q.empty()) Q.pop();  memset(deep, 0, sizeof(deep)); deep[S] = 1;    Q.push(S);
    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 dist)
{
    if(u == T) return dist;
    for(int &i=cur[u], v, flow; ~i; i=edge[i].nex)
    {
        v = edge[i].to; flow = edge[i].flow;
        if(deep[v] == deep[u] + 1 && flow)
        {
            int di = dfs(v, min(flow, dist));
            if(di)
            {
                edge[i].flow -= di;
                edge[i^1].flow += di;
                return di;
            }
        }
    }
    return 0;
}
int Dinic()
{
    int ans = 0, tmp = 0;
    while(bfs())
    {
        for(int i=S; i<=T; i++) cur[i] = head[i];
        while((tmp = dfs(S, INF))) ans += tmp;
    }
    return ans;
}
inline void init()
{
    cnt = 0;    T = N + K + 1;
    memset(head, -1, sizeof(head));
}
int main()
{
    scanf("%d%d", &K, &N);
    init();
    int all = 0;
    for(int i=1, e1; i<=K; i++)
    {
        scanf("%d", &e1);   all += e1;
        addEddge(i, T, e1);
        addEddge(T, i, 0);
    }
    for(int i=1, p, e1; i<=N; i++)
    {
        scanf("%d", &p);
        addEddge(S, K + i, 1);
        addEddge(K + i, S, 0);
        while(p--)
        {
            scanf("%d", &e1);
            addEddge(K + i, e1, 1);
            addEddge(e1, K + i, 0);
        }
    }
    int ans = Dinic();
    if(ans != all) { printf("No Solution!\n"); return 0; }
    for(int u=1; u<=K; u++)
    {
        printf("%d:", u);
        for(int i=head[u], v, val; ~i; i=edge[i].nex)
        {
            v = edge[i].to; val = edge[i].flow;
            if(v > S && v < T && val) printf(" %d", v - K);
        }
        printf("\n");
    }
    return 0;
}