#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
const ll INF = LLONG_MAX / 2;
int n, m, x;
ll b[101][1001], s[101][1001];
ll graph[101][101], profit[101][101], graph2[101][101];
void floyd_warshall(ll adj[101][101]) {
FOR(i, 1, n + 1)
FOR(j, 1, n + 1)
FOR(k, 1, n + 1)
adj[j][k] = min(adj[j][k], adj[j][i] + adj[i][k]);
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> x;
FOR(i, 1, n + 1) {
FOR(j, 1, n + 1) graph[i][j] = INF;
FOR(j, 1, x + 1) cin >> b[i][j] >> s[i][j];
}
FOR(i, 1, n + 1) FOR(j, 1, n + 1) FOR(k, 1, x + 1)
if (s[j][k] != -1 && b[i][k] != -1)
profit[i][j] = max(profit[i][j], s[j][k] - b[i][k]);
FOR(i, 0, m) {
int u, v, w;
cin >> u >> v >> w;
graph[u][v] = w;
}
floyd_warshall(graph);
ll l = 1, r = 1e9;
while (l <= r) {
ll mid = (l + r) / 2;
FOR(i, 1, n + 1) FOR(j, 1, n + 1)
graph2[i][j] = mid * min(graph[i][j], INF / mid) - profit[i][j];
floyd_warshall(graph2);
bool has_nonnegative_cycle = false;
FOR(i, 1, n + 1) if (graph2[i][i] <= 0) has_nonnegative_cycle = true;
if (has_nonnegative_cycle) l = mid + 1;
else r = mid - 1;
}
cout << r;
return 0;
}
Compilation message
merchant.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
#pragma GCC Optimize("O3")
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
72 ms |
2168 KB |
Output is correct |
2 |
Correct |
39 ms |
1272 KB |
Output is correct |
3 |
Correct |
40 ms |
1276 KB |
Output is correct |
4 |
Correct |
8 ms |
760 KB |
Output is correct |
5 |
Correct |
8 ms |
888 KB |
Output is correct |
6 |
Correct |
8 ms |
888 KB |
Output is correct |
7 |
Correct |
9 ms |
888 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
9 ms |
760 KB |
Output is correct |
10 |
Correct |
9 ms |
888 KB |
Output is correct |
11 |
Correct |
8 ms |
888 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
9 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
888 KB |
Output is correct |
2 |
Correct |
8 ms |
892 KB |
Output is correct |
3 |
Correct |
9 ms |
988 KB |
Output is correct |
4 |
Correct |
8 ms |
888 KB |
Output is correct |
5 |
Correct |
9 ms |
1016 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
8 ms |
888 KB |
Output is correct |
8 |
Correct |
9 ms |
888 KB |
Output is correct |
9 |
Correct |
9 ms |
888 KB |
Output is correct |
10 |
Correct |
8 ms |
888 KB |
Output is correct |
11 |
Correct |
10 ms |
1016 KB |
Output is correct |
12 |
Correct |
9 ms |
888 KB |
Output is correct |
13 |
Correct |
9 ms |
888 KB |
Output is correct |
14 |
Correct |
8 ms |
888 KB |
Output is correct |
15 |
Correct |
10 ms |
1016 KB |
Output is correct |
16 |
Correct |
8 ms |
888 KB |
Output is correct |
17 |
Correct |
9 ms |
888 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
9 ms |
888 KB |
Output is correct |
20 |
Correct |
9 ms |
888 KB |
Output is correct |
21 |
Correct |
9 ms |
956 KB |
Output is correct |
22 |
Correct |
8 ms |
888 KB |
Output is correct |
23 |
Correct |
8 ms |
888 KB |
Output is correct |
24 |
Correct |
8 ms |
888 KB |
Output is correct |
25 |
Correct |
9 ms |
888 KB |
Output is correct |
26 |
Correct |
2 ms |
376 KB |
Output is correct |
27 |
Correct |
9 ms |
760 KB |
Output is correct |
28 |
Correct |
9 ms |
888 KB |
Output is correct |
29 |
Correct |
8 ms |
888 KB |
Output is correct |
30 |
Correct |
2 ms |
376 KB |
Output is correct |
31 |
Correct |
9 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
1580 KB |
Output is correct |
2 |
Correct |
94 ms |
2168 KB |
Output is correct |
3 |
Correct |
43 ms |
1528 KB |
Output is correct |
4 |
Correct |
47 ms |
1528 KB |
Output is correct |
5 |
Correct |
46 ms |
1528 KB |
Output is correct |
6 |
Correct |
43 ms |
1400 KB |
Output is correct |
7 |
Correct |
9 ms |
888 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
9 ms |
888 KB |
Output is correct |
10 |
Correct |
9 ms |
888 KB |
Output is correct |
11 |
Correct |
9 ms |
956 KB |
Output is correct |
12 |
Correct |
8 ms |
888 KB |
Output is correct |
13 |
Correct |
8 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
888 KB |
Output is correct |
2 |
Correct |
8 ms |
892 KB |
Output is correct |
3 |
Correct |
9 ms |
988 KB |
Output is correct |
4 |
Correct |
8 ms |
888 KB |
Output is correct |
5 |
Correct |
9 ms |
1016 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
8 ms |
888 KB |
Output is correct |
8 |
Correct |
9 ms |
888 KB |
Output is correct |
9 |
Correct |
9 ms |
888 KB |
Output is correct |
10 |
Correct |
8 ms |
888 KB |
Output is correct |
11 |
Correct |
10 ms |
1016 KB |
Output is correct |
12 |
Correct |
9 ms |
888 KB |
Output is correct |
13 |
Correct |
9 ms |
888 KB |
Output is correct |
14 |
Correct |
8 ms |
888 KB |
Output is correct |
15 |
Correct |
10 ms |
1016 KB |
Output is correct |
16 |
Correct |
8 ms |
888 KB |
Output is correct |
17 |
Correct |
46 ms |
1580 KB |
Output is correct |
18 |
Correct |
94 ms |
2168 KB |
Output is correct |
19 |
Correct |
43 ms |
1528 KB |
Output is correct |
20 |
Correct |
47 ms |
1528 KB |
Output is correct |
21 |
Correct |
46 ms |
1528 KB |
Output is correct |
22 |
Correct |
43 ms |
1400 KB |
Output is correct |
23 |
Correct |
9 ms |
888 KB |
Output is correct |
24 |
Correct |
2 ms |
376 KB |
Output is correct |
25 |
Correct |
9 ms |
888 KB |
Output is correct |
26 |
Correct |
9 ms |
888 KB |
Output is correct |
27 |
Correct |
9 ms |
956 KB |
Output is correct |
28 |
Correct |
8 ms |
888 KB |
Output is correct |
29 |
Correct |
8 ms |
888 KB |
Output is correct |
30 |
Correct |
41 ms |
1468 KB |
Output is correct |
31 |
Correct |
44 ms |
1656 KB |
Output is correct |
32 |
Correct |
63 ms |
2552 KB |
Output is correct |
33 |
Correct |
43 ms |
1528 KB |
Output is correct |
34 |
Correct |
44 ms |
1656 KB |
Output is correct |
35 |
Correct |
44 ms |
1656 KB |
Output is correct |
36 |
Correct |
101 ms |
4088 KB |
Output is correct |
37 |
Correct |
3 ms |
376 KB |
Output is correct |
38 |
Correct |
2 ms |
504 KB |
Output is correct |
39 |
Correct |
41 ms |
1400 KB |
Output is correct |
40 |
Correct |
44 ms |
1528 KB |
Output is correct |
41 |
Correct |
42 ms |
1528 KB |
Output is correct |
42 |
Correct |
42 ms |
1400 KB |
Output is correct |
43 |
Correct |
42 ms |
1400 KB |
Output is correct |
44 |
Correct |
3 ms |
380 KB |
Output is correct |
45 |
Correct |
11 ms |
1020 KB |
Output is correct |
46 |
Correct |
10 ms |
1016 KB |
Output is correct |
47 |
Correct |
10 ms |
1016 KB |
Output is correct |
48 |
Correct |
104 ms |
4268 KB |
Output is correct |
49 |
Correct |
103 ms |
4188 KB |
Output is correct |
50 |
Correct |
2 ms |
376 KB |
Output is correct |
51 |
Correct |
72 ms |
2168 KB |
Output is correct |
52 |
Correct |
39 ms |
1272 KB |
Output is correct |
53 |
Correct |
40 ms |
1276 KB |
Output is correct |
54 |
Correct |
8 ms |
760 KB |
Output is correct |
55 |
Correct |
8 ms |
888 KB |
Output is correct |
56 |
Correct |
8 ms |
888 KB |
Output is correct |
57 |
Correct |
9 ms |
888 KB |
Output is correct |
58 |
Correct |
2 ms |
376 KB |
Output is correct |
59 |
Correct |
9 ms |
760 KB |
Output is correct |
60 |
Correct |
9 ms |
888 KB |
Output is correct |
61 |
Correct |
8 ms |
888 KB |
Output is correct |
62 |
Correct |
2 ms |
376 KB |
Output is correct |
63 |
Correct |
9 ms |
888 KB |
Output is correct |