#include <iostream>
#include <cstring>
#define MAXN 103
#define MAXK 1003
const long long INF = 1e10;
using namespace std;
typedef long long ll;
int N , M , K , T[MAXN][MAXN] ;
long long profit[MAXN][MAXN] , adj[MAXN][MAXN] , B[MAXN][MAXN] , S[MAXN][MAXN] , dist[MAXN][MAXN];
bool check(int x){
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
if(i == j || dist[i][j] == INF){adj[i][j] = -INF; continue;}
adj[i][j] = (ll)profit[i][j] - (ll)dist[i][j]*x;
adj[i][j] = max(-INF, adj[i][j]);
}
}
for(int k=1; k<=N; k++)
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++){
adj[i][j] = max(adj[i][j] , adj[i][k] + adj[k][j]);
if(adj[i][i] >= 0) return true;
}
/*cout << endl;
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++)
cout << adj[i][j] << " " ;
cout << endl;
}
cout << endl;*/
for(int k=1; k<=N; k++)
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++)
if(adj[i][k] + adj[k][j] + adj[j][i] >= 0) return true;
return false;
}
int main(){
cin >> N >> M >> K;
for(int i=1; i<=N; i++)
for(int k=0; k<K; k++) cin >> B[i][k] >> S[i][k];
for(int i=0; i<=N; i++)
for(int j=0; j<=N; j++) dist[i][j] = INF;
for(int i=1; i<=N; i++) dist[i][i] = 0;
for(int i=0; i<M; i++){
int u,v; cin >> u >> v;
cin >> dist[u][v];
}
for(int k=1; k<=N; k++)
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++)
dist[i][j] = min(dist[i][j] , dist[i][k] + dist[k][j]);
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++){
profit[i][j] = 0;
for(int k=0; k<K; k++){
if(B[i][k] == -1 || S[j][k] == -1) continue;
profit[i][j] = max(profit[i][j] , S[j][k] - B[i][k]);
}
}
/*for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++)
cout << dist[i][j] << " " ;
cout << endl;
}*/
long long low = 0 , high = 1e9 + 1 , ANS = 0;
while(low <= high){
ll mid = (low + high)/2;
//cout << low << " " << mid << " " << high << endl;
if(check(mid)) {ANS = max(ANS , mid); low = mid + 1;}
else high = mid - 1;
}
cout << ANS << endl;
return 0;
}
Compilation message
merchant.c:1:10: fatal error: iostream: No such file or directory
#include <iostream>
^~~~~~~~~~
compilation terminated.
