洛谷OJ：P1345 [USACO5.4]奶牛的电信Telecowmunication(最小割)

分析:求最少需要去掉几个点让源点无法到达汇点,于是就成了一个最小割点问题,我们将一个点拆分成两个点,设这个点为i,那么将i拆分成i和i+n这两个点,连一条i到i+n的有向边,边权为1,将i的入边与i连接,i的出边变为i+n的出边,权值均为无穷大,之后直接求最大流即为最小割点的答案了

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define init(a,b) memset(a, b, sizeof(a))
#define Min(a,b) a<b?a:b
using namespace std;

const int maxn = 100*100, inf = 0x3f3f3f3f;
struct Edge{
    int next, t, c;
}es[maxn];
int head[maxn], depth[maxn];
int cnt, s, t;
int n, m;
queue<int> que;

void init_network_flows() {
    cnt = -1;
    init(head, -1);
    init(es, -1);
}

void add_edge(int f, int t, int c) {
    es[++cnt].next = head[f];
    es[cnt].t = t;
    es[cnt].c = c;
    head[f] = cnt;
}

void add_double_edge(int f, int t, int c) {
    add_edge(f, t, c);
    add_edge(t, f, 0);
}

bool bfs() {
    init(depth, 0);
    while(!que.empty()) que.pop();
    que.push(s); depth[s] = 1;
    while(!que.empty()) {
        //printf("*\n");
        int u = que.front(); que.pop();
        for(int i = head[u]; i != -1; i = es[i].next) {
            if(depth[es[i].t] == 0 && es[i].c > 0) {
                depth[es[i].t] = depth[u] + 1;
                if(es[i].t == t) return true;
                que.push(es[i].t);
            }
        }
    }
    return depth[t] > 0;
}

int dfs(int u, int dis) {
    if(u == t) return dis;
    for(int i = head[u]; i != -1; i = es[i].next) {
        if(depth[es[i].t] == depth[u] + 1 && es[i].c) {
            int d = dfs(es[i].t, Min(es[i].c, dis));
            if(d > 0) {
                es[i].c -= d;
                es[i^1].c += d;
                return d;
            }
        }
    }
    return 0;
}

int Dinic() {
    int rec = 0, d;
    while(bfs())
        while(d = dfs(s, inf))
            rec += d;
    return rec;
}

int main() {
    int t1, t2;
    init_network_flows();
    scanf("%d %d %d %d", &n, &m, &s, &t);
    s += n;
    for(int i = 1; i <= n; i++) add_double_edge(i, i+n, 1);
    for(int i = 1; i <= m; i++) {
        scanf("%d %d", &t1, &t2);
        add_double_edge(t1+n, t2, inf);
        add_double_edge(t2+n, t1, inf);
    }
    printf("%d", Dinic());
    return 0;
}