# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84245 | shoemakerjo | Travelling Merchant (APIO17_merchant) | C++14 | 38 ms | 3452 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;
#define ll long long
#define pll pair<ll, ll>
#define maxn 101
#define maxk 1010
int N, M, K;
const ll inf = 1LL << 61;
ll dist[maxn][maxn];
ll buy[maxn][maxk];
ll sell[maxn][maxk];
pll prof[maxn][maxn];
bool isless(pll u, pll v) {
if (u.first == 0 && u.second == 0) return true;
return u.first*1.0/u.second < v.first*1.0/v.second;
}
bool isgreater(pll u, pll v) {
return u.first*1.0/u.second > v.first*1.0/v.second;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M >> K;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
# | 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... |