oj.uz

Submission #725839

# Submission time Handle Problem Language Result Execution time Memory
725839 2023-04-18T07:18:39 Z quiet_space Travelling Merchant (APIO17_merchant) C++14
100 / 100
 63 ms 3400 KB 
#include <bits/stdc++.h>
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
#define ROF(i,j,k) for(int i=j; i>=k; --i)
inline int read (void) {
  int x = 0, f = 1, ch = getchar();
  while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
  while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
  return x * f;
}
using ll = long long;
const int maxn = 105;
const int maxk = 1005;
int b[maxn][maxk], s[maxn][maxk], e[maxn][maxn];
ll d[maxn][maxn], f[maxn][maxn];
int main (void) {
  int n = read(), m = read(), k = read();
  FOR(i,1,n) FOR(j,1,k) {
    b[i][j] = read(), s[i][j] = read();
    if(b[i][j] == -1) b[i][j] = 1 << 30;
    if(s[i][j] == -1) s[i][j] = 0;
  }
  FOR(i,1,n) FOR(j,1,n) FOR(t,1,k)
    e[i][j] = std::max(e[i][j], s[j][t] - b[i][t]);
  FOR(i,1,n) FOR(j,1,n) d[i][j] = 1 << 30;
  FOR(i,1,m) {
    int x = read(), y = read(), c = read();
    d[x][y] = c;
  }
  FOR(i,1,n) d[i][i] = 0;
  FOR(t,1,n) FOR(i,1,n) FOR(j,1,n) d[i][j] = std::min(d[i][j], d[i][t] + d[t][j]);
  int left = 1, right = 1e9, mid, ans = 0;
  while(left <= right) {
    mid = (left + right >> 1);
    FOR(i,1,n) FOR(j,1,n) f[i][j] = i == j ? -1ll << 60 : e[i][j] - 1ll * mid * d[i][j];
    FOR(t,1,n) FOR(i,1,n) FOR(j,1,n) f[i][j] = std::max(f[i][j], f[i][t] + f[t][j]);
    bool flag = 0; FOR(i,1,n) if(f[i][i] >= 0) { flag = 1; break; }
    if(flag) ans = mid, left = mid + 1; else right = mid - 1;
  }
  printf("%d\n", ans);
  return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:33:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |     mid = (left + right >> 1);
      |            ~~~~~^~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2520 KB Output is correct
2 Correct 30 ms 1204 KB Output is correct
3 Correct 30 ms 1236 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 7 ms 692 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 5 ms 692 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 7 ms 828 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 5 ms 724 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 7 ms 692 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 692 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 828 KB Output is correct
9 Correct 9 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 5 ms 816 KB Output is correct
12 Correct 5 ms 724 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 696 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 5 ms 724 KB Output is correct
18 Correct 5 ms 724 KB Output is correct
19 Correct 6 ms 832 KB Output is correct
20 Correct 6 ms 836 KB Output is correct
21 Correct 6 ms 700 KB Output is correct
22 Correct 6 ms 724 KB Output is correct
23 Correct 5 ms 836 KB Output is correct
24 Correct 6 ms 692 KB Output is correct
25 Correct 9 ms 824 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 6 ms 828 KB Output is correct
31 Correct 5 ms 804 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 824 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 6 ms 828 KB Output is correct
7 Correct 5 ms 804 KB Output is correct
8 Correct 39 ms 1384 KB Output is correct
9 Correct 63 ms 2984 KB Output is correct
10 Correct 36 ms 1364 KB Output is correct
11 Correct 40 ms 1472 KB Output is correct
12 Correct 36 ms 1492 KB Output is correct
13 Correct 32 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 724 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 5 ms 816 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 696 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 6 ms 832 KB Output is correct
12 Correct 6 ms 836 KB Output is correct
13 Correct 6 ms 700 KB Output is correct
14 Correct 6 ms 724 KB Output is correct
15 Correct 5 ms 836 KB Output is correct
16 Correct 6 ms 692 KB Output is correct
17 Correct 39 ms 1384 KB Output is correct
18 Correct 63 ms 2984 KB Output is correct
19 Correct 36 ms 1364 KB Output is correct
20 Correct 40 ms 1472 KB Output is correct
21 Correct 36 ms 1492 KB Output is correct
22 Correct 32 ms 1364 KB Output is correct
23 Correct 9 ms 824 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 6 ms 828 KB Output is correct
29 Correct 5 ms 804 KB Output is correct
30 Correct 47 ms 2520 KB Output is correct
31 Correct 30 ms 1204 KB Output is correct
32 Correct 30 ms 1236 KB Output is correct
33 Correct 6 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 6 ms 724 KB Output is correct
36 Correct 5 ms 724 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 7 ms 692 KB Output is correct
39 Correct 5 ms 724 KB Output is correct
40 Correct 5 ms 692 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 7 ms 828 KB Output is correct
43 Correct 34 ms 1236 KB Output is correct
44 Correct 35 ms 1364 KB Output is correct
45 Correct 46 ms 1772 KB Output is correct
46 Correct 34 ms 1364 KB Output is correct
47 Correct 33 ms 1364 KB Output is correct
48 Correct 34 ms 1364 KB Output is correct
49 Correct 51 ms 3232 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 36 ms 1236 KB Output is correct
53 Correct 44 ms 1404 KB Output is correct
54 Correct 32 ms 1332 KB Output is correct
55 Correct 32 ms 1236 KB Output is correct
56 Correct 33 ms 1296 KB Output is correct
57 Correct 1 ms 316 KB Output is correct
58 Correct 6 ms 852 KB Output is correct
59 Correct 8 ms 848 KB Output is correct
60 Correct 10 ms 900 KB Output is correct
61 Correct 55 ms 3400 KB Output is correct
62 Correct 53 ms 3360 KB Output is correct
63 Correct 1 ms 308 KB Output is correct