HDU3491最小割拆点

题目链接

---

http://acm.hdu.edu.cn/showproblem.php?pid=3491
 这道题就是一个最小割，不过由于给出的是点的容量所以采用拆点连边，这样就把一个点拆成连个点然后其边容量为点容量。之后建图的时候是双向边把拆出的点（i + n）连到下个点就好，然后就是最大流。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>

using namespace std;
const int maxn = 100004;
const int INF = 0x3f3f3f3f;
int n, m, s, h;
struct Edge
{
    int from, to, cap, flow;
    Edge(int from, int to, int cap, int flow):from(from), to(to), cap(cap), flow(flow){}
};
struct EdmondsKarp
{
    vector<Edge> edges;
    vector<int>G[maxn];
    int a[maxn];
    int p[maxn];
    void init(int n)
    {
        for(int i = 0;i <= n;i++)
            G[i].clear();
        edges.clear();
    }
    void AddEdge(int from, int to, int cap)
    {
        edges.push_back(Edge(from, to, cap, 0));
        edges.push_back(Edge(to, from, 0, 0));
        int m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }
    int Maxflow(int s, int t)
    {
        int flow = 0;
        for(;;)
        {
            memset(a, 0, sizeof(a));
            queue<int>Q;
            Q.push(s);
            a[s] = INF;
            while(!Q.empty())
            {
                int x = Q.front();
                Q.pop();
                for(int i = 0;i < (int)G[x].size();i++)
                {
                    Edge &e = edges[G[x][i]];
                    if(!a[e.to]&&e.cap > e.flow)
                    {
                        p[e.to] = G[x][i];
                        a[e.to] = min(a[x], e.cap - e.flow);
                        Q.push(e.to);
                    }
                }
                if(a[t])
                    break;
            }
            if(!a[t])
                break;
            for(int u = t;u != s;u = edges[p[u]].from)
            {
                edges[p[u]].flow += a[t];
                edges[p[u]^1].flow -= a[t];
            }
            flow += a[t];
        }
        return flow;
    }
}ek;
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d%d%d", &n, &m, &s, &h);
        ek.init(2 * n);
        for(int i = 1;i <= n;i++)
        {
            int ls;
            scanf("%d", &ls);
            if(i == s||i == h)
            {
                ek.AddEdge(i, i + n, INF);
            }
            else
            {
                ek.AddEdge(i, i + n, ls);
            }
        }
        for(int i = 1;i <= m;i++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            ek.AddEdge(a + n, b, INF);
            ek.AddEdge(b + n, a, INF);
        }
        printf("%d\n", ek.Maxflow(s, n + h));
    }
    return 0;
}