| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 252881 | khangal | 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll sz,n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<ll> v[1234567];
vl vec;
ll C[123][1234][2],D[123][123],c1[123][123];
ll B[123][1234],S[123][1234];
ll N,M,K;
bool f(ll val){
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
D[i][j] = -INF;
if(c1[i][j] == 0 ) continue;
for(int k = 1;k<=K;k++){
if(B[i][k]==-1||S[j][k]==-1) continue;
D[i][j] = max(D[i][j],max(0ll,S[j][k]-B[i][k])-c1[i][j]*val);
}
}
}
for(int k=1;k<=N;k++){
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
D[i][j] = max(D[i][j],D[i][k]+D[k][j]);
}
}
}
for(int i=1;i<=N;i++){
if(D[i][i]>=0) return true;
}
return false;
}
int main(){
cin>>N>>M>>K;
rep(i,1,N){
rep(j,1,K){
cin>>x>>y;
B[i][j]=x;
S[i][j]=y;
}
}
rep(i,1,M){
cin>>x>>y>>z;
c1[x][y]=z;
}
l=0;
r=MAX;
ans = 0;
while(l <= r){
ll mid=(l+r)/2;
if(check(mid)==1){
ans = mid;
l = mid+1;
}
else{
r = mid-1;
}
}
cout<<ans;
}