# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49584 | model_code | Travelling Merchant (APIO17_merchant) | C++17 | 177 ms | 2556 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
template<typename T> void domax(T &a, T b) { if (b > a) a = b; }
template<typename T> void domin(T &a, T b) { if (b < a) a = b; }
const long long inf = 3e18, MaxT = 10ll*1000*1000;
const int MaxN = 105, MaxK = 1005;
int n, m, K;
long long b[MaxN][MaxK], s[MaxN][MaxK], dist[MaxN][MaxN], best[MaxN][MaxN], cost[MaxN][MaxN];
bool can(long long eff) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (dist[i][j] < inf) {
assert(dist[i][j] <= 1000ll*1000*1000); // MaxT * MaxN
assert(eff <= 1000ll*1000*1000 + 1);
cost[i][j] = dist[i][j] * eff - best[i][j];
assert(-1000ll*1000*1000 <= cost[i][j]);
assert(cost[i][j] <= (1000*1000*1000ll + 1) * 1000ll*1000*1000);
} else {
cost[i][j] = inf;
}
}
}
for (int m = 0; m < n; m++) {
for (int s = 0; s < n; s++) {
for (int e = 0; e < n; e++) {
domin(cost[s][e], cost[s][m] + cost[m][e]);
if (cost[s][e] < -inf) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |