oj.uz

Submission #310163

# Submission time Handle Problem Language Result Execution time Memory
310163 2020-10-06T02:49:19 Z quocnguyen1012 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 129 ms 1272 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define ar array
#define eb emplace_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 105, maxk = 1005, inf = 1e9;

int N, M, K;
int dist[maxn][maxn], op[maxn][maxn];
int buy[maxk][maxn], sell[maxk][maxn];
ll go[maxn][maxn];

bool check(int lim) {
  for (int i = 1; i <= N; ++i) {
    for (int j = 1; j <= N; ++j) {
      go[i][j] = -inf;
      if (dist[i][j] == inf)
        continue;
      go[i][j] = op[i][j] - (ll)lim * dist[i][j];
    }
  }
  for (int k = 1; k <= N; ++k) {
    for (int i = 1; i <= N; ++i) {
      for (int j = 1; j <= N; ++j) {
        go[i][j] = max(go[i][j], go[i][k] + go[k][j]);
        if (go[i][j] >= inf)
          go[i][j] = inf;
      }
    }
  }

  for (int i = 1; i <= N; ++i) {
    for (int j = 1; j <= N; ++j) {
      if (go[i][j] + go[j][i] >= 0)
        return true;
    }
  }
  return false;
}


signed main(void) {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
  freopen("A.INP", "r", stdin);
  freopen("A.OUT", "w", stdout);
#endif // LOCAL

  cin >> N >> M >> K;
  for (int i = 1;  i <= N; ++i) {
    for (int j = 1; j <= N; ++j) {
      dist[i][j] = inf;
    }
  }
  for (int i = 1; i <= N; ++i) {
    for (int j = 1; j <= K; ++j) {
      cin >> buy[j][i] >> sell[j][i];
    }
  }
  while (M--) {
    int u, v, w; cin >> u >> v >> w;
    dist[u][v] = min(dist[u][v], w);
  }

  for (int k = 1; k <= N; ++k) {
    for (int i = 1; i <= N; ++i) {
      for (int j = 1; j <= N; ++j) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
  for (int u = 1; u <= N; ++u) {
    for (int v = 1; v <= N; ++v) {
      for (int item = 1; item <= K; ++item) {
        if (buy[item][u] != -1 && sell[item][v] != -1) {
          op[u][v] = max(op[u][v], -buy[item][u] + sell[item][v]);
        }
      }
    }
  }

  int lo = 1, hi = 1e9, mid;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    if (check(mid)) lo = mid + 1;
    else hi = mid - 1;
  }
  cout << hi;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 1272 KB Output is correct
2 Correct 50 ms 512 KB Output is correct
3 Correct 50 ms 512 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 7 ms 384 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 8 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 640 KB Output is correct
2 Correct 129 ms 1272 KB Output is correct
3 Correct 52 ms 512 KB Output is correct
4 Correct 56 ms 640 KB Output is correct
5 Correct 56 ms 640 KB Output is correct
6 Correct 55 ms 512 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 8 ms 384 KB Output is correct
13 Correct 8 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 8 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 8 ms 512 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 8 ms 512 KB Output is correct
15 Correct 9 ms 512 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 56 ms 640 KB Output is correct
18 Correct 129 ms 1272 KB Output is correct
19 Correct 52 ms 512 KB Output is correct
20 Correct 56 ms 640 KB Output is correct
21 Correct 56 ms 640 KB Output is correct
22 Correct 55 ms 512 KB Output is correct
23 Correct 8 ms 512 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 8 ms 512 KB Output is correct
26 Correct 8 ms 512 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 8 ms 384 KB Output is correct
29 Correct 8 ms 384 KB Output is correct
30 Correct 51 ms 512 KB Output is correct
31 Correct 54 ms 760 KB Output is correct
32 Correct 76 ms 1272 KB Output is correct
33 Correct 53 ms 640 KB Output is correct
34 Correct 53 ms 564 KB Output is correct
35 Correct 54 ms 760 KB Output is correct
36 Correct 112 ms 1272 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 51 ms 512 KB Output is correct
40 Correct 52 ms 580 KB Output is correct
41 Correct 52 ms 512 KB Output is correct
42 Correct 52 ms 512 KB Output is correct
43 Correct 54 ms 512 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 9 ms 512 KB Output is correct
46 Correct 9 ms 512 KB Output is correct
47 Correct 10 ms 512 KB Output is correct
48 Correct 115 ms 1272 KB Output is correct
49 Correct 112 ms 1272 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 90 ms 1272 KB Output is correct
52 Correct 50 ms 512 KB Output is correct
53 Correct 50 ms 512 KB Output is correct
54 Correct 7 ms 384 KB Output is correct
55 Correct 7 ms 384 KB Output is correct
56 Correct 7 ms 384 KB Output is correct
57 Correct 8 ms 512 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 7 ms 384 KB Output is correct
60 Correct 7 ms 384 KB Output is correct
61 Correct 7 ms 384 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 8 ms 512 KB Output is correct