2016 ACM/ICPC Asia Regional Qingdao Online hdu 5889 Barricade （最短路+最小割）

题意：

题意转化过来就是给定一张图，每条边长度都是1，还有一个切割这条边的代价。现在有一伙人从第n个点到第1个点走最短路，问最少需要花费多少代价阻断这伙人的路线

题解：

很显然就是处理出最短路，按照最短路建网络流的边，跑一遍最小割就好。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <queue>
#include <map>
#include <bitset>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-3
#define maxn 300100
#define MOD 1000000007


int vis[1010],dis[1010];
int a[1010][1010];
int mp[1010][1010];
vector<pair<int,int> > tmp[1010];

const int MAXN = 100010;
const int MAXM = 400010;
struct Edge
{
    int to,next,cap,flow;
} edge[MAXM];
int tot,n,m,k;
int head[MAXN];
int gap[MAXN],dep[MAXN];
int pre[MAXN],cur[MAXN];

void Dijkstra(int x)
{
    memset(vis,0,sizeof(vis));
    for(int i = 1; i <= n; i++)
        dis[i] = a[x][i];
    vis[x] = 1;
    dis[x] = 0;
    for (int i = 1; i<= n; i++)
    {
        int p;
        int Min = INF;
        for(int j = 1; j <= n; j++)
        {
            if(!vis[j] && dis[j] < Min)
            {
                p = j;
                Min = dis[j];
            }
        }
        vis[p] = 1;
        for(int j = 1; j <= n; j++)
            if(!vis[j] && dis[p] + a[p][j] < dis[j])
                dis[j] = dis[p] + a[p][j];
    }
}

void init()
{
    tot = 0;
    memset(head,-1,sizeof(head));
}
void add_edge(int u,int v,int w,int rw = 0)
{
    edge[tot].to = v;
    edge[tot].cap = w;
    edge[tot].flow = 0;
    edge[tot].next = head[u];
    head[u] = tot++;
    edge[tot].to = u;
    edge[tot].cap = rw;
    edge[tot].flow = 0;
    edge[tot].next = head[v];
    head[v] = tot++;
}
int sap(int start,int en,int N)
{
    memset(gap,0,sizeof(gap));
    memset(dep,0,sizeof(dep));
    memcpy(cur,head,sizeof(head));
    int u = start;
    pre[u] = -1;
    gap[0] = N;
    int ans = 0;
    while(dep[start] < N)
    {
        if(u == en)
        {
            int Min = INF;
            for(int i = pre[u]; i != -1; i = pre[edge[i^1].to])
                if(Min > edge[i].cap - edge[i].flow)
                    Min = edge[i].cap - edge[i].flow;
            for(int i = pre[u]; i != -1; i = pre[edge[i^1].to])
            {
                edge[i].flow += Min;
                edge[i^1].flow -= Min;
            }
            u = start;
            ans += Min;
            continue;
        }
        int flag = 0;
        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 = 1;
                cur[u] = pre[v] = i;
                break;
            }
        }
        if(flag)
        {
            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[pre[u]^1].to;
    }
    return ans;
}
int main()
{
    int t,C = 1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        memset(a,INF,sizeof(a));
        memset(mp,INF,sizeof(mp));
        for(int i = 0; i < 1010; i++)
            tmp[i].clear();
        for(int i = 0; i < m; i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            a[x][y] = 1;
            a[y][x] = 1;
            mp[x][y] = min(mp[x][y],z);
            mp[y][x] = min(mp[y][x],z);
        }
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(mp[i][j] < INF)
                    tmp[i].push_back(make_pair(j,mp[i][j]));
        Dijkstra(n);
        memset(vis,0,sizeof(vis));
        init();
        queue<int> q;
        q.push(1);
        vis[1] = 1;
        while(!q.empty())
        {
            int x = q.front();
            q.pop();
            for(int i = 0; i < tmp[x].size(); i++)
            {
                int y = tmp[x][i].first;
                int z = tmp[x][i].second;
                if(dis[y] == dis[x] - 1)
                    add_edge(x,y,z);
                if(!vis[y])
                {
                    vis[y] = 1;
                    q.push(y);
                }
            }
        }
        printf("%d\n",sap(1,n,n));
    }
    return 0;
}