HDU - 3416-Marriage Match IV (最大流 + 最短路)

HDU - 3416：http://acm.hdu.edu.cn/showproblem.php?pid=3416

参考：https://www.cnblogs.com/kuangbin/archive/2013/05/04/3059372.html

题意：

　　　问一个带权值的图中，最多能跑几次最短路，每条路只能走一遍。

思路：

　　这道题要利用最大流算法和最短路算法。先要跑两遍dji（），第一遍跑从起点S开始跑一遍正图，第二遍从终点T跑一遍反图。这样后枚举每一条边，看这条边的起点到S的距离+这条边的终点到T的距离+这条边长 == 最短路，如果成立，就把这条边 的容量设为1，加入网络流的图中。最后跑一下最大流就行了。

　　自己在枚举点的时候没有搞清楚终点是T，wa了好几发。

#include <algorithm>
#include  <iterator>
#include  <iostream>
#include   <cstring>
#include   <cstdlib>
#include   <iomanip>
#include    <bitset>
#include    <cctype>
#include    <cstdio>
#include    <string>
#include    <vector>
#include     <stack>
#include     <cmath>
#include     <queue>
#include      <list>
#include       <map>
#include       <set>
#include   <cassert>
using namespace std;
//#pragma GCC optimize(3)
//#pragma comment(linker, "/STACK:102400000,102400000")  //c++
#define lson (l , mid , rt << 1)
#define rson (mid + 1 , r , rt << 1 | 1)
#define debug(x) cerr << #x << " = " << x << "\n";
#define pb push_back
#define pq priority_queue

typedef long long ll;
typedef unsigned long long ull;

typedef pair<ll ,ll > pll;
typedef pair<int ,int > pii;
typedef pair<int,pii> p3;

//priority_queue<int> q;//这是一个大根堆q
//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q
#define fi first
#define se second
//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)
#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行
#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)
//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFF;  //
const ll nmos = 0x80000000;  //-2147483648
const int inf = 0x3f3f3f3f;
const ll inff = 0x3f3f3f3f3f3f3f3f; //
const int mod = 1e9+;
const double esp = 1e-;
const double PI=acos(-1.0);

template<typename T>
inline T read(T&x){
    x=;int f=;char ch=getchar();
    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();
    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();
    return x=f?-x:x;
}

/*-----------------------showtime----------------------*/
            const int maxn = 2e5+;
            int n,m,c,ans;

            int  dis[][maxn];
            vector<pii>g[][maxn];
            //dji
            void dji(int f,int soc){
                for(int i=; i<=n; i++)dis[f][i] = inf;

                priority_queue<pii>que;
                dis[f][soc] = ;
                que.push(pii(,soc));

                while(!que.empty()){
                    pii tmp = que.top();que.pop();
                    int u = tmp.se;
                    if(dis[f][u] < -*tmp.fi)continue;
                    for(int i=; i<g[f][u].size(); i++){
                        int v = g[f][u][i].fi;
                        if(dis[f][v] > dis[f][u] + g[f][u][i].se)
                        {
                            dis[f][v] = dis[f][u] + g[f][u][i].se;
                            que.push(pii(-*dis[f][v], v));
                        }
                    }
                }
            }
            const int maxm = 1e6+;
            struct Edge
            {
                int u,v,cap;
                Edge(){}
                Edge(int u,int v,int cap):u(u),v(v),cap(cap){}
            }es[maxm];
            int R,S,T;
            vector<int>tab[maxn];
            int diss[maxn],current[maxn];
            void addedge(int u,int v,int cap){
                tab[u].pb(R);
                es[R++] = Edge(u,v,cap);
                tab[v].pb(R);
                es[R++] = Edge(v,u,);
            }
            bool BFS(){
                queue<int>q;q.push(S);
                memset(diss,inf,sizeof(diss));
                diss[S] = ;
                while(!q.empty()){
                    int h = q.front();q.pop();
                    for(int i=; i<tab[h].size(); i++){
                        Edge & e = es[tab[h][i]];
                        if(e.cap> &&diss[e.v] == inf){
                            diss[e.v] = diss[h] + ;
                            q.push(e.v);
                        }
                    }
                }
                return diss[T] < inf;
            }

            int DFS(int x,int maxflow){
                if(x == T){
                    return maxflow;
                }
                for(int i=current[x]; i<tab[x].size(); i++){
                    current[x] = i;
                    Edge &e = es[tab[x][i]];
                    if(diss[e.v] == diss[x] +  && e.cap > ){
                        int flow = DFS(e.v, min(maxflow, e.cap));
                        if(flow>){
                            e.cap -= flow;
                            es[tab[x][i] ^ ].cap += flow;
                            return flow;
                        }
                    }
                }
                return ;
            }
            int dinic(){
                int ans = ;
                while(BFS()){
                    int flow;
                    memset(current,,sizeof(current));
                    while(true){
                        flow = DFS(S,inf);
                        if(flow > ) ans += flow;
                        else break;
                    }
                }
                return ans;
            }

int main(){
            int t;scanf("%d" , &t);

            while(t--){

                scanf("%d%d", &n, &m);
                for(int i=; i<=n; i++)g[][i].clear(),g[][i].clear(),tab[i].clear();
                for(int i=; i<=m; i++){
                        int u,v,c;
                        scanf("%d%d%d", &u, &v, &c);
                        if(v == u)continue;
                        g[][u].pb(pii(v,c));
                        g[][v].pb(pii(u,c));
                }
                scanf("%d%d", &S, &T);

                dji(,S),dji(,T);
                // debug(dis[0][n]);
                R = ;
                for(int i=; i<=n; i++){
                    for(int j=; j<g[][i].size(); j++){
                        int u = i,v = g[][i][j].fi;
                        if(u!=v && dis[][T] == dis[][u] + dis[][v] + g[][i][j].se){
                            addedge(u,v,);
                        }
                    }
                }
                printf("%d\n", dinic());
            }
            return ;
}

HDU - 3416