//
// APIO17_MERCHANT.cpp
//
//
// Created by Matjaz Leonardis on 22/03/2024.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N,M,K;
long long INF = (1LL<<39);
// If we buy something at u and go to v there will be the perfect item for that and we can take the shortest path there.
int main(){
cin >> N >> M >> K;
vector<vector<int> > B(N, vector<int> (K));
vector<vector<int> > S(N, vector<int> (K));
for (int i=0;i<N;i++){
for (int j=0;j<K;j++) cin >> B[i][j] >> S[i][j];
}
vector<vector<long long> > dist(N, vector<long long>(N, INF));
for (int i=0;i<M;i++){
int V,W,T;
cin >> V >> W >> T;
dist[V - 1][W - 1] = T;
}
for (int k=0;k<N;k++){
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
/*cout << "OG" << endl;
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) cout << dist[i][j] << " ";
cout << endl;
}
cout << endl; */
vector<vector<long long> > profit(N, vector<long long> (N));
for (int i=0;i<N;i++){
for (int j=0;j<N;j++){
for (int k=0;k<K;k++) if (B[i][k] >= 0) profit[i][j] = max(profit[i][j], (long long)S[j][k] - B[i][k]);
}
}
/*cout << "Profit" << endl;
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) cout << profit[i][j] << " ";
cout << endl;
}
cout << endl; */
long long best = 0;
long long l = 0;
long long u = 1e9;
while (l < u){
long long mid = l + (u - l + 1) / 2;
// Each new edge is profit[i][j] - mid * dist[i][j]
vector<vector<long long> > dist_tmp(N, vector<long long>(N, INF));
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) if (dist[i][j] < INF) dist_tmp[i][j] = mid * dist[i][j] - profit[i][j]; // Do we get any blow ups here?
}
/* cout << mid << endl;
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) cout << dist_tmp[i][j] << " ";
cout << endl;
}
cout << endl; */
for (int k=0;k<N;k++){
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) dist_tmp[i][j] = min(dist_tmp[i][j],dist_tmp[i][k] + dist_tmp[k][j]);
}
}
/*cout << mid << endl;
for (int i=0;i<N;i++){
for (int j=0;j<N;j++) cout << dist_tmp[i][j] << " ";
cout << endl;
}
cout << endl;*/
bool contains_cycle = false;
for (int i=0;i<N;i++) if (dist_tmp[i][i] <= 0) contains_cycle = true;
if (contains_cycle) l = mid; else u = mid - 1;
}
best = l;
cout << best << endl;
return 0;
}
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
72 ms |
1220 KB |
Output is correct |
2 |
Correct |
26 ms |
604 KB |
Output is correct |
3 |
Correct |
27 ms |
692 KB |
Output is correct |
4 |
Correct |
5 ms |
344 KB |
Output is correct |
5 |
Correct |
5 ms |
348 KB |
Output is correct |
6 |
Correct |
3 ms |
348 KB |
Output is correct |
7 |
Correct |
6 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
4 ms |
348 KB |
Output is correct |
10 |
Correct |
4 ms |
348 KB |
Output is correct |
11 |
Correct |
4 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
5 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
348 KB |
Output is correct |
2 |
Correct |
6 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
4 ms |
348 KB |
Output is correct |
5 |
Correct |
4 ms |
348 KB |
Output is correct |
6 |
Correct |
4 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
5 ms |
344 KB |
Output is correct |
9 |
Correct |
4 ms |
348 KB |
Output is correct |
10 |
Correct |
4 ms |
348 KB |
Output is correct |
11 |
Correct |
5 ms |
468 KB |
Output is correct |
12 |
Correct |
4 ms |
348 KB |
Output is correct |
13 |
Correct |
5 ms |
568 KB |
Output is correct |
14 |
Correct |
1 ms |
856 KB |
Output is correct |
15 |
Correct |
5 ms |
516 KB |
Output is correct |
16 |
Correct |
4 ms |
348 KB |
Output is correct |
17 |
Correct |
4 ms |
348 KB |
Output is correct |
18 |
Correct |
4 ms |
600 KB |
Output is correct |
19 |
Correct |
5 ms |
348 KB |
Output is correct |
20 |
Correct |
5 ms |
352 KB |
Output is correct |
21 |
Correct |
6 ms |
480 KB |
Output is correct |
22 |
Correct |
4 ms |
464 KB |
Output is correct |
23 |
Correct |
6 ms |
348 KB |
Output is correct |
24 |
Correct |
4 ms |
352 KB |
Output is correct |
25 |
Correct |
5 ms |
352 KB |
Output is correct |
26 |
Correct |
0 ms |
352 KB |
Output is correct |
27 |
Correct |
6 ms |
528 KB |
Output is correct |
28 |
Correct |
5 ms |
528 KB |
Output is correct |
29 |
Correct |
7 ms |
608 KB |
Output is correct |
30 |
Correct |
4 ms |
352 KB |
Output is correct |
31 |
Correct |
4 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
352 KB |
Output is correct |
2 |
Correct |
0 ms |
352 KB |
Output is correct |
3 |
Correct |
6 ms |
528 KB |
Output is correct |
4 |
Correct |
5 ms |
528 KB |
Output is correct |
5 |
Correct |
7 ms |
608 KB |
Output is correct |
6 |
Correct |
4 ms |
352 KB |
Output is correct |
7 |
Correct |
4 ms |
352 KB |
Output is correct |
8 |
Correct |
34 ms |
608 KB |
Output is correct |
9 |
Correct |
103 ms |
1280 KB |
Output is correct |
10 |
Correct |
31 ms |
600 KB |
Output is correct |
11 |
Correct |
35 ms |
604 KB |
Output is correct |
12 |
Correct |
41 ms |
848 KB |
Output is correct |
13 |
Correct |
30 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
348 KB |
Output is correct |
2 |
Correct |
4 ms |
348 KB |
Output is correct |
3 |
Correct |
5 ms |
468 KB |
Output is correct |
4 |
Correct |
4 ms |
348 KB |
Output is correct |
5 |
Correct |
5 ms |
568 KB |
Output is correct |
6 |
Correct |
1 ms |
856 KB |
Output is correct |
7 |
Correct |
5 ms |
516 KB |
Output is correct |
8 |
Correct |
4 ms |
348 KB |
Output is correct |
9 |
Correct |
4 ms |
348 KB |
Output is correct |
10 |
Correct |
4 ms |
600 KB |
Output is correct |
11 |
Correct |
5 ms |
348 KB |
Output is correct |
12 |
Correct |
5 ms |
352 KB |
Output is correct |
13 |
Correct |
6 ms |
480 KB |
Output is correct |
14 |
Correct |
4 ms |
464 KB |
Output is correct |
15 |
Correct |
6 ms |
348 KB |
Output is correct |
16 |
Correct |
4 ms |
352 KB |
Output is correct |
17 |
Correct |
34 ms |
608 KB |
Output is correct |
18 |
Correct |
103 ms |
1280 KB |
Output is correct |
19 |
Correct |
31 ms |
600 KB |
Output is correct |
20 |
Correct |
35 ms |
604 KB |
Output is correct |
21 |
Correct |
41 ms |
848 KB |
Output is correct |
22 |
Correct |
30 ms |
604 KB |
Output is correct |
23 |
Correct |
5 ms |
352 KB |
Output is correct |
24 |
Correct |
0 ms |
352 KB |
Output is correct |
25 |
Correct |
6 ms |
528 KB |
Output is correct |
26 |
Correct |
5 ms |
528 KB |
Output is correct |
27 |
Correct |
7 ms |
608 KB |
Output is correct |
28 |
Correct |
4 ms |
352 KB |
Output is correct |
29 |
Correct |
4 ms |
352 KB |
Output is correct |
30 |
Correct |
72 ms |
1220 KB |
Output is correct |
31 |
Correct |
26 ms |
604 KB |
Output is correct |
32 |
Correct |
27 ms |
692 KB |
Output is correct |
33 |
Correct |
5 ms |
344 KB |
Output is correct |
34 |
Correct |
5 ms |
348 KB |
Output is correct |
35 |
Correct |
3 ms |
348 KB |
Output is correct |
36 |
Correct |
6 ms |
348 KB |
Output is correct |
37 |
Correct |
0 ms |
348 KB |
Output is correct |
38 |
Correct |
4 ms |
348 KB |
Output is correct |
39 |
Correct |
4 ms |
348 KB |
Output is correct |
40 |
Correct |
4 ms |
348 KB |
Output is correct |
41 |
Correct |
1 ms |
348 KB |
Output is correct |
42 |
Correct |
5 ms |
344 KB |
Output is correct |
43 |
Correct |
28 ms |
600 KB |
Output is correct |
44 |
Correct |
31 ms |
600 KB |
Output is correct |
45 |
Correct |
54 ms |
1620 KB |
Output is correct |
46 |
Correct |
31 ms |
604 KB |
Output is correct |
47 |
Correct |
32 ms |
604 KB |
Output is correct |
48 |
Correct |
30 ms |
604 KB |
Output is correct |
49 |
Correct |
135 ms |
3364 KB |
Output is correct |
50 |
Correct |
0 ms |
348 KB |
Output is correct |
51 |
Correct |
0 ms |
436 KB |
Output is correct |
52 |
Correct |
27 ms |
600 KB |
Output is correct |
53 |
Correct |
31 ms |
604 KB |
Output is correct |
54 |
Correct |
29 ms |
604 KB |
Output is correct |
55 |
Correct |
28 ms |
604 KB |
Output is correct |
56 |
Correct |
39 ms |
720 KB |
Output is correct |
57 |
Correct |
0 ms |
348 KB |
Output is correct |
58 |
Correct |
7 ms |
640 KB |
Output is correct |
59 |
Correct |
7 ms |
448 KB |
Output is correct |
60 |
Correct |
7 ms |
604 KB |
Output is correct |
61 |
Correct |
114 ms |
3520 KB |
Output is correct |
62 |
Correct |
113 ms |
3368 KB |
Output is correct |
63 |
Correct |
0 ms |
348 KB |
Output is correct |