【BZOJ5367】【LOJ2308】【APIO2017】商旅（SPFA判负环，01分数规划，Floyd）

Description

PDF

---

Solution

我们对于每一个点对$(u,v)$，求出从$u$走到$v$的最短路$dist(u,v)$和在$u$买进、在$v$卖出的最大收益$w(u,v)$。
考虑二分答案$x$，我们要判断是否$\frac{\sum w}{\sum dist}\ge x$，即$\sum w-x\times dist \ge 0$，我们将边权变成$w-x\times dist$，然后判断是否有正环即可。

---

Code

/************************************************
 * Au: Hany01
 * Date: Aug 22nd, 2018
 * Prob: LOJ2308 BZOJ5367 APIO2017 商旅
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b <= a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 105, maxk = 1005;

int n, m, k, in[maxn][maxk], out[maxn][maxk], dis[maxn][maxn], ben[maxn][maxn];

inline bool SPFA(int x) {
    static queue<int> q;
    static LL dist[maxn];
    static int vis[maxn], cnt[maxn];

    while (!q.empty()) q.pop();
    For(i, 1, n) q.push(i);
    Set(dist, 127), dist[1] = 0, Set(cnt, 0), Set(vis, 0);

    while (!q.empty()) {
        register int u = q.front(); q.pop(), vis[u] = 0;
        For(v, 1, n)
            if (u != v && dis[u][v] != INF && chkmin(dist[v], dist[u] - ben[u][v] + (LL)x * dis[u][v]))
                if (!vis[v]) {
                    vis[v] = 1, q.push(v);
                    if ((cnt[v] = cnt[u] + 1) >= n) return 1;
                }
    }
    return 0;
}

int main()
{
#ifdef hany01
    freopen("bzoj5367.in", "r", stdin);
    freopen("bzoj5367.out", "w", stdout);
#endif

    static int uu, vv, l, r, mid; Set(dis, 63);

    n = read(), m = read(), k = read();
    For(i, 1, n) For(j, 1, k) in[i][j] = read(), chkmax(r, out[i][j] = read());
    For(i, 1, m) uu = read(), vv = read(), dis[uu][vv] = read();

    For(k, 1, n) For(i, 1, n) For(j, 1, n)
        chkmin(dis[i][j], dis[i][k] + dis[k][j]);
    For(l, 1, n) For(r, 1, n) For(i, 1, k)
        if (in[l][i] != -1 && out[r][i] != -1)
            chkmax(ben[l][r], out[r][i] - in[l][i]);

    while (l < r) {
        mid = (l + r + 1) >> 1;
        if (SPFA(mid)) l = mid; else r = mid - 1;
    }
    printf("%d\n", l);

    return 0;
}