HDU5889最短路构图最大流

先跑出最短路，然后根据最短路的d数组重新构图。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <queue>
#define mem(a,x) memset(a,x,sizeof(a))
#define INF 0x3f3f3f3f
#define N 1110
#define M 10005
typedef long long ll;
using namespace std;

struct Node
{
    int v,w;
    Node(int vv,int ww):v(vv),w(ww){};
};
vector<Node>e[N];
int s,t,n,m,vs,vt;
int d[N];
int vis[N];
void spfa()
{
    memset(vis,0,sizeof(vis));
    for(int i = 1;i<=n;i++)
        d[i]=INF;
    d[s]=0;
    queue<int>q;
    q.push(s);
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u]=0;
        for(int i = 0;i<e[u].size();i++)
        {
            int v = e[u][i].v;
            if(d[v]>d[u]+1)
            {
                d[v]=d[u]+1;
                if(!vis[v])
                    q.push(v);
                vis[v]=1;
            }
        }
    }
}


struct Edge{
    int from,to,cap,flow;
};
struct Dinic{
    int n,m,s,t; //节点数，边数（包括反向弧）,源点，汇点
    vector<Edge>edges;
    vector<int>G[N];//表示节点i 的第j条边在e数组的编号
    bool vis[N]; // bfs中
    int d[N];//起点到i的距离
    int cur[M]; //当前弧下标

    bool BFS(){
        mem(vis,0);
        queue<int >Q;
        Q.push(s); d[s] = 0;vis[s] = 1;
        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] = 1;
                    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;
    }
    ll MaxFlow(int s,int t){
        this->s = s;this->t = t;
        ll flow = 0;
        while(BFS()){
            mem(cur,0);
            flow += DFS(s,INF);
        }
        return flow;
    }
    void addEdge(int from,int to,int cap){
        edges.push_back((Edge){from,to,cap,0});
        edges.push_back((Edge){to,from,0,0});
        m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }
    void init(){
        edges.clear();
        for(int i=0;i<=N;i++){
            G[i].clear();d[i] =0; vis[i] = 0;
        }
        mem(cur,0);
    }
}solve;
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(int i = 0;i<=n;i++)
            e[i].clear();
        for(int i = 1;i<=m;i++)
        {
            int u,v,di;
            scanf("%d%d%d",&u,&v,&di);
            e[u].push_back(Node(v,di));
            e[v].push_back(Node(u,di));
        }
        s=1,t=n;
        spfa();
        solve.init();
        for(int i = 1;i<=n;i++)
            for(int j = 0;j<e[i].size();j++)
                if(d[e[i][j].v]==d[i]+1)
                    solve.addEdge(i,e[i][j].v,e[i][j].w);
        printf("%lld\n",solve.MaxFlow(s,t));
    }
}