oj.uz

Submission #408268

# Submission time Handle Problem Language Result Execution time Memory
408268 2021-05-19T06:44:24 Z dannyboy20031204 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 163 ms 3360 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll inf = 1ll << 60;
const int N = 101, K = 1001;
int b[N][K], s[N][K], c[N][N];
ll t[N][N];
int n, m, k;
bool check(ll mid){
     if (mid == 0) return true;
     ll mi[N][N];
     for (int i = 1; i <= n; i++){
          for (int j = 1; j <= n; j++){
               if (t[i][j] < inf / mid) mi[i][j] = t[i][j] * mid - c[i][j];
               else mi[i][j] = inf;
          }
     }
     for (int i = 1; i <= n; i++){
          for (int u = 1; u <= n; u++){
               for (int v = 1; v <= n; v++){
                    mi[u][v] = min(mi[u][v], mi[u][i] + mi[i][v]);
               }
          }
     }
     for (int i = 1; i <= n; i++) if (mi[i][i] <= 0) return true;
     return false;
}
int main(){
     ios::sync_with_stdio(0), cin.tie(0);
     cin >> n >> m >> k;
     for (int i = 1; i <= n; i++){
          for (int j = 0; j < k; j++) cin >> b[i][j] >> s[i][j];
     }
     for (auto &i : t) for (ll &j : i) j = inf; //!!!
     for (int i = 0; i < m; i++){
          int u, v, _t;
          cin >> u >> v >> _t;
          t[u][v] = _t;
     }
     for (int i = 1; i <= n; i++){
          for (int j = 1; j <= n; j++){
               c[i][j] = 0;
               for (int _k = 0; _k < k; _k++)
                    if (~s[j][_k] and ~b[i][_k]) c[i][j] = max(c[i][j], s[j][_k] - b[i][_k]);
          }
     }
     for (int i = 1; i <= n; i++){
          for (int u = 1; u <= n; u++){
               for (int v = 1; v <= n; v++){
                    t[u][v] = min(t[u][v], t[u][i] + t[i][v]);
               }
          }
     }
     ll l = 0, r = inf;
     while (l < r){
          ll mid = l + r >> 1;
          if (check(mid)) l = mid + 1;
          else r = mid;
     }
     cout << l - 1 << '\n';
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:56:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |           ll mid = l + r >> 1;
      |                    ~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 1284 KB Output is correct
2 Correct 82 ms 1284 KB Output is correct
3 Correct 85 ms 1292 KB Output is correct
4 Correct 12 ms 892 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 13 ms 888 KB Output is correct
7 Correct 17 ms 920 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 14 ms 836 KB Output is correct
10 Correct 12 ms 844 KB Output is correct
11 Correct 12 ms 888 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 12 ms 924 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 888 KB Output is correct
2 Correct 17 ms 920 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 14 ms 836 KB Output is correct
5 Correct 12 ms 844 KB Output is correct
6 Correct 12 ms 888 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 12 ms 924 KB Output is correct
9 Correct 18 ms 892 KB Output is correct
10 Correct 17 ms 844 KB Output is correct
11 Correct 13 ms 844 KB Output is correct
12 Correct 17 ms 880 KB Output is correct
13 Correct 16 ms 892 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 12 ms 888 KB Output is correct
16 Correct 12 ms 844 KB Output is correct
17 Correct 14 ms 896 KB Output is correct
18 Correct 12 ms 888 KB Output is correct
19 Correct 19 ms 864 KB Output is correct
20 Correct 15 ms 844 KB Output is correct
21 Correct 15 ms 896 KB Output is correct
22 Correct 19 ms 844 KB Output is correct
23 Correct 16 ms 892 KB Output is correct
24 Correct 14 ms 812 KB Output is correct
25 Correct 16 ms 888 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 17 ms 892 KB Output is correct
28 Correct 16 ms 888 KB Output is correct
29 Correct 13 ms 844 KB Output is correct
30 Correct 14 ms 884 KB Output is correct
31 Correct 12 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 888 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 17 ms 892 KB Output is correct
4 Correct 16 ms 888 KB Output is correct
5 Correct 13 ms 844 KB Output is correct
6 Correct 14 ms 884 KB Output is correct
7 Correct 12 ms 844 KB Output is correct
8 Correct 127 ms 1280 KB Output is correct
9 Correct 159 ms 1284 KB Output is correct
10 Correct 80 ms 1228 KB Output is correct
11 Correct 90 ms 1284 KB Output is correct
12 Correct 106 ms 1280 KB Output is correct
13 Correct 98 ms 1284 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 892 KB Output is correct
2 Correct 17 ms 844 KB Output is correct
3 Correct 13 ms 844 KB Output is correct
4 Correct 17 ms 880 KB Output is correct
5 Correct 16 ms 892 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 12 ms 888 KB Output is correct
8 Correct 12 ms 844 KB Output is correct
9 Correct 14 ms 896 KB Output is correct
10 Correct 12 ms 888 KB Output is correct
11 Correct 19 ms 864 KB Output is correct
12 Correct 15 ms 844 KB Output is correct
13 Correct 15 ms 896 KB Output is correct
14 Correct 19 ms 844 KB Output is correct
15 Correct 16 ms 892 KB Output is correct
16 Correct 14 ms 812 KB Output is correct
17 Correct 127 ms 1280 KB Output is correct
18 Correct 159 ms 1284 KB Output is correct
19 Correct 80 ms 1228 KB Output is correct
20 Correct 90 ms 1284 KB Output is correct
21 Correct 106 ms 1280 KB Output is correct
22 Correct 98 ms 1284 KB Output is correct
23 Correct 16 ms 888 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 17 ms 892 KB Output is correct
26 Correct 16 ms 888 KB Output is correct
27 Correct 13 ms 844 KB Output is correct
28 Correct 14 ms 884 KB Output is correct
29 Correct 12 ms 844 KB Output is correct
30 Correct 124 ms 1284 KB Output is correct
31 Correct 82 ms 1284 KB Output is correct
32 Correct 85 ms 1292 KB Output is correct
33 Correct 12 ms 892 KB Output is correct
34 Correct 12 ms 896 KB Output is correct
35 Correct 13 ms 888 KB Output is correct
36 Correct 17 ms 920 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 14 ms 836 KB Output is correct
39 Correct 12 ms 844 KB Output is correct
40 Correct 12 ms 888 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 12 ms 924 KB Output is correct
43 Correct 76 ms 1228 KB Output is correct
44 Correct 85 ms 1356 KB Output is correct
45 Correct 97 ms 1748 KB Output is correct
46 Correct 79 ms 1356 KB Output is correct
47 Correct 93 ms 1356 KB Output is correct
48 Correct 92 ms 1360 KB Output is correct
49 Correct 144 ms 3224 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 2 ms 460 KB Output is correct
52 Correct 79 ms 1300 KB Output is correct
53 Correct 106 ms 1404 KB Output is correct
54 Correct 92 ms 1320 KB Output is correct
55 Correct 78 ms 1308 KB Output is correct
56 Correct 87 ms 1300 KB Output is correct
57 Correct 1 ms 460 KB Output is correct
58 Correct 14 ms 972 KB Output is correct
59 Correct 14 ms 988 KB Output is correct
60 Correct 15 ms 992 KB Output is correct
61 Correct 163 ms 3352 KB Output is correct
62 Correct 148 ms 3360 KB Output is correct
63 Correct 1 ms 460 KB Output is correct