| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 409264 | CursedCode | Travelling Merchant (APIO17_merchant) | C++14 | 0 ms | 0 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
using namespace std;
long long n,m,k;
long long buy[105][1005],sell[105][1005];
long long adj[105][105],aral[105][105];
long long setup[105][105];
const long long inf=10e9;
int main(){
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 = 1;i <= n;i++){
for(int j = 1;j <= n;j++) adj[i][j] = inf;
}
for(int i = 1;i <= m;i++){
long long u,v,w;
cin >> u >> v >> w;
adj[u][v] = w;
}
for(int l = 1;l <= n;l++){
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
adj[i][j] = min(adj[i][j] , adj[i][l] + adj[l][j]);
}
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(adj[i][j] >= inf){
setup[i][j] =- inf;
continue;
}
for(int cnt = 1;cnt <= k;cnt++){
if(sell[j][cnt] == -1 || buy[i][cnt] == -1) continue;
setup[i][j] = max(setup[i][j] , sell[j][cnt] - buy[i][cnt]);
}
}
}
long long lower=0,higher=inf;
while(lower<higher){
long long mid = (lower + higher + 1) / 2;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(adj[i][j] >= inf) aral[i][j] = -inf;
else aral[i][j] = setup[i][j] - mid * adj[i][j];
}
}
for(int l=1;l<=n;l++){
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(adj[i][l] >= inf || adj[j][l] >= inf) continue;
aral[i][j] = max(aral[i][j] , aral[i][l] + aral[l][j]);
}
}
}
bool check = false;
for(int i = 1;i <= n;i++){
if(aral[i][i] >= 0){
check = true;
break;
}
}
if(check) lower=mid;
else higher=mid-1;
}
cout<<lower<<endl;
}