# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657544 | Alexandruabcde | Travelling Merchant (APIO17_merchant) | C++14 | 1065 ms | 3600 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;
typedef long long LL;
typedef pair <int, int> PII;
constexpr LL INF = 1LL * 1e15;
constexpr int NMAX = 102;
constexpr int KMAX = 1002;
int N, M, K;
LL dp[NMAX][KMAX];
int lg[NMAX][KMAX];
bool use[NMAX][KMAX];
LL B[NMAX][NMAX];
LL S[NMAX][NMAX];
vector <PII> G[NMAX];
void Read () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M >> K;
for (int i = 1; i <= N; ++ i )
for (int j = 1; j <= K; ++ j )
cin >> B[i][j] >> S[i][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... |