Acwing 381. 有线电视网络 (最小割)

题意

给定一张n个点 m条边的无向图 问删最少的点使得这张图不连通

题目思路

删点问题想到拆点和割边 最小割问题用来求解割边 拆点把一个点变为带边权为1的两个点入点和出点 由于是割点只能割掉拆点得到的这条边权为1的边 不能割掉其他不同两点之间的边 所以将不同点之间的边权设为无穷大 从而保证最小割是割点而不是割边
将图变为不连通即将源点和汇点变为不连通 遍历所有点做源点和汇点 每次跑一遍dinic求最小割 更新最小值res (res初值要为n)

代码

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

using namespace std;

const int N = 110, M = 10010, INF = 1e8;

int n, m, S, T;
int h[N], e[M], ne[M], f[M], idx;
int cur[N], d[N], q[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;
    d[S] = 0, q[0] = S, 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])
    {
        int ver = e[i];
        cur[u] = 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()
{
    while (~scanf("%d%d", &n, &m))
    {
        memset(h, -1, sizeof h);
        idx = 0;
        
        for (int i = 0; i < n; i ++ ) add(i, n + i, 1);
        
        while (m -- )
        {
            int a, b;
            scanf(" (%d,%d)", &a, &b);
            add(n + a, b, INF);
            add(n + b, a, INF);
        }
        
        int res = n;
        for (int i = 0; i < n; i ++ )
            for (int j = 0; j < i; j ++ )
            {
                for (int k = 0; k < idx; k += 2)
                {
                    f[k] += f[k ^ 1];
                    f[k ^ 1] = 0;
                }
                
                S = n + i, T = j;
                res = min(res, dinic());
            }
            
        printf("%d\n", res);
    }
    
    return 0;
}