#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
int n, m, K;
ll d[200][200], a[200][200];
int b[200][2000], s[200][2000];
bool C(ll t) {
rep(i, n) rep(j, n) a[i][j] = -INF;
rep(i, n) rep(j, n) {
if (i == j || d[i][j] == INF)
continue;
a[i][j] = -t * d[i][j];
rep(k, K) {
if (b[i][k] == -1 || s[j][k] == -1)
continue;
a[i][j] = max(a[i][j], s[j][k] - b[i][k] - t * d[i][j]);
}
}
rep(k, n) rep(i, n) rep(j, n) { a[i][j] = max(a[i][j], a[i][k] + a[k][j]); }
rep(i, n) {
if (a[i][i] >= 0)
return true;
}
return false;
}
int main() {
cin >> n >> m >> K;
rep(i, n) rep(j, K) scanf("%d%d", &b[i][j], &s[i][j]);
memset(d, 0x3f, sizeof(d));
rep(i, n) d[i][i] = 0;
rep(i, m) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
a--;
b--;
d[a][b] = c;
}
rep(k, n) rep(i, n) rep(j, n) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); }
ll l = 0, r = INT_MAX;
while (r - l > 1) {
ll t = (l + r) / 2;
if (C(t))
l = t;
else
r = t;
}
cout << l << endl;
return 0;
}
Compilation message
merchant.cpp: In function 'int main()':
merchant.cpp:32:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
32 | rep(i, n) rep(j, K) scanf("%d%d", &b[i][j], &s[i][j]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
37 | scanf("%d%d%d", &a, &b, &c);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
367 ms |
2808 KB |
Output is correct |
| 2 |
Correct |
40 ms |
1536 KB |
Output is correct |
| 3 |
Correct |
45 ms |
1536 KB |
Output is correct |
| 4 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 5 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 6 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 7 |
Correct |
13 ms |
1152 KB |
Output is correct |
| 8 |
Correct |
1 ms |
640 KB |
Output is correct |
| 9 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 10 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 11 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 12 |
Correct |
1 ms |
768 KB |
Output is correct |
| 13 |
Correct |
10 ms |
1152 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 3 |
Correct |
12 ms |
1152 KB |
Output is correct |
| 4 |
Correct |
12 ms |
1152 KB |
Output is correct |
| 5 |
Correct |
21 ms |
1152 KB |
Output is correct |
| 6 |
Correct |
1 ms |
640 KB |
Output is correct |
| 7 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 8 |
Correct |
12 ms |
1152 KB |
Output is correct |
| 9 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 10 |
Correct |
11 ms |
1156 KB |
Output is correct |
| 11 |
Correct |
23 ms |
1152 KB |
Output is correct |
| 12 |
Correct |
20 ms |
1152 KB |
Output is correct |
| 13 |
Correct |
9 ms |
1152 KB |
Output is correct |
| 14 |
Correct |
13 ms |
1152 KB |
Output is correct |
| 15 |
Correct |
22 ms |
1152 KB |
Output is correct |
| 16 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 17 |
Correct |
21 ms |
1152 KB |
Output is correct |
| 18 |
Correct |
1 ms |
640 KB |
Output is correct |
| 19 |
Correct |
22 ms |
1152 KB |
Output is correct |
| 20 |
Correct |
24 ms |
1152 KB |
Output is correct |
| 21 |
Correct |
17 ms |
1152 KB |
Output is correct |
| 22 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 23 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 24 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 25 |
Correct |
13 ms |
1152 KB |
Output is correct |
| 26 |
Correct |
1 ms |
640 KB |
Output is correct |
| 27 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 28 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 29 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 30 |
Correct |
1 ms |
768 KB |
Output is correct |
| 31 |
Correct |
10 ms |
1152 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
176 ms |
1912 KB |
Output is correct |
| 2 |
Execution timed out |
1094 ms |
2680 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 3 |
Correct |
12 ms |
1152 KB |
Output is correct |
| 4 |
Correct |
12 ms |
1152 KB |
Output is correct |
| 5 |
Correct |
21 ms |
1152 KB |
Output is correct |
| 6 |
Correct |
1 ms |
640 KB |
Output is correct |
| 7 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 8 |
Correct |
12 ms |
1152 KB |
Output is correct |
| 9 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 10 |
Correct |
11 ms |
1156 KB |
Output is correct |
| 11 |
Correct |
23 ms |
1152 KB |
Output is correct |
| 12 |
Correct |
20 ms |
1152 KB |
Output is correct |
| 13 |
Correct |
9 ms |
1152 KB |
Output is correct |
| 14 |
Correct |
13 ms |
1152 KB |
Output is correct |
| 15 |
Correct |
22 ms |
1152 KB |
Output is correct |
| 16 |
Correct |
8 ms |
1152 KB |
Output is correct |
| 17 |
Correct |
176 ms |
1912 KB |
Output is correct |
| 18 |
Execution timed out |
1094 ms |
2680 KB |
Time limit exceeded |
| 19 |
Halted |
0 ms |
0 KB |
- |
