oj.uz

Submission #548207

# Submission time Handle Problem Language Result Execution time Memory
548207 2022-04-12T17:34:21 Z Soumya1 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 100 ms 3484 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
const int mxN = 101;
const int mxK = 1001;
const long long INF = 1e18;
int s[mxN][mxK], b[mxN][mxK];
long long dist[mxN][mxN];
long long profit[mxN][mxN];
int n, m, k;
void pre_calc() {
  for (int x = 1; x <= n; x++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][x] + dist[x][j]);
      }
    }
  }
  for (int item = 1; item <= k; item++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        if (i == j) {
          profit[i][j] = 0;
          continue;
        }
        if (b[i][item] != -1 && s[j][item] != -1) {
          profit[i][j] = max(profit[i][j], (long long) s[j][item] - b[i][item]);
        }
      }
    }
  }
}
bool f(int x) {
  __int128 d[mxN];
  __int128 edge[mxN][mxN];
  for (int i = 1; i <= n; i++) {
    d[i] = INF;
    for (int j = 1; j <= n; j++) {
      edge[i][j] = (__int128) x * dist[i][j] - profit[i][j];
    }
  }
  for (int l = 1; l <= n; l++) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        edge[i][j] = min(edge[i][j], edge[i][l] + edge[l][j]);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    if (edge[i][i] <= 0) return true;
  }
  return false;
}
void testCase() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      dist[i][j] = INF;
      profit[i][j] = 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      cin >> b[i][j] >> s[i][j];
    }
  }
  while (m--) {
    int u, v, w;
    cin >> u >> v >> w;
    dist[u][v] = min(dist[u][v], 1LL * w);
  }
  pre_calc();
  int lo = 0, hi = 1e9 + 5;
  while (lo < hi) {
    int mid = (lo + hi + 1) >> 1;
    if (f(mid)) lo = mid;
    else hi = mid - 1;
  }
  cout << lo << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Compilation message

merchant.cpp: In function 'bool f(int)':
merchant.cpp:36:12: warning: variable 'd' set but not used [-Wunused-but-set-variable]
   36 |   __int128 d[mxN];
      |            ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 1312 KB Output is correct
2 Correct 68 ms 1404 KB Output is correct
3 Correct 67 ms 1404 KB Output is correct
4 Correct 10 ms 980 KB Output is correct
5 Correct 11 ms 852 KB Output is correct
6 Correct 10 ms 960 KB Output is correct
7 Correct 13 ms 980 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 9 ms 980 KB Output is correct
10 Correct 9 ms 964 KB Output is correct
11 Correct 9 ms 968 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 10 ms 960 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 960 KB Output is correct
2 Correct 13 ms 980 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 9 ms 980 KB Output is correct
5 Correct 9 ms 964 KB Output is correct
6 Correct 9 ms 968 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 10 ms 960 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 9 ms 852 KB Output is correct
11 Correct 10 ms 980 KB Output is correct
12 Correct 9 ms 956 KB Output is correct
13 Correct 12 ms 980 KB Output is correct
14 Correct 1 ms 452 KB Output is correct
15 Correct 13 ms 972 KB Output is correct
16 Correct 10 ms 984 KB Output is correct
17 Correct 10 ms 848 KB Output is correct
18 Correct 10 ms 852 KB Output is correct
19 Correct 10 ms 980 KB Output is correct
20 Correct 9 ms 980 KB Output is correct
21 Correct 9 ms 956 KB Output is correct
22 Correct 9 ms 960 KB Output is correct
23 Correct 11 ms 980 KB Output is correct
24 Correct 8 ms 852 KB Output is correct
25 Correct 10 ms 960 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 10 ms 852 KB Output is correct
28 Correct 11 ms 968 KB Output is correct
29 Correct 10 ms 852 KB Output is correct
30 Correct 11 ms 980 KB Output is correct
31 Correct 11 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 960 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 10 ms 852 KB Output is correct
4 Correct 11 ms 968 KB Output is correct
5 Correct 10 ms 852 KB Output is correct
6 Correct 11 ms 980 KB Output is correct
7 Correct 11 ms 852 KB Output is correct
8 Correct 65 ms 1424 KB Output is correct
9 Correct 98 ms 1408 KB Output is correct
10 Correct 68 ms 1420 KB Output is correct
11 Correct 76 ms 1364 KB Output is correct
12 Correct 91 ms 1412 KB Output is correct
13 Correct 82 ms 1408 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 852 KB Output is correct
2 Correct 9 ms 852 KB Output is correct
3 Correct 10 ms 980 KB Output is correct
4 Correct 9 ms 956 KB Output is correct
5 Correct 12 ms 980 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 13 ms 972 KB Output is correct
8 Correct 10 ms 984 KB Output is correct
9 Correct 10 ms 848 KB Output is correct
10 Correct 10 ms 852 KB Output is correct
11 Correct 10 ms 980 KB Output is correct
12 Correct 9 ms 980 KB Output is correct
13 Correct 9 ms 956 KB Output is correct
14 Correct 9 ms 960 KB Output is correct
15 Correct 11 ms 980 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 65 ms 1424 KB Output is correct
18 Correct 98 ms 1408 KB Output is correct
19 Correct 68 ms 1420 KB Output is correct
20 Correct 76 ms 1364 KB Output is correct
21 Correct 91 ms 1412 KB Output is correct
22 Correct 82 ms 1408 KB Output is correct
23 Correct 10 ms 960 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 10 ms 852 KB Output is correct
26 Correct 11 ms 968 KB Output is correct
27 Correct 10 ms 852 KB Output is correct
28 Correct 11 ms 980 KB Output is correct
29 Correct 11 ms 852 KB Output is correct
30 Correct 89 ms 1312 KB Output is correct
31 Correct 68 ms 1404 KB Output is correct
32 Correct 67 ms 1404 KB Output is correct
33 Correct 10 ms 980 KB Output is correct
34 Correct 11 ms 852 KB Output is correct
35 Correct 10 ms 960 KB Output is correct
36 Correct 13 ms 980 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 9 ms 980 KB Output is correct
39 Correct 9 ms 964 KB Output is correct
40 Correct 9 ms 968 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 10 ms 960 KB Output is correct
43 Correct 66 ms 1424 KB Output is correct
44 Correct 69 ms 1492 KB Output is correct
45 Correct 88 ms 1896 KB Output is correct
46 Correct 70 ms 1492 KB Output is correct
47 Correct 64 ms 1492 KB Output is correct
48 Correct 62 ms 1492 KB Output is correct
49 Correct 98 ms 3276 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 74 ms 1432 KB Output is correct
53 Correct 77 ms 1532 KB Output is correct
54 Correct 66 ms 1444 KB Output is correct
55 Correct 75 ms 1364 KB Output is correct
56 Correct 64 ms 1420 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 11 ms 1056 KB Output is correct
59 Correct 11 ms 984 KB Output is correct
60 Correct 12 ms 940 KB Output is correct
61 Correct 100 ms 3484 KB Output is correct
62 Correct 99 ms 3392 KB Output is correct
63 Correct 0 ms 468 KB Output is correct