HDU 5889

青岛网络赛，当时不会做，可想我有多水。

最大流即最小割。

要阻断的是最短路，因此其他路忽略掉就行，先跑一遍最短路，删除最短路以外的路，跑一遍最大流即最小割。

代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
const int maxn = 1010;
const int INF = 0x7fffffff;
struct Edge
{
    int from, to, cap, flow;
};
int d[maxn];
vector<int> G[maxn];
bool vis[maxn];
bool g[maxn][maxn];
struct Edge2
{
    int u, v, c;
}e[maxn];
struct Dinic
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int cur[maxn];
    int d[maxn];
    void init(int maxn)
    {
        edges.clear();
        for(int i = 0; i < maxn; ++i)
            G[i].clear();
    }
    void AddEdge(int from, int to, int cap)
    {
        edges.push_back({from, to, cap, 0});
        edges.push_back({to, from, 0, 0});
        m = edges.size();
        G[from].push_back(m - 2);
        G[to].push_back(m - 1);
    }
    bool BFS()
    {
        memset(vis, false, sizeof(vis));
        queue<int> q;
        q.push(s);
        d[s] = 0;
        vis[s] = true;
        while(!q.empty())
        {
            int x = q.front();q.pop();
            for(int i = 0; i < G[x].size(); ++i)
            {
                Edge &e = edges[G[x][i]];
                if(!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = true;
                    d[e.to] = d[x] + 1;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a)
    {
        if(x == t || a == 0)
            return a;
        int flow = 0, f;
        for(int &i = cur[x]; i < G[x].size(); ++i)
        {
            Edge &e = edges[G[x][i]];
            if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap - e.flow))) > 0)
            {
                e.flow += f;
                edges[G[x][i] ^ 1].flow -= f;
                flow += f;
                a -= f;
                if(a == 0)
                    break;
            }
        }
        return flow;
    }
    int Maxflow(int s, int t)
    {
        this->s = s;
        this->t = t;
        int flow = 0;
        while(BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }
}dinic;
void bfs(int s, int t)
{
    memset(vis, false, sizeof(vis));
    memset(d, 0x3f3f3f3f, sizeof(d));
    d[s] = 0;
    queue<int> q;
    q.push(s);
    vis[s] = true;
    while(!q.empty())
    {
        int u = q.front();q.pop();
        for(int i = 0; i < G[u].size(); ++i)
        {
            int v = G[u][i];
            if(!vis[v] && d[u] + 1 < d[v])
            {
                vis[v] = true;
                d[v] = d[u] + 1;
                q.push(v);
            }
        }
    }
}
void bfs2(int s, int t)
{
    memset(vis, false, sizeof(vis));
    memset(g, false, sizeof(g));
    queue<int> q;
    q.push(s);
    vis[s] = true;
    while(!q.empty())
    {
        int u = q.front();q.pop();
        for(int i = 0; i < G[u].size(); ++i)
        {
            int v = G[u][i];
            if(d[u] == d[v] + 1)
            {
                g[v][u] = true;
                if(!vis[v])
                {
                    vis[v] = 1;
                    q.push(v);
                }
            }
        }
    }
}
int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n, m;
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; ++i)
            G[i].clear();
        for(int i = 0; i < m; ++i)
        {
            scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].c);
            G[e[i].u].push_back(e[i].v);
            G[e[i].v].push_back(e[i].u);
        }
        bfs(1, n);
        if(d[n] == 0x3f3f3f3f)
        {
            printf("0\n");
            continue;
        }
        dinic.init(n + 5);
        for(int i = 0; i < m; ++i)
        {
            int u = e[i].u, v = e[i].v, c = e[i].c;
            if(d[u] + 1 == d[v])
            {
                dinic.AddEdge(u, v, c);
            }
            else if(d[v] + 1 == d[u])
            {
                dinic.AddEdge(v, u, c);
            }
        }
        int ans = dinic.Maxflow(1, n);
        printf("%d\n", ans);
    }
}