oj.uz

Submission #950182

# Submission time Handle Problem Language Result Execution time Memory
950182 2024-03-20T06:34:20 Z abczz Travelling Merchant (APIO17_merchant) C++14
100 / 100
 121 ms 4248 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <deque>
#include <queue>
#define ll long long

using namespace std;

ll dist[100][100], C[100][100], X[100][100], l, r, mid;
ll n, m, k, a, b, c, cur, A[100][1000], B[100][1000];
int main() {
  cin >> n >> m >> k;
  for (int i=0; i<n; ++i) {
    for (int j=0; j<n; ++j) {
      dist[i][j] = 1e18;
    }
  }
  for (int i=0; i<n; ++i) {
    dist[i][i] = 0;
    for (int j=0; j<k; ++j) {
      cin >> A[i][j] >> B[i][j];
    }
  }
  for (int i=0; i<m; ++i) {
    cin >> a >> b >> c;
    --a, --b;
    dist[a][b] = min(dist[a][b], c);
  }
  for (int x=0; x<n; ++x) {
    for (int i=0; i<n; ++i) {
      for (int j=0; j<n; ++j) {
        dist[i][j] = min(dist[i][x] + dist[x][j], dist[i][j]);
      }
    }
  }
  for (int i=0; i<n; ++i) {
    for (int j=0; j<n; ++j) {
      if (i != j) {
        for (int x=0; x<k; ++x) {
          if (min(A[i][x], B[j][x]) != -1) C[i][j] = max(C[i][j], B[j][x]-A[i][x]);
        }
      }
    }
  }
  l = 0, r = 1e9;
  while (l < r) {
    mid = (l+r+1)/2;
    for (int i=0; i<n; ++i) {
      for (int j=0; j<n; ++j) {
        if (dist[i][j] != 1e18) X[i][j] = C[i][j] - mid * dist[i][j];
        else X[i][j] = -1e18;
      }
    }
    for (int x=0; x<n; ++x) {
      for (int i=0; i<n; ++i) {
        for (int j=0; j<n; ++j) {
          X[i][j] = max(X[i][j], min((ll)1e18, X[i][x] + X[x][j]));
          X[i][j] = max(X[i][j], (ll)-1e18);
        }
      }
    }
    cur = -1e18;
    for (int i=0; i<n; ++i) {
      for (int j=0; j<n; ++j) {
        if (i != j) {
          cur = max(cur, X[i][j]+X[j][i]);
        }
      }
    }
    if (cur >= 0) l = mid;
    else r = mid-1;
  }
  cout << l << '\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 2132 KB Output is correct
2 Correct 45 ms 1372 KB Output is correct
3 Correct 46 ms 1368 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 6 ms 924 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 7 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 7 ms 956 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 860 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 860 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 956 KB Output is correct
9 Correct 6 ms 856 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 8 ms 996 KB Output is correct
12 Correct 7 ms 860 KB Output is correct
13 Correct 10 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 960 KB Output is correct
16 Correct 7 ms 1016 KB Output is correct
17 Correct 7 ms 860 KB Output is correct
18 Correct 7 ms 860 KB Output is correct
19 Correct 8 ms 860 KB Output is correct
20 Correct 8 ms 860 KB Output is correct
21 Correct 7 ms 860 KB Output is correct
22 Correct 7 ms 860 KB Output is correct
23 Correct 9 ms 860 KB Output is correct
24 Correct 6 ms 856 KB Output is correct
25 Correct 9 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 860 KB Output is correct
28 Correct 8 ms 856 KB Output is correct
29 Correct 8 ms 856 KB Output is correct
30 Correct 7 ms 860 KB Output is correct
31 Correct 6 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 8 ms 856 KB Output is correct
5 Correct 8 ms 856 KB Output is correct
6 Correct 7 ms 860 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 52 ms 1500 KB Output is correct
9 Correct 106 ms 1968 KB Output is correct
10 Correct 60 ms 1616 KB Output is correct
11 Correct 53 ms 1372 KB Output is correct
12 Correct 53 ms 1376 KB Output is correct
13 Correct 51 ms 1512 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 856 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 8 ms 996 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 10 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 6 ms 960 KB Output is correct
8 Correct 7 ms 1016 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 7 ms 860 KB Output is correct
11 Correct 8 ms 860 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 7 ms 860 KB Output is correct
14 Correct 7 ms 860 KB Output is correct
15 Correct 9 ms 860 KB Output is correct
16 Correct 6 ms 856 KB Output is correct
17 Correct 52 ms 1500 KB Output is correct
18 Correct 106 ms 1968 KB Output is correct
19 Correct 60 ms 1616 KB Output is correct
20 Correct 53 ms 1372 KB Output is correct
21 Correct 53 ms 1376 KB Output is correct
22 Correct 51 ms 1512 KB Output is correct
23 Correct 9 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 8 ms 860 KB Output is correct
26 Correct 8 ms 856 KB Output is correct
27 Correct 8 ms 856 KB Output is correct
28 Correct 7 ms 860 KB Output is correct
29 Correct 6 ms 860 KB Output is correct
30 Correct 92 ms 2132 KB Output is correct
31 Correct 45 ms 1372 KB Output is correct
32 Correct 46 ms 1368 KB Output is correct
33 Correct 6 ms 856 KB Output is correct
34 Correct 6 ms 924 KB Output is correct
35 Correct 6 ms 860 KB Output is correct
36 Correct 7 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 860 KB Output is correct
39 Correct 6 ms 860 KB Output is correct
40 Correct 7 ms 860 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 7 ms 956 KB Output is correct
43 Correct 50 ms 1368 KB Output is correct
44 Correct 50 ms 1628 KB Output is correct
45 Correct 72 ms 2608 KB Output is correct
46 Correct 49 ms 1624 KB Output is correct
47 Correct 50 ms 1628 KB Output is correct
48 Correct 50 ms 1468 KB Output is correct
49 Correct 111 ms 4000 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 48 ms 1372 KB Output is correct
53 Correct 51 ms 1372 KB Output is correct
54 Correct 50 ms 1544 KB Output is correct
55 Correct 51 ms 1480 KB Output is correct
56 Correct 48 ms 1412 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 9 ms 1112 KB Output is correct
59 Correct 11 ms 1116 KB Output is correct
60 Correct 9 ms 1128 KB Output is correct
61 Correct 115 ms 4248 KB Output is correct
62 Correct 121 ms 4180 KB Output is correct
63 Correct 0 ms 344 KB Output is correct