Address
洛谷P3778
BZOJ4898
BZOJ5367
LOJ#2308
Solution
看到最优化目标是分数,显然二分答案
m
i
d
mid
mid ,判断是否有一个环满足:
收
益
长
度
≥
m
i
d
\frac{收益}{长度}\ge mid
长度收益≥mid
也就是:
收
益
−
长
度
×
m
i
d
≥
0
收益-长度\times mid\ge 0
收益−长度×mid≥0
先预处理出对于任意一个有序点对
(
u
,
v
)
(u,v)
(u,v) ,在
u
u
u 买入一种物品并在
v
v
v 卖出该物品的最大收入(如果无法盈利则为
0
0
0 )
a
d
d
s
[
u
]
[
v
]
adds[u][v]
adds[u][v] 。
用 Floyd 预处理出任意两点间最短路
f
[
u
]
[
v
]
f[u][v]
f[u][v] 。
二分判定时建一个新图,对于一个有序点对
(
u
,
v
)
(u,v)
(u,v) ,如果
u
u
u 到
v
v
v 有路径,则在新图上连边
(
u
,
v
)
(u,v)
(u,v) ,权为
a
d
d
s
[
u
]
[
v
]
−
f
[
u
]
[
v
]
×
m
i
d
adds[u][v]-f[u][v]\times mid
adds[u][v]−f[u][v]×mid 。
然后 SPFA 跑最长路,判定是否有非负权环。
如果有非负环则答案
≥
m
i
d
\ge mid
≥mid ,反之答案
<
m
i
d
<mid
<mid 。
注:答案保留整数,所以一定要用整数二分,用实数二分可能会有 1 到 2 个点炸精度。
Code
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define For(i, a, b) for (i = a; i <= b; i++)
#define Edge(u) for (int e = adj[u], v = go[e]; e; e = nxt[e], v = go[e])
inline int read()
{
int res = 0; bool bo = 0; char c;
while (((c = getchar()) < '0' || c > '9') && c != '-');
if (c == '-') bo = 1; else res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
return bo ? ~res + 1 : res;
}
template <class T>
T Max(T a, T b) {return a > b ? a : b;}
template <class T>
T Min(T a, T b) {return a < b ? a : b;}
typedef long long ll;
const int N = 105, M = 1e4 + 5, E = 1005;
const ll INF = (((1ll << 62) - 1 << 1) + 1) / 3;
int n, m, K, B[N][E], S[N][E], adds[N][N], len[N][N], ecnt,
nxt[M], adj[N], go[M], cnt[N];
ll val[M], f[N][N], dis[N];
bool vis[N];
std::queue<int> q;
void add_edge(int u, int v, ll w)
{
nxt[++ecnt] = adj[u]; adj[u] = ecnt; go[ecnt] = v; val[ecnt] = w;
}
bool spfa()
{
int i;
For (i, 1, n) dis[i] = 0;
while (!q.empty()) q.pop();
For (i, 1, n) q.push(i), vis[i] = 1, cnt[i] = 0;
while (!q.empty())
{
int u = q.front(); q.pop(); vis[u] = 0;
if ((++cnt[u]) > n) return 1;
Edge(u)
if (dis[u] + val[e] >= dis[v])
{
dis[v] = dis[u] + val[e];
if (!vis[v]) q.push(v), vis[v] = 1;
}
}
return 0;
}
bool check(int mid)
{
int i, j, k;
For (i, 1, n) For (j, 1, n)
if (len[i][j] != 0x3f3f3f3f) f[i][j] = 1ll * mid * len[i][j];
else f[i][j] = INF;
For (k, 1, n) For (i, 1, n) For (j, 1, n)
if (f[i][k] != INF && f[k][j] != INF)
f[i][j] = Min(f[i][j], f[i][k] + f[k][j]);
ecnt = 0;
For (i, 1, n) adj[i] = 0;
For (i, 1, n) For (j, 1, n) if (f[i][j] < INF)
add_edge(i, j, adds[i][j] - f[i][j]);
For (i, 1, n) dis[i] = 0, vis[i] = 0;
return spfa();
}
int main()
{
int i, j, k, x, y, z, l = 1, r = 1e9;
n = read(); m = read(); K = read();
For (i, 1, n) For (j, 1, K)
B[i][j] = read(), S[i][j] = read();
memset(len, 0x3f, sizeof(len));
For (i, 1, m) x = read(), y = read(), z = read(),
len[x][y] = Min(len[x][y], z);
For (i, 1, n) For (j, 1, n) For (k, 1, K)
if (S[j][k] != -1 && B[i][k] != -1)
adds[i][j] = Max(adds[i][j], S[j][k] - B[i][k]);
while (l <= r)
{
int mid = l + r >> 1;
if (check(mid)) l = mid + 1;
else r = mid - 1;
}
printf("%d\n", r);
return 0;
}