HDU - 3491 Thieves (最小割拆点)

题意

有一群盗贼从S城到T城作案 警察想办法从中间截击这帮盗贼使得他们无法到达T城 小偷初始都在S点 问警察最少要抓多少盗贼使得他们无法到达T城 即割掉多少点使得图不连通 求最小点权

思路

拆点 将点拆为入点和出点 出点在右侧 故 S 要加 n 出点入点之间边权为原图点权且为单向边 作图连接不同点之间边的时候边权设为无穷大 使得求最小割不会切掉这些边(原图中的边)

代码

#include <iostream> 
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int N = 510, M = 50010, INF = 1e8;

int n, m, S, T;
int h[N], e[M], ne[M], f[M], idx;
int cur[N], q[N], d[N];

void add(int a, int b, int c)
{
    e[idx] = b, ne[idx] = h[a], f[idx] = c, h[a] = idx ++ ;
    e[idx] = a, ne[idx] = h[b], f[idx] = 0, h[b] = idx ++ ;
}

bool bfs()
{
    memset(d, -1, sizeof d);
    int hh = 0, tt = 0;
    q[0] = S, d[S] = 0, cur[S] = h[S];
    while (hh <= tt)
    {
        int t = q[hh ++ ];
        for (int i = h[t]; ~i; i = ne[i])
        {
            int ver = e[i];
            if (d[ver] == -1 && f[i])
            {
                d[ver] = d[t] + 1;
                cur[ver] = h[ver];
                if (ver == T) return true;
                q[ ++ tt] = ver;
            }
        }
    }
    return false;
}

int find(int u, int limit)
{
    if (u == T) return limit;
    int flow = 0;
    for (int i = cur[u]; ~i && flow < limit; i = ne[i])
    {
        cur[u] = i;
        int ver = e[i];
        if (d[ver] == d[u] + 1 && f[i])
        {
            int t = find(ver, min(f[i], limit - flow));
            if (!t) d[ver] = -1;
            f[i] -= t, f[i ^ 1] += t, flow += t;
        }
    }
    return flow;
}

int dinic()
{
    int r = 0, flow;
    while (bfs()) while (flow = find(S, INF)) r += flow;
    return r;
}

int main()
{
    int Case;
    scanf("%d", &Case);
    
    while (Case -- )
    {
        scanf("%d%d%d%d", &n, &m, &S, &T);
        S += n;
        
        memset(h, -1, sizeof h);
        idx = 0;
        
        for (int i = 1; i <= n; i ++ ) 
        {
            int w;
            scanf("%d", &w);
            add(i, i + n, w);
        }
        
        while (m -- )
        {
            int a, b;
            scanf("%d%d", &a, &b);
            add(a + n, b, INF);
            add(b + n, a, INF);
        }
        
        printf("%d\n", dinic());
    }
    
    return 0;
}