hdu 5889 最短路最小割 2016 qingdao regional online

求出原图的所有最短路的边加入网络流中，再求一遍最大流即为答案。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1005;
#define inf 1e9
#define INF 1e9
const int maxm = 4000000+50;
struct Node
{
    int v,w;
    Node(int vv,int ww):v(vv),w(ww) {};
};
vector<Node>e[maxn];
int s,t,n,m,vs,vt;
int d1[maxn];
int vis[maxn];
void spfa()
{
    memset(vis,0,sizeof(vis));
    for(int i = 1; i<=n; i++)
        d1[i]=inf;
    d1[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;
            int w = e[u][i].w;
            if(d1[v]>d1[u]+1)
            {
                d1[v]=d1[u]+1;
                if(!vis[v])
                    q.push(v);
                vis[v]=1;
            }
        }
    }
}


const int Ni = 1005;
const int MAX = 1<<26;
struct Edge
{
    int u,v,c;
    int next;
} edge[100005*4]; //如果题目内存不容许开很大或不清楚，应该弄成vector比较好

int edn;//边数
int p[Ni];//父亲
int d[Ni];
int sp,tp;//原点，汇点

void addedge(int u,int v,int c)
{
    edge[edn].u=u;
    edge[edn].v=v;
    edge[edn].c=c;
    edge[edn].next=p[u];
    p[u]=edn++;

    edge[edn].u=v;
    edge[edn].v=u;
    edge[edn].c=0;
    edge[edn].next=p[v];
    p[v]=edn++;
}
int bfs()
{
    queue <int> q;
    memset(d,-1,sizeof(d));
    d[sp]=0;
    q.push(sp);
    while(!q.empty())
    {
        int cur=q.front();
        q.pop();
        for(int i=p[cur]; i!=-1; i=edge[i].next)
        {
            int u=edge[i].v;
            if(d[u]==-1 && edge[i].c>0)
            {
                d[u]=d[cur]+1;
                q.push(u);
            }
        }
    }
    return d[tp] != -1;
}
int dfs(int a,int b)
{
    int r=0;
    if(a==tp)return b;
    for(int i=p[a]; i!=-1 && r<b; i=edge[i].next)
    {
        int u=edge[i].v;
        if(edge[i].c>0 && d[u]==d[a]+1)
        {
            int x=min(edge[i].c,b-r);
            x=dfs(u,x);
            r+=x;
            edge[i].c-=x;
            edge[i^1].c+=x;
        }
    }
    if(!r)d[a]=-2;
    return r;
}
void bfs1(int s)
{
    memset(vis,0,sizeof(vis));
    queue<int> q;
    q.push(s);
    while(!q.empty())
    {
        int t=q.front();
        q.pop();
        if(vis[t])continue;
        vis[t]=1;
        for(int i=0; i<e[t].size(); i++)
        {
            if(d1[e[t][i].v]-1==d1[t])
            {
                //cout<<e[t][i].v<<" "<<t<<endl;
                addedge(t,e[t][i].v,e[t][i].w);
                q.push(e[t][i].v);
            }
        }
    }
}
int dinic(int sp,int tp)
{
    int total=0,t;
    while(bfs())
    {
        while(t=dfs(sp,MAX))
            total+=t;
    }
    return total;
}
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();
        edn=0;
        sp=1,tp=n;
        memset(p,-1,sizeof(p));
        bfs1(1);
        printf("%d\n",dinic(1,n));
    }
}