oj.uz

Submission #531465

# Submission time Handle Problem Language Result Execution time Memory
531465 2022-02-28T18:31:03 Z Alex_tz307 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 120 ms 4168 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int INF = 2e18L;

void maxSelf(int &x, int y) {
  if (x < y) {
    x = y;
  }
}

void minSelf(int &x, int y) {
  if (y < x) {
    x = y;
  }
}

void FloydWarshall(vector<vector<int>> &d) {
  int n = d.size() - 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      for (int k = 1; k <= n; ++k) {
        minSelf(d[j][k], d[j][i] + d[i][k]);
      }
    }
  }
}

void testCase() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> b(n + 1, vector<int>(k + 1));
  vector<vector<int>> s(n + 1, vector<int>(k + 1));
  vector<vector<int>> d(n + 1, vector<int>(n + 1, INF));
  for (int u = 1; u <= n; ++u) {
    for (int i = 1; i <= k; ++i) {
      cin >> b[u][i] >> s[u][i];
    }
  }
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    d[u][v] = w;
  }
  FloydWarshall(d);
  vector<vector<int>> profit(n + 1, vector<int>(n + 1));
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      for (int p = 1; p <= k; ++p) {
        if (b[i][p] != -1 && s[j][p] != -1) {
          maxSelf(profit[i][j], s[j][p] - b[i][p]);
        }
      }
    }
  }
  int l = 1, r = 1e9;
  while (l <= r) {
    int mid = (l + r) / 2;
    vector<vector<int>> dp(n + 1, vector<int>(n + 1));
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        dp[i][j] = mid * min(d[i][j], INF / mid) - profit[i][j];
      }
    }
    FloydWarshall(dp);
    bool ok = false;
    for (int v = 1; v <= n; ++v) {
      if (dp[v][v] <= 0) {
        ok = true;
      }
    }
    if (ok) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  cout << r << '\n';
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 2124 KB Output is correct
2 Correct 38 ms 548 KB Output is correct
3 Correct 41 ms 568 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 6 ms 304 KB Output is correct
6 Correct 6 ms 316 KB Output is correct
7 Correct 7 ms 444 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 11 ms 336 KB Output is correct
10 Correct 7 ms 336 KB Output is correct
11 Correct 7 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 7 ms 420 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 316 KB Output is correct
2 Correct 7 ms 444 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 11 ms 336 KB Output is correct
5 Correct 7 ms 336 KB Output is correct
6 Correct 7 ms 336 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 7 ms 420 KB Output is correct
9 Correct 10 ms 332 KB Output is correct
10 Correct 6 ms 312 KB Output is correct
11 Correct 6 ms 444 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 11 ms 464 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 7 ms 400 KB Output is correct
16 Correct 7 ms 452 KB Output is correct
17 Correct 6 ms 336 KB Output is correct
18 Correct 7 ms 336 KB Output is correct
19 Correct 9 ms 464 KB Output is correct
20 Correct 9 ms 456 KB Output is correct
21 Correct 7 ms 408 KB Output is correct
22 Correct 8 ms 316 KB Output is correct
23 Correct 9 ms 464 KB Output is correct
24 Correct 6 ms 336 KB Output is correct
25 Correct 12 ms 420 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 12 ms 332 KB Output is correct
28 Correct 10 ms 332 KB Output is correct
29 Correct 10 ms 424 KB Output is correct
30 Correct 6 ms 332 KB Output is correct
31 Correct 7 ms 332 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 420 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 12 ms 332 KB Output is correct
4 Correct 10 ms 332 KB Output is correct
5 Correct 10 ms 424 KB Output is correct
6 Correct 6 ms 332 KB Output is correct
7 Correct 7 ms 332 KB Output is correct
8 Correct 87 ms 716 KB Output is correct
9 Correct 120 ms 1972 KB Output is correct
10 Correct 79 ms 612 KB Output is correct
11 Correct 119 ms 716 KB Output is correct
12 Correct 89 ms 716 KB Output is correct
13 Correct 48 ms 612 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 332 KB Output is correct
2 Correct 6 ms 312 KB Output is correct
3 Correct 6 ms 444 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 11 ms 464 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 7 ms 400 KB Output is correct
8 Correct 7 ms 452 KB Output is correct
9 Correct 6 ms 336 KB Output is correct
10 Correct 7 ms 336 KB Output is correct
11 Correct 9 ms 464 KB Output is correct
12 Correct 9 ms 456 KB Output is correct
13 Correct 7 ms 408 KB Output is correct
14 Correct 8 ms 316 KB Output is correct
15 Correct 9 ms 464 KB Output is correct
16 Correct 6 ms 336 KB Output is correct
17 Correct 87 ms 716 KB Output is correct
18 Correct 120 ms 1972 KB Output is correct
19 Correct 79 ms 612 KB Output is correct
20 Correct 119 ms 716 KB Output is correct
21 Correct 89 ms 716 KB Output is correct
22 Correct 48 ms 612 KB Output is correct
23 Correct 12 ms 420 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 12 ms 332 KB Output is correct
26 Correct 10 ms 332 KB Output is correct
27 Correct 10 ms 424 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 7 ms 332 KB Output is correct
30 Correct 62 ms 2124 KB Output is correct
31 Correct 38 ms 548 KB Output is correct
32 Correct 41 ms 568 KB Output is correct
33 Correct 6 ms 380 KB Output is correct
34 Correct 6 ms 304 KB Output is correct
35 Correct 6 ms 316 KB Output is correct
36 Correct 7 ms 444 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 11 ms 336 KB Output is correct
39 Correct 7 ms 336 KB Output is correct
40 Correct 7 ms 336 KB Output is correct
41 Correct 1 ms 208 KB Output is correct
42 Correct 7 ms 420 KB Output is correct
43 Correct 42 ms 584 KB Output is correct
44 Correct 43 ms 704 KB Output is correct
45 Correct 68 ms 2280 KB Output is correct
46 Correct 51 ms 772 KB Output is correct
47 Correct 43 ms 788 KB Output is correct
48 Correct 43 ms 792 KB Output is correct
49 Correct 95 ms 4044 KB Output is correct
50 Correct 1 ms 208 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 44 ms 592 KB Output is correct
53 Correct 41 ms 704 KB Output is correct
54 Correct 42 ms 592 KB Output is correct
55 Correct 44 ms 628 KB Output is correct
56 Correct 59 ms 592 KB Output is correct
57 Correct 1 ms 312 KB Output is correct
58 Correct 8 ms 508 KB Output is correct
59 Correct 8 ms 568 KB Output is correct
60 Correct 8 ms 520 KB Output is correct
61 Correct 81 ms 4168 KB Output is correct
62 Correct 87 ms 4156 KB Output is correct
63 Correct 1 ms 208 KB Output is correct