codeforces 635 D

题目大意：

有n个城市，有m条有向边，对应有x个熊搬东西。

接下来m条有向边的输入三个元素，表示起点终点以及这条路径上总共最多可以运送多少货物。

问需要每只熊都搬动相同重量的东西从点1到点n，问最多能够送过去多少重量的货物。

思路：可以形象地理解为x条路径，每条路径的流量相同。问最大流量是多少。二分这个流量，把边权的流量值转化为可以通过熊的个数。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef LL lint;
const double eps = 1e-8;
const lint inf = 0x3f3f3f3f3f3f3f3f;
const int maxn = 101;
const int maxm = 1001;
struct dinic{
    static const int N = 1000;
    static const int M = 50000;
    static const lint inf = 0x3f3f3f3f3f3f3f3f;
    int he[N],ne[M],ver[M],d[N];
    lint edge[M];
    int s,t,tot;
    queue<int> que;
    void init( int n ){
        for( int i = 0;i <= n;i++ ){
            he[i] = 0;
        }
        tot = 1;
    }
    void add( int x,int y,lint z ){
        ver[++tot] = y; ne[ tot ] = he[x]; he[x] = tot; edge[ tot ] = z;
        ver[++tot] = x; ne[tot] = he[y]; he[y] = tot;edge[tot] = 0;
    }
    bool bfs(){
        memset( d,0,sizeof( d ) );
        while( que.size() ) que.pop();
        que.push( s );
        d[s] = 1;
        while( que.size() ){
            int x = que.front();
            que.pop();
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure];
                if( edge[cure] && !d[y] ){
                    que.push( y );
                    d[ y ] = d[x] + 1;
                    if( y == t ) return 1;
                }
            }
        }
        return 0;
    }
    lint dfs( int x,lint flow ){
        if( x== t ) return flow;
        lint rest = flow,k;
        for( int cure = he[x];cure && rest;cure = ne[cure] ){
            int y = ver[cure];
            if( edge[cure] && d[ y ] == d[x] + 1 ){
                k = dfs( y,min( rest,edge[cure] ) );
                if( !k ) d[ y ] = 0;
                edge[cure] -= k;
                edge[ cure^1 ] += k;
                rest -= k;
            }
        }
        return flow - rest;
    }
    lint max_flow( int x,int y ){
        s = x; t = y;
        lint maxflow = 0;
        lint flow = 0;
        while( bfs() )
            while( flow = dfs( s,inf ) ) maxflow += flow;
        return maxflow;
    }
} g;
int u[maxm],v[maxm],c[maxm];
int main(){
    int n,m,x,mx = 0;
    scanf("%d%d%d",&n,&m,&x);
    for( int i = 1;i <= m;i++ ){
        scanf("%d%d%d",&u[i],&v[i],&c[i]);
        mx = max( mx,c[i] );
    }
    int S = 1,T= n;
    double l = 0,r = 1.0*mx*x+10;
    while( r-l > 1e-8 ){
        g.init(T);
        double mid = (l+r)/2;
        double cur = mid/x;
        for( int i = 1;i <= m;i++ ){
            LL cap = c[i] / cur + eps;
            g.add( u[i],v[i],cap );
        }
        LL ans = g.max_flow(S,T);
        if( ans >= x ){
            l = mid;
        }else{
            r = mid;
        }
    }
    printf("%.8lf\n",l);
    return 0;
}