oj.uz

Submission #945532

# Submission time Handle Problem Language Result Execution time Memory
945532 2024-03-14T03:48:24 Z NeroZein Travelling Merchant (APIO17_merchant) C++17
100 / 100
 89 ms 1476 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif

const int N = 102;
const int K = 1003; 

int n;
int adj[N][N];
int best[N][N];
long long p[N][N];
long long adj2[N][N];
int buy[N][K], sell[N][K];

void floyd() {
  for (int l = 1; l <= n; ++l) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        adj2[i][j] = min(adj2[i][j], adj2[i][l] + adj2[l][j]);
      }
    }
  }
}

void floyd2() {
  for (int l = 1; l <= n; ++l) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        p[i][j] = max(p[i][j], p[i][l] + p[l][j]);
      }
    }
  } 
}

bool check(int mid) {
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      adj2[i][j] = (long long) adj[i][j] * mid;
    }
  }
  floyd();
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      p[i][j] = -adj2[i][j] + best[i][j];
    }
  }
  floyd2();
  for (int i = 1; i <= n; ++i) {
    if (p[i][i] >= 0) {
      return true; 
    }
  }
  return false;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; ++i) {
    for (int j = 2; j <= 2 * k; j += 2) {
      cin >> buy[i][j / 2] >> sell[i][j / 2];
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      for (int l = 1; l <= k; ++l) {
        if (sell[j][l] != -1 && buy[i][l] != -1) {
          best[i][j] = max(best[i][j], sell[j][l] - buy[i][l]);          
        }
      }
    }
  }
  memset(adj, 0x3f3f3f3f, sizeof adj);
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    adj[u][v] = min(adj[u][v], w);
  }
  int lo = 0, hi = 1e9 + 9;
  while (lo < hi) {
    int mid = (lo + hi + 1) / 2;
    if (check(mid)) {
      lo = mid;
    } else {
      hi = mid - 1; 
    }
  }
  cout << lo << '\n'; 
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 1440 KB Output is correct
2 Correct 50 ms 1372 KB Output is correct
3 Correct 52 ms 1372 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 7 ms 860 KB Output is correct
6 Correct 7 ms 988 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 7 ms 992 KB Output is correct
11 Correct 7 ms 860 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 7 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1012 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 7 ms 1008 KB Output is correct
4 Correct 8 ms 856 KB Output is correct
5 Correct 8 ms 1008 KB Output is correct
6 Correct 9 ms 1064 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 54 ms 1372 KB Output is correct
9 Correct 74 ms 1472 KB Output is correct
10 Correct 53 ms 1372 KB Output is correct
11 Correct 54 ms 1468 KB Output is correct
12 Correct 55 ms 1372 KB Output is correct
13 Correct 53 ms 1372 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 856 KB Output is correct
2 Correct 7 ms 1112 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 7 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 10 ms 1016 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 7 ms 860 KB Output is correct
12 Correct 7 ms 1016 KB Output is correct
13 Correct 7 ms 860 KB Output is correct
14 Correct 7 ms 856 KB Output is correct
15 Correct 8 ms 860 KB Output is correct
16 Correct 7 ms 860 KB Output is correct
17 Correct 54 ms 1372 KB Output is correct
18 Correct 74 ms 1472 KB Output is correct
19 Correct 53 ms 1372 KB Output is correct
20 Correct 54 ms 1468 KB Output is correct
21 Correct 55 ms 1372 KB Output is correct
22 Correct 53 ms 1372 KB Output is correct
23 Correct 7 ms 1012 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 7 ms 1008 KB Output is correct
26 Correct 8 ms 856 KB Output is correct
27 Correct 8 ms 1008 KB Output is correct
28 Correct 9 ms 1064 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 72 ms 1440 KB Output is correct
31 Correct 50 ms 1372 KB Output is correct
32 Correct 52 ms 1372 KB Output is correct
33 Correct 8 ms 860 KB Output is correct
34 Correct 7 ms 860 KB Output is correct
35 Correct 7 ms 988 KB Output is correct
36 Correct 7 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 7 ms 860 KB Output is correct
39 Correct 7 ms 992 KB Output is correct
40 Correct 7 ms 860 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 7 ms 860 KB Output is correct
43 Correct 53 ms 1472 KB Output is correct
44 Correct 54 ms 1372 KB Output is correct
45 Correct 64 ms 1476 KB Output is correct
46 Correct 54 ms 1372 KB Output is correct
47 Correct 57 ms 1372 KB Output is correct
48 Correct 54 ms 1372 KB Output is correct
49 Correct 89 ms 1244 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 52 ms 1460 KB Output is correct
53 Correct 54 ms 1368 KB Output is correct
54 Correct 54 ms 1328 KB Output is correct
55 Correct 55 ms 1372 KB Output is correct
56 Correct 53 ms 1448 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 8 ms 860 KB Output is correct
59 Correct 9 ms 856 KB Output is correct
60 Correct 8 ms 860 KB Output is correct
61 Correct 85 ms 1472 KB Output is correct
62 Correct 86 ms 1256 KB Output is correct
63 Correct 0 ms 344 KB Output is correct