oj.uz

Submission #968899

# Submission time Handle Problem Language Result Execution time Memory
968899 2024-04-24T09:13:11 Z kilkuwu Travelling Merchant (APIO17_merchant) C++17
100 / 100
 75 ms 4320 KB 
#include <bits/stdc++.h>

#define nl '\n'

#ifdef LOCAL
#include "template/debug.hpp"
#else
#define dbg(...) ;
#define timer(...) ;
#endif

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int N, M, K;
  std::cin >> N >> M >> K;
  constexpr int64_t inf = 1e18;
  int64_t B[N][K], S[N][K], d[N][N], p[N][N], cost[N][N];

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      d[i][j] = inf;
    }
  }

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < K; j++) {
      std::cin >> B[i][j] >> S[i][j];
    }
  }

  for (int i = 0; i < M; i++) {
    int u, v, c;
    std::cin >> u >> v >> c;
    --u, --v;
    d[u][v] = std::min(d[u][v], (int64_t) c);
  }

  for (int k = 0; k < N; k++) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        d[i][j] = std::min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }

  dbg("done floyd")

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < N; j++) {
      p[i][j] = 0; // not doing shit
      for (int k = 0; k < K; k++) {
        if (B[i][k] != -1 && S[j][k] != -1) {
          p[i][j] = std::max(p[i][j], S[j][k] - B[i][k]);
        }
      }
    }
  }

  dbg("done profit");

  int lb = 0, rb = 1e9;
  while (lb < rb) {
    int mb = (lb + rb + 1) / 2;
    dbg(mb);

    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        cost[i][j] = std::min(inf / mb, d[i][j]) * mb - p[i][j];
      }
    }

    for (int k = 0; k < N; k++) {
      for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
          cost[i][j] = std::min(cost[i][j], cost[i][k] + cost[k][j]);
        }
      }
    }

    bool good = 0;
    for (int i = 0; i < N; i++) {
      good |= cost[i][i] <= 0;
    }

    if (good) {
      lb = mb;
    } else {
      rb = mb - 1;
    }
  }

  std::cout << lb << nl;

  // profit / time >= mid 
  // profit - time * mid >= 0 
  // a neg loop 




}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 3492 KB Output is correct
2 Correct 25 ms 604 KB Output is correct
3 Correct 26 ms 452 KB Output is correct
4 Correct 5 ms 500 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 344 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 4 ms 356 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 4 ms 612 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 4 ms 552 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 4 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 600 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 4 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 5 ms 600 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 29 ms 956 KB Output is correct
9 Correct 53 ms 3676 KB Output is correct
10 Correct 27 ms 600 KB Output is correct
11 Correct 32 ms 860 KB Output is correct
12 Correct 29 ms 1064 KB Output is correct
13 Correct 28 ms 604 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 356 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 612 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 4 ms 552 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 29 ms 956 KB Output is correct
18 Correct 53 ms 3676 KB Output is correct
19 Correct 27 ms 600 KB Output is correct
20 Correct 32 ms 860 KB Output is correct
21 Correct 29 ms 1064 KB Output is correct
22 Correct 28 ms 604 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 5 ms 600 KB Output is correct
26 Correct 4 ms 604 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 4 ms 348 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 45 ms 3492 KB Output is correct
31 Correct 25 ms 604 KB Output is correct
32 Correct 26 ms 452 KB Output is correct
33 Correct 5 ms 500 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 3 ms 348 KB Output is correct
36 Correct 4 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 348 KB Output is correct
39 Correct 4 ms 348 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 344 KB Output is correct
43 Correct 29 ms 604 KB Output is correct
44 Correct 38 ms 860 KB Output is correct
45 Correct 42 ms 2396 KB Output is correct
46 Correct 28 ms 856 KB Output is correct
47 Correct 33 ms 856 KB Output is correct
48 Correct 29 ms 860 KB Output is correct
49 Correct 75 ms 4188 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 30 ms 604 KB Output is correct
53 Correct 28 ms 600 KB Output is correct
54 Correct 27 ms 604 KB Output is correct
55 Correct 27 ms 604 KB Output is correct
56 Correct 27 ms 692 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 604 KB Output is correct
59 Correct 5 ms 604 KB Output is correct
60 Correct 5 ms 604 KB Output is correct
61 Correct 55 ms 4320 KB Output is correct
62 Correct 53 ms 4188 KB Output is correct
63 Correct 0 ms 348 KB Output is correct