# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
454565 | sean617 | Travelling Merchant (APIO17_merchant) | C++98 | 505 ms | 4168 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 <iostream>
#include <cstdio>
#include <vector>
#define N 105
using namespace std;
typedef long long ll;
ll n, m, k, tc, M = 1e16, mx, B[N][1005], S[N][1005], di[N][N], ds[N], dt[N];
struct str {
ll z, c1, c2;
};
bool operator < (str p, str q) {
return p.c1 * q.c2 < q.c1 * p.c2;
}
vector<str> a;
int main()
{
ll i, j, t1, t2, t3, kk, us, ut;
str t;
cin >> n >> m >> k;
for (i = 1; i <= n; i++) {
for (j = 1; j <= k; j++) {
scanf ("%lld %lld", &B[i][j], &S[i][j]);
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
di[i][j] = M;
}
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... |