[USACO5.4]奶牛的电信Telecowmunication【最小割】

P1345 [USACO5.4]奶牛的电信Telecowmunication

---

  一个最小割的问题，但是要注意了，这里是割点，所以要注意去拆点，然后不要忘记去维护S点的不同。

  后面附上了一组测试样例。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define MP3(a, b, c) MP(MP(a, b), c)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 207, maxE = 8e3 + 7;
int N, M, S, T, head[maxN], cur[maxN], cnt;
struct Eddge
{
    int nex, to, flow;
    Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), flow(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int w)
{
    edge[cnt] = Eddge(head[u], v, w);
    head[u] = cnt++;
}
inline void _add(int u, int v, int w) { addEddge(u, v, w); addEddge(v, u, 0); }
int deep[maxN];
queue<int> Q;
inline bool bfs()
{
    memset(deep, 0, sizeof(deep)); deep[S] = 1;
    while(!Q.empty()) Q.pop();
    Q.push(S);
    while(!Q.empty())
    {
        int u = Q.front();  Q.pop();
        for(int i=head[u], v, f; ~i; i=edge[i].nex)
        {
            v = edge[i].to; f = edge[i].flow;
            if(f > 0 && !deep[v])
            {
                deep[v] = deep[u] + 1;
                Q.push(v);
            }
        }
    }
    return deep[T];
}
inline int dfs(int u, int dist)
{
    if(u == T) return dist;
    for(int &i=cur[u], v, f; ~i; i=edge[i].nex)
    {
        v = edge[i].to; f = edge[i].flow;
        if(f > 0 && deep[v] == deep[u] + 1)
        {
            int di = dfs(v, min(dist, f));
            if(di)
            {
                edge[i].flow -= di;
                edge[i^1].flow += di;
                return di;
            }
        }
    }
    return 0;
}
inline int Dinic()
{
    int ans = 0, tmp;
    while(bfs())
    {
        for(int i=1; i<=(N<<1); i++) cur[i] = head[i];
        while( (tmp = dfs(S, INF)) ) ans += tmp;
    }
    return ans;
}
inline void init()
{
    cnt = 0;
    memset(head, -1, sizeof(head));
}
int main()
{
    scanf("%d%d%d%d", &N, &M, &S, &T);
    init();
    for(int i=1; i<=N; i++)
    {
        if(i == S) _add(i, i+ N, INF);
        else if(i != T) _add(i, i + N, 1);
    }
    for(int i=1, u, v; i<=M; i++)
    {
        scanf("%d%d", &u, &v);
        _add(u + N, v, 1);
        _add(v + N, u, 1);
    }
    printf("%d\n", Dinic());
    return 0;
}
/*
4 5 1 4
1 2
2 3
3 4
2 4
1 3
ans:2
 */