# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59365 | duality | Travelling Merchant (APIO17_merchant) | C++11 | 121 ms | 9796 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 pb push_back
#define mp make_pair
typedef long long int LLI;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
int B[100][1000],S[100][1000];
int dist[100][100],profit[100][100];
LLI dist2[100][100];
int main() {
int i,j;
int N,M,K;
int u,v,t;
scanf("%d %d %d",&N,&M,&K);
for (i = 0; i < N; i++) {
for (j = 0; j < K; j++) scanf("%d %d",&B[i][j],&S[i][j]);
}
for (i = 0; i < N; i++) fill(dist[i],dist[i]+N,1e9);
for (i = 0; i < M; i++) {
scanf("%d %d %d",&u,&v,&t);
u--,v--;
dist[u][v] = min(dist[u][v],t);
}
int k;
for (k = 0; k < N; k++) {
for (i = 0; i < N; i++) {
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... |