[HDU 4289]Control[网络流][拆点]

题目链接： [HDU 4289]Control[网络流][拆点]

题意分析：

恐怖分子要从S城市运输大规模杀伤性武器到T城市，而你，作为安全部门的指挥官，要把他们扣下来。埋伏某个城市的成本是cost[i]，现在需要话最少的成本，把从S城市出发的恐怖分子全部扣留下来，问：最少花费是多少？

解题思路：

我们将城市拆成两个点，中间连一条流量为cost[i]的边，可达的城市间连一条INF的边，超级源点和S连一条cost[S]的边，超级汇点和T连一条cost[T]的边，求最大流即可。

用最大流刚好就是每条可行道路花费的最少费用的总和。

个人感受：

因为放在网络流专题做的，所以直接就想着网络流搞，然后细思极恐的是。。。。A完之后在想象，要是不是这个专题我会怎么做。。。。我天

具体代码如下：

#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#define ll long long
#define pr(x) cout << #x << " = " << (x) << '\n';
using namespace std;

const int MAXN = 500;//点数的最大值
const int MAXM = 1e5;//边数的最大值
const int INF = 0x3f3f3f3f;

struct Edge{
    int to,next,cap,flow;
}edge[MAXM];//注意是MAXM
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],cur[MAXN];

void addedge(int u,int v,int w,int rw = 0)
{
    edge[tol].to = v; edge[tol].cap = w; edge[tol].flow = 0;
    edge[tol].next = head[u]; head[u] = tol++;
    edge[tol].to = u; edge[tol].cap = rw; edge[tol].flow = 0;
    edge[tol].next = head[v]; head[v] = tol++;
}

int Q[MAXN];
void BFS(int start,int end)
{
    memset(dep,-1,sizeof(dep));
    memset(gap,0,sizeof(gap));
    gap[0] = 1;
    int front = 0, rear = 0;
    dep[end] = 0;
    Q[rear++] = end;
    while(front != rear)
    {
        int u = Q[front++];
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if(dep[v] != -1)continue;
            Q[rear++] = v;
            dep[v] = dep[u] + 1;
            gap[dep[v]]++;
        }
    }
}

int S[MAXN];
int sap(int start,int end,int N)
{
    BFS(start,end);
    memcpy(cur,head,sizeof(head));
    int top = 0;
    int u = start;
    int ans = 0;
    while(dep[start] < N)
    {
        if(u == end)
        {
            int Min = INF;
            int inser;
            for(int i = 0;i < top;i++)
            if(Min > edge[S[i]].cap - edge[S[i]].flow)
            {
                Min = edge[S[i]].cap - edge[S[i]].flow;
                inser = i;
            }
            for(int i = 0;i < top;i++)
            {
                edge[S[i]].flow += Min;
                edge[S[i]^1].flow -= Min;
            }
            ans += Min;
            top = inser;
            u = edge[S[top]^1].to;
            continue;
        }
        bool flag = false;
        int v;
        for(int i = cur[u]; i != -1; i = edge[i].next)
        {
            v = edge[i].to;
            if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u])
            {
                flag = true;
                cur[u] = i;
                break;
            }
        }
        if(flag)
        {
            S[top++] = cur[u];
            u = v;
            continue;
        }
        int Min = N;
        for(int i = head[u]; i != -1; i = edge[i].next)
            if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
            {
                Min = dep[edge[i].to];
                cur[u] = i;
            }
        gap[dep[u]]--;
        if(!gap[dep[u]]) return ans;
        dep[u] = Min + 1;
        gap[dep[u]]++;
        if(u != start)u = edge[S[--top]^1].to;
    }
    return ans;
}

void init() {
    tol = 0;
    memset(head,-1,sizeof(head));
}

int cost[MAXN];

int main()
{
    int n, m;
    while (~scanf("%d%d", &n, &m)) {
        init();
        int s, t, src = 0, des = 2 * n + 1;
        scanf("%d%d", &s, &t);
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &cost[i]);
            addedge(i, n + i, cost[i]);
        }
        addedge(src, s, cost[s]);
        addedge(t + n, des, cost[t]);

        int x, y;
        while (m --) {
            scanf("%d%d", &x, &y);
            addedge(x + n, y, INF);
            addedge(y + n, x, INF);
        }
        printf("%d\n", sap(src, des, 2 * n + 2));
    }
    return 0;
}