# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77952 | aquablitz11 | Travelling Merchant (APIO17_merchant) | C++14 | 105 ms | 5904 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>
using namespace std;
using ll = long long;
const int N = 110;
const int T = 1010;
const ll INF = 1e18;
int n, m, t;
int B[N][T], S[N][T];
ll pro[N][N], dist[N][N], A[N][N];
bool check(ll r)
{
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
A[i][j] = pro[i][j]-dist[i][j]*r;
A[i][i] = -INF;
}
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
A[i][j] = max(A[i][j], A[i][k]+A[k][j]);
}
}
for (int i = 1; i <= n; ++i) {
if (A[i][i] >= 0)
return true;
}
return false;
}
int main()
{
scanf("%d%d%d", &n, &m, &t);
for (int i = 1; i <= n; ++i) {
dist[i][i] = 0;
for (int j = 1; j <= t; ++j)
scanf("%d%d", &B[i][j], &S[i][j]);
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
dist[i][j] = INF;
for (int k = 1; k <= t; ++k) {
if (B[i][k] != -1 && S[j][k] != -1)
pro[i][j] = max(pro[i][j], (ll)S[j][k]-B[i][k]);
}
}
dist[i][i] = 0;
}
for (int i = 1; i <= m; ++i) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
dist[u][v] = w;
}
for (int k = 1; k <= n; ++k) {
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
}
}
ll b = 0, e = 1e9;
while (b < e) {
ll m = (b+e+1)/2;
if (check(m))
b = m;
else
e = m-1;
}
printf("%lld\n", b);
return 0;
}
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... |