oj.uz

Submission #165450

# Submission time Handle Problem Language Result Execution time Memory
165450 2019-11-27T10:22:09 Z fedoseevtimofey Travelling Merchant (APIO17_merchant) C++14
100 / 100
 130 ms 3456 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
const int Inf = 1e9;
 
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif 
  int n, m, k;
  cin >> n >> m >> k;
  vector <vector <int>> s(n, vector <int> (k)), b(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 <int>> d(n, vector <int> (n, Inf));
  for (int i = 0; i < m; ++i) {
    int u, v, x;
    cin >> u >> v >> x;
    --u, --v;
    d[u][v] = x;
  }
  for (int k = 0; k < n; ++k) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
  vector <vector <int>> best(n, vector <int> (n, 0));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int id = 0; id < k; ++id) {
        if (s[j][id] != -1 && b[i][id] != -1) best[i][j] = max(best[i][j], s[j][id] - b[i][id]);
      }
    }
  }
  vector <vector <ll>> w(n, vector <ll> (n));
  int l = 0, r = 1e9 + 7;
  while (r - l > 1) {
    int m = (l + r) >> 1;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        w[i][j] = best[i][j] - (ll)m * d[i][j];
      }
    }
    for (int k = 0; k < n; ++k) {
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
          w[i][j] = max(w[i][j], w[i][k] + w[k][j]);
        }
      }
    }
    bool fl = false;
    for (int i = 0; i < n; ++i) {
      if (w[i][i] >= 0) fl = true;
    }
    if (fl) l = m;
    else r = m;
  }
  cout << l << '\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1272 KB Output is correct
2 Correct 38 ms 504 KB Output is correct
3 Correct 39 ms 548 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 7 ms 376 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 8 ms 476 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 440 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 9 ms 376 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 11 ms 376 KB Output is correct
17 Correct 9 ms 504 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 9 ms 504 KB Output is correct
20 Correct 9 ms 504 KB Output is correct
21 Correct 9 ms 540 KB Output is correct
22 Correct 8 ms 376 KB Output is correct
23 Correct 7 ms 504 KB Output is correct
24 Correct 7 ms 376 KB Output is correct
25 Correct 8 ms 476 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 7 ms 376 KB Output is correct
28 Correct 7 ms 440 KB Output is correct
29 Correct 7 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 8 ms 376 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 888 KB Output is correct
2 Correct 119 ms 2944 KB Output is correct
3 Correct 44 ms 632 KB Output is correct
4 Correct 49 ms 760 KB Output is correct
5 Correct 49 ms 760 KB Output is correct
6 Correct 42 ms 632 KB Output is correct
7 Correct 9 ms 504 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 9 ms 504 KB Output is correct
11 Correct 9 ms 540 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 7 ms 504 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 9 ms 376 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 11 ms 376 KB Output is correct
17 Correct 47 ms 888 KB Output is correct
18 Correct 119 ms 2944 KB Output is correct
19 Correct 44 ms 632 KB Output is correct
20 Correct 49 ms 760 KB Output is correct
21 Correct 49 ms 760 KB Output is correct
22 Correct 42 ms 632 KB Output is correct
23 Correct 9 ms 504 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 9 ms 504 KB Output is correct
26 Correct 9 ms 504 KB Output is correct
27 Correct 9 ms 540 KB Output is correct
28 Correct 8 ms 376 KB Output is correct
29 Correct 7 ms 504 KB Output is correct
30 Correct 39 ms 504 KB Output is correct
31 Correct 43 ms 632 KB Output is correct
32 Correct 60 ms 1756 KB Output is correct
33 Correct 42 ms 636 KB Output is correct
34 Correct 42 ms 632 KB Output is correct
35 Correct 42 ms 716 KB Output is correct
36 Correct 129 ms 3292 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 52 ms 520 KB Output is correct
40 Correct 43 ms 688 KB Output is correct
41 Correct 44 ms 504 KB Output is correct
42 Correct 40 ms 504 KB Output is correct
43 Correct 40 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 10 ms 504 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 22 ms 632 KB Output is correct
48 Correct 130 ms 3456 KB Output is correct
49 Correct 128 ms 3320 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 74 ms 1272 KB Output is correct
52 Correct 38 ms 504 KB Output is correct
53 Correct 39 ms 548 KB Output is correct
54 Correct 7 ms 376 KB Output is correct
55 Correct 7 ms 376 KB Output is correct
56 Correct 7 ms 376 KB Output is correct
57 Correct 8 ms 476 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 7 ms 376 KB Output is correct
60 Correct 7 ms 440 KB Output is correct
61 Correct 7 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 8 ms 376 KB Output is correct