題目鏈接

BZOJ3597

題解

orz一眼過去一點思路都沒有

既然是流量網絡，就要借鑒網絡流的思想了

我們先處理一下那個比值，顯然是一個分數規劃，我們二分一個\(\lambda = \frac{X - Y}{k}\)
如果\(\lambda\)成立，則
\[\lambda \le \frac{X - Y}{k}\]
即
\[\lambda k + (Y - X) \le 0\]
所以我們只需要判斷是否存在一種方案使得這個式子成立

依照網絡流的思想，撤回流量就往反向邊走，擴展流量往正向邊
對於邊\((u,v)\)，撤回流量產生的代價就是\(\lambda + \Delta fee = \lambda + (ai - di)\)

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<map>
#define Redge(u) for (int k = h[u],to; k; k = ed[k].nxt)
 

#define REP(i,n) for (int i = 1; i <= (n); i++)
#define mp(a,b) make_pair<int,int>(a,b)
#define cls(s) memset(s,0,sizeof(s))
#define cp pair<int,int>
#define LL long long int
#define eps 1e-4
using namespace std;
const int maxn = 5005,maxm = 10005,INF = 1000000000;
inline int read(){
    int out = 0
 
,flag = 1; char c = getchar();
    while (c < 48 || c > 57){if (c == ‘-‘) flag = -1; c = getchar();}
    while (c >= 48 && c <= 57){out = (out << 3) + (out << 1) + c - 48; c = getchar();}
    return out * flag;
}
int h[maxn],ne;
struct EDGE{int to,nxt; double w;}ed[maxm];
inline void build(int u,int v,double w){
    ed[++ne] = (EDGE){v,h[u],w}; h[u] = ne;
}
int n,m,vis[maxn];
double d[maxn];
bool spfa(int u,double lam){
    vis[u] = true;
    Redge(u){
        to = ed[k].to;
        if (d[to] > d[u] + ed[k].w + lam){
            d[to] = d[u] + ed[k].w + lam;
            if (vis[to]) return true;
            if (spfa(to,lam)) return true;
        }
    }
    vis[u] = false;
    return false;
}
bool check(double lam){
    cls(vis); cls(d);
    for (int i = 1; i <= n; i++) if (spfa(i,lam)) return true;
    return false;
}
int main(){
    n = read() + 2; m = read();
    int u,v,a,b,c,d;
    for (int i = 1; i <= m; i++){
        u = read(); v = read(); a = read(); b = read(); c = read(); d = read();
        if (u == n - 1 || v == n - 1) continue;
        if (c) build(v,u,a - d);
        build(u,v,d + b);
    }
    double l = 0,r = 1000000000,mid;
    while (r - l > eps){
        mid = (l + r) / 2.0;
        if (check(mid)) l = mid;
        else r = mid;
    }
    printf("%.2lf",(l + r) / 2.0);
    return 0;
}

BZOJ3597 [Scoi2014]方伯伯運椰子 【二分 + 判負環】