# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
57828 | Jeez | Travelling Merchant (APIO17_merchant) | C++14 | 99 ms | 2168 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>
using namespace std;
typedef long long ll;
const ll INF = 1e10;
const int MAX_N = 100 + 9;
const int MAX_K = 1000 + 9;
int n, m, K;
ll buy[MAX_N][MAX_K], sell[MAX_N][MAX_K];
ll w[MAX_N][MAX_N], dist[MAX_N][MAX_N], profit[MAX_N][MAX_N];
ll g[MAX_N][MAX_N], g2[MAX_N][MAX_N];
void read(){
cin >> n >> m >> K;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= K; j++)
cin >> buy[i][j] >> sell[i][j];
for(int i = 0; i < m; i++){
int u, v;
ll w;
cin >> u >> v >> w;
dist[u][v] = w;
}
}
void init(){
for(int i = 1; i < MAX_N; i++)
for(int j = 1; j < MAX_N; j++)
dist[i][j] = INF;
}
# | 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... |