# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567731 | shahriarkhan | Travelling Merchant (APIO17_merchant) | C++14 | 1094 ms | 4116 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 ;
const int MX_N = 105 , MX_K = 1005 ;
const long long INF = 1e18 + 5 ;
int n , m , k ;
long long dist[MX_N][MX_N] , best[MX_N][MX_N] , buy[MX_N][MX_K] , sell[MX_N][MX_K] , profit[MX_N][MX_N] ;
void floyd_warshall(long long dst[MX_N][MX_N])
{
for(int l = 1 ; l <= n ; ++l)
{
for(int i = 1 ; i <= n ; ++i)
{
for(int j = 1 ; j <= n ; ++j)
{
dst[i][j] = min(dst[i][j],dst[i][l]+dst[l][j]) ;
}
}
}
}
int main()
{
scanf("%d%d%d",&n,&m,&k) ;
for(int i = 1 ; 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... |