oj.uz

Submission #410753

# Submission time Handle Problem Language Result Execution time Memory
410753 2021-05-23T15:12:28 Z 600Mihnea Travelling Merchant (APIO17_merchant) C++17
100 / 100
 124 ms 2172 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
const int N = 100 + 7;
const int K = 1000 + 7;
const int INF = (int) 1e18;
int dist[N][N];
int n, m, k, buy[N][K], sell[N][K], best[N], tab[N][N], sol[N][N];

bool ok(int coef) {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      sol[i][j] = -INF;
      if (dist[i][j] == INF) continue;
      int mx = tab[i][j];
      sol[i][j] = mx - coef * dist[i][j];
    }
  }
  for (int k = 1; k <= n; k++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        sol[i][j] = max(sol[i][j], sol[i][k] + sol[k][j]);
        sol[i][j] = min(sol[i][j], INF);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (sol[i][j] + sol[j][i] >= 0) {
        return 1;
      }
    }
  }
  return 0;
}

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  ///freopen ("input", "r", stdin);

  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      cin >> buy[i][j] >> sell[i][j];
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      dist[i][j] = INF;
    }
  }
  for (int i = 1; i <= m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    dist[a][b] = c;
  }
  for (int k = 1; k <= n; k++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      for (int item = 1; item <= k; item++) {
        /// buy at i, sell at j
        if (buy[i][item] != -1 && sell[j][item] != -1) {
          tab[i][j] = max(tab[i][j], sell[j][item] - buy[i][item]);
        }
      }
    }
  }
  int l = 1, r = (int) 1e9, sol = 0;
  while (l <= r) {
    int m = (l + r) / 2;
    if (ok(m)) {
      sol = m;
      l = m + 1;
    } else {
      r = m - 1;
    }
  }
  assert(!ok(sol + 1));
  cout << sol << "\n";
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1988 KB Output is correct
2 Correct 52 ms 1212 KB Output is correct
3 Correct 52 ms 1284 KB Output is correct
4 Correct 8 ms 808 KB Output is correct
5 Correct 8 ms 716 KB Output is correct
6 Correct 8 ms 716 KB Output is correct
7 Correct 9 ms 844 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 8 ms 812 KB Output is correct
10 Correct 8 ms 716 KB Output is correct
11 Correct 8 ms 820 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 11 ms 876 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 716 KB Output is correct
2 Correct 9 ms 844 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 812 KB Output is correct
5 Correct 8 ms 716 KB Output is correct
6 Correct 8 ms 820 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 11 ms 876 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 8 ms 844 KB Output is correct
13 Correct 9 ms 892 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 8 ms 844 KB Output is correct
16 Correct 8 ms 888 KB Output is correct
17 Correct 8 ms 860 KB Output is correct
18 Correct 8 ms 844 KB Output is correct
19 Correct 10 ms 884 KB Output is correct
20 Correct 9 ms 884 KB Output is correct
21 Correct 9 ms 844 KB Output is correct
22 Correct 9 ms 888 KB Output is correct
23 Correct 12 ms 844 KB Output is correct
24 Correct 8 ms 828 KB Output is correct
25 Correct 9 ms 844 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 9 ms 844 KB Output is correct
28 Correct 9 ms 844 KB Output is correct
29 Correct 9 ms 900 KB Output is correct
30 Correct 9 ms 844 KB Output is correct
31 Correct 8 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 844 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 9 ms 844 KB Output is correct
4 Correct 9 ms 844 KB Output is correct
5 Correct 9 ms 900 KB Output is correct
6 Correct 9 ms 844 KB Output is correct
7 Correct 8 ms 860 KB Output is correct
8 Correct 59 ms 1420 KB Output is correct
9 Correct 108 ms 2172 KB Output is correct
10 Correct 70 ms 1356 KB Output is correct
11 Correct 59 ms 1652 KB Output is correct
12 Correct 59 ms 1604 KB Output is correct
13 Correct 55 ms 1484 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 8 ms 844 KB Output is correct
3 Correct 10 ms 888 KB Output is correct
4 Correct 8 ms 844 KB Output is correct
5 Correct 9 ms 892 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 8 ms 844 KB Output is correct
8 Correct 8 ms 888 KB Output is correct
9 Correct 8 ms 860 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 10 ms 884 KB Output is correct
12 Correct 9 ms 884 KB Output is correct
13 Correct 9 ms 844 KB Output is correct
14 Correct 9 ms 888 KB Output is correct
15 Correct 12 ms 844 KB Output is correct
16 Correct 8 ms 828 KB Output is correct
17 Correct 59 ms 1420 KB Output is correct
18 Correct 108 ms 2172 KB Output is correct
19 Correct 70 ms 1356 KB Output is correct
20 Correct 59 ms 1652 KB Output is correct
21 Correct 59 ms 1604 KB Output is correct
22 Correct 55 ms 1484 KB Output is correct
23 Correct 9 ms 844 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 9 ms 844 KB Output is correct
26 Correct 9 ms 844 KB Output is correct
27 Correct 9 ms 900 KB Output is correct
28 Correct 9 ms 844 KB Output is correct
29 Correct 8 ms 860 KB Output is correct
30 Correct 81 ms 1988 KB Output is correct
31 Correct 52 ms 1212 KB Output is correct
32 Correct 52 ms 1284 KB Output is correct
33 Correct 8 ms 808 KB Output is correct
34 Correct 8 ms 716 KB Output is correct
35 Correct 8 ms 716 KB Output is correct
36 Correct 9 ms 844 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 8 ms 812 KB Output is correct
39 Correct 8 ms 716 KB Output is correct
40 Correct 8 ms 820 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 11 ms 876 KB Output is correct
43 Correct 64 ms 1356 KB Output is correct
44 Correct 60 ms 1604 KB Output is correct
45 Correct 74 ms 2108 KB Output is correct
46 Correct 55 ms 1484 KB Output is correct
47 Correct 55 ms 1508 KB Output is correct
48 Correct 55 ms 1484 KB Output is correct
49 Correct 114 ms 2140 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 53 ms 1360 KB Output is correct
53 Correct 55 ms 1356 KB Output is correct
54 Correct 54 ms 1412 KB Output is correct
55 Correct 54 ms 1356 KB Output is correct
56 Correct 57 ms 1324 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 17 ms 928 KB Output is correct
59 Correct 11 ms 924 KB Output is correct
60 Correct 10 ms 844 KB Output is correct
61 Correct 124 ms 2124 KB Output is correct
62 Correct 116 ms 2120 KB Output is correct
63 Correct 1 ms 332 KB Output is correct