# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309796 | vipghn2003 | Travelling Merchant (APIO17_merchant) | C++14 | 259 ms | 2296 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>
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N=105;
const int K=1005;
int n,m,k,d[N][N],buy[N][K],sell[N][K],opt[N][N],w[N][N];
bool check(int lim)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
w[i][j]=-1e18;
for(int u=1;u<=n;u++)
{
if(d[i][u]==-1||d[u][j]==-1) continue;
int dist=d[i][u]+d[u][j];
int gain=opt[u][j];
w[i][j]=max(w[i][j],gain-dist*lim);
}
}
}
for(int k=1;k<=n;k++)
{
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... |