oj.uz

Submission #805279

# Submission time Handle Problem Language Result Execution time Memory
805279 2023-08-03T14:44:08 Z peijar Travelling Merchant (APIO17_merchant) C++17
100 / 100
 622 ms 264556 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
  bool first = true;
  string res = "[";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "]";
  return res;
}

void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
  cout << ' ' << to_string(H);
  dbg_out(T...);
}

#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

const int INF = 1e18;

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbSommets, nbAretes, nbItems;
  cin >> nbSommets >> nbAretes >> nbItems;
  vector<vector<int>> buy(nbSommets, vector<int>(nbItems));
  vector<vector<int>> sell(nbSommets, vector<int>(nbItems));
  for (int i = 0; i < nbSommets; ++i)
    for (int j = 0; j < nbItems; ++j)
      cin >> buy[i][j] >> sell[i][j];

  vector<vector<int>> dis(nbSommets, vector<int>(nbSommets, INF));
  for (int i = 0; i < nbSommets; ++i)
    dis[i][i] = 0;

  vector<tuple<int, int, int, int>> edges;
  for (int iArete = 0; iArete < nbAretes; ++iArete) {
    int u, v, T;
    cin >> u >> v >> T;
    --u, --v;
    edges.emplace_back(u, v, T, 0);
    dis[u][v] = T;
  }
  for (int k = 0; k < nbSommets; ++k)
    for (int i = 0; i < nbSommets; ++i)
      for (int j = 0; j < nbSommets; ++j)
        dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
  for (int u = 0; u < nbSommets; ++u)
    for (int item = 0; item < nbItems; ++item)
      if (buy[u][item] != -1)
        for (int v = 0; v < nbSommets; ++v)
          if (sell[v][item] > buy[u][item] and dis[u][v] < INF)
            edges.emplace_back(u, v, dis[u][v], buy[u][item] - sell[v][item]);

  int lo = 0, up = 1e9;
  while (lo < up) {
    int x = (lo + up + 1) / 2;
    for (int u = 0; u < nbSommets; ++u)
      dis[u].assign(nbSommets, INF);
    for (auto [u, v, t, l] : edges)
      dis[u][v] = min(dis[u][v], x * t + l);
    for (int k = 0; k < nbSommets; ++k)
      for (int i = 0; i < nbSommets; ++i)
        for (int j = 0; j < nbSommets; ++j)
          if (dis[i][k] < INF and dis[k][j] < INF)
            dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
    bool negCycle = false;
    for (int u = 0; u < nbSommets; ++u)
      if (dis[u][u] <= 0)
        negCycle = true;
    if (negCycle)
      lo = x;
    else
      up = x - 1;
  }
  cout << lo << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2144 KB Output is correct
2 Correct 32 ms 340 KB Output is correct
3 Correct 33 ms 340 KB Output is correct
4 Correct 5 ms 316 KB Output is correct
5 Correct 6 ms 316 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 368 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 5 ms 392 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 5 ms 368 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 5 ms 392 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct
12 Correct 5 ms 340 KB Output is correct
13 Correct 5 ms 596 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 5 ms 340 KB Output is correct
16 Correct 5 ms 396 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 5 ms 468 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 7 ms 1484 KB Output is correct
24 Correct 5 ms 356 KB Output is correct
25 Correct 10 ms 2504 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 5 ms 596 KB Output is correct
28 Correct 10 ms 2504 KB Output is correct
29 Correct 9 ms 2504 KB Output is correct
30 Correct 5 ms 724 KB Output is correct
31 Correct 7 ms 468 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2504 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 5 ms 596 KB Output is correct
4 Correct 10 ms 2504 KB Output is correct
5 Correct 9 ms 2504 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 7 ms 468 KB Output is correct
8 Correct 88 ms 17088 KB Output is correct
9 Correct 622 ms 264556 KB Output is correct
10 Correct 54 ms 8776 KB Output is correct
11 Correct 41 ms 1108 KB Output is correct
12 Correct 38 ms 1360 KB Output is correct
13 Correct 52 ms 8916 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 5 ms 340 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 396 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 7 ms 1484 KB Output is correct
16 Correct 5 ms 356 KB Output is correct
17 Correct 88 ms 17088 KB Output is correct
18 Correct 622 ms 264556 KB Output is correct
19 Correct 54 ms 8776 KB Output is correct
20 Correct 41 ms 1108 KB Output is correct
21 Correct 38 ms 1360 KB Output is correct
22 Correct 52 ms 8916 KB Output is correct
23 Correct 10 ms 2504 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 5 ms 596 KB Output is correct
26 Correct 10 ms 2504 KB Output is correct
27 Correct 9 ms 2504 KB Output is correct
28 Correct 5 ms 724 KB Output is correct
29 Correct 7 ms 468 KB Output is correct
30 Correct 54 ms 2144 KB Output is correct
31 Correct 32 ms 340 KB Output is correct
32 Correct 33 ms 340 KB Output is correct
33 Correct 5 ms 316 KB Output is correct
34 Correct 6 ms 316 KB Output is correct
35 Correct 5 ms 340 KB Output is correct
36 Correct 5 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 5 ms 340 KB Output is correct
39 Correct 5 ms 340 KB Output is correct
40 Correct 5 ms 368 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 5 ms 392 KB Output is correct
43 Correct 34 ms 460 KB Output is correct
44 Correct 40 ms 724 KB Output is correct
45 Correct 43 ms 2216 KB Output is correct
46 Correct 35 ms 592 KB Output is correct
47 Correct 36 ms 692 KB Output is correct
48 Correct 38 ms 596 KB Output is correct
49 Correct 82 ms 12400 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 35 ms 468 KB Output is correct
53 Correct 37 ms 1108 KB Output is correct
54 Correct 35 ms 552 KB Output is correct
55 Correct 35 ms 488 KB Output is correct
56 Correct 41 ms 488 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 7 ms 724 KB Output is correct
59 Correct 11 ms 2640 KB Output is correct
60 Correct 7 ms 636 KB Output is correct
61 Correct 87 ms 12372 KB Output is correct
62 Correct 81 ms 12296 KB Output is correct
63 Correct 1 ms 212 KB Output is correct