# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59132 | wilwxk | Travelling Merchant (APIO17_merchant) | C++11 | 188 ms | 13148 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;
const int MAXN=105;
const int MAXK=1005;
const long long INF=1e15+9;
long long v[MAXN][MAXK][2];
long long dist[MAXN][MAXN], prof[MAXN][MAXN];
long long g[MAXN][MAXN];
bool chega[MAXN][MAXN];
int n, m, k;
void floyd() {
for(int kk=1; kk<=n; kk++) {
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
if(chega[i][kk]==0||chega[kk][j]==0) continue;
dist[i][j]=min(dist[i][j], dist[i][kk]+dist[kk][j]);
chega[i][j]=1;
}
}
}
}
bool testa(long long x) {
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
if(chega[i][j]==0) continue;
g[i][j]=(x*dist[i][j])-prof[i][j];
}
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... |