| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 59118 | wilwxk | Travelling Merchant (APIO17_merchant) | C++11 | 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>
using namespace std;
const int MAXN=105;
const int MAXK=1005;
const long long INF=1e15+9;
long long v[MAXN][MAXK][2];
long long dist[MAXN][MAXN], prof[MAXN][MAXN];
long long g[MAXN][MAXN];
int n, m, k;
void floyd() {
for(int kk=1; kk<=n; kk++) {
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
dist[i][j]=min(dist[i][j], dist[i][kk]+dist[kk][j]);
}
}
}
}
bool testa(long long x) {
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) g[i][j]=INF;
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
if(dist[i][j]==INF||i==j) continue;
g[i][j]=(x*dist[i][j])-prof[i][j];
}
}
for(int kk=1; kk<=n; kk++) {
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
g[i][j]=min(g[i][j], g[i][kk]+g[kk][j]);
}
}
}
for(int i=1; i<=n; i++) if(g[i][i]<=0) return 1;
return 0;
}
int main() {
scanf("%d %d %d", &n, &m, &k);
for(int i=1; i<=n; i++) for(int j=1; j<=k; j++) scanf("%lld %lld", &v[i][j][0], &v[i][j][1]);
for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) dist[i][j]=INF;
while(m--) { int a, b, c; scanf("%d %d %d", &a, &b, &c); dist[a][b]=min(dist[a][b], c); }
floyd();
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
for(int kk=1; kk<=k; kk++) {
prof[i][j]=0; if(dist[i][j]==INF) continue;
if(v[i][kk][0]==-1||v[j][kk][1]==-1||v[j][kk][1]<v[i][kk][0]) continue;
prof[i][j]=max(prof[i][j], v[j][kk][1]-v[i][kk][0]);
}
}
}
long long resp=0;
for(long long i=1e12; i>0; i/=2) while(testa(resp+i)) {
resp+=i; //printf("foi %lld\n", resp);
}
printf("%lld\n", resp);
}
