最大流、最小费用最大流

最大流可以看做最小费用最大流中费用全部为 1 时的特殊情况，所以要求最大流的时候可以用最小费用最大流的算法，只要把费用设为 1 就可以了。

struct Edge
{
    int from, to, cap, flow;
    int weight;
    Edge(int u, int v, int c, int f, int w):
        from(u), to(v), cap(c), flow(f), weight(w) {}
};

struct Dinic
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int p[maxn];
    int a[maxn];

    void init(int n)
    {
        for (int i=0; i<n+1; i++)
        {
            G[i].clear();
        }
        edges.clear();
        this->n = n+1;
        this->s = 0;
        this->t = n+1;
    }

    void addEdge(int from, int to, int cap, int w = 1)
    {
        edges.push_back(Edge(from, to, cap, 0, w));
        edges.push_back(Edge(to, from, 0, 0, w));
        m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    int spfa()
    {
        memset(vis,0,sizeof(vis)); vis[s] = true;
        for (int i=0; i<=n; i++)  d[i] = INF; d[s] = 0;
        p[s] = 0; a[s] = INF;

        queue<int> Q;
        Q.push(s);
        d[s] = 0;
        vis[s] = true;
        while (!Q.empty())
        {
            int x = Q.front();
            Q.pop();
            vis[x] = false;
            for (int i=0; i<G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if (e.cap>e.flow && d[e.to] > d[x]+e.weight)
                {
                    d[e.to] = d[x]+e.weight;
                    p[e.to] = G[x][i];
                    a[e.to] = min(a[x], e.cap-e.flow);
                    if (!vis[e.to])
                    {
                        Q.push(e.to);
                        vis[e.to] = true;
                    }
                }
            }
        }
        if (d[t] == INF)
            return 0;

        int u = t;
        while (u != s)
        {
            edges[p[u]].flow += a[t];
            edges[p[u]^1].flow -= a[t];
            u = edges[p[u]].from;
        }
        return a[t];
    }

    int maxFlow(int s, int t)
    {
        int flow = 0;
        while (true)
        {
            int f = spfa();
            if (!f)
                break;
            flow += f;
        }
        return flow;
    }
};

bool is_prime(int x)
{
    for (int i=2; i<=sqrt(x); i++)
        if (x % i == 0)
            return false;
    return true;
}