oj.uz

Submission #234144

# Submission time Handle Problem Language Result Execution time Memory
234144 2020-05-23T10:16:27 Z rama_pang Travelling Merchant (APIO17_merchant) C++14
100 / 100
 178 ms 3448 KB 
#include <bits/stdc++.h>
using namespace std;

const long long inf = 1e18;

int N, M, K;
int B[105][1005];
int S[105][1005];

int dist[105][105];
int profit[105][105];

void Read() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  cin >> N >> M >> K;
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= K; j++) {
      cin >> B[i][j] >> S[i][j];
    }
    for (int j = 1; j <= N; j++) {
      dist[i][j] = 1e9 + 100;
    }
  }
  for (int i = 0; i < M; i++) {
    int u, v, t;
    cin >> u >> v >> t;
    dist[u][v] = t;
  }
}

void FloydWarshall() {
  for (int k = 1; k <= N; k++) {
    for (int i = 1; i <= N; i++) {
      for (int j = 1; j <= N; j++) {
        if (dist[i][j] > dist[i][k] + dist[k][j]) {
          dist[i][j] = dist[i][k] + dist[k][j];
        }
      }
    }
  }
  for (int k = 1; k <= K; k++) {
    for (int i = 1; i <= N; i++) {
      for (int j = 1; j <= N; j++) {
        if (S[j][k] == -1 || B[i][k] == -1) continue;
        profit[i][j] = max(profit[i][j], S[j][k] - B[i][k]);
      }
    }
  }
}

bool Check(int r) {
  // profit / dist >= r -> profit - r * dist >= 0
  long long chk[105][105];
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= N; j++) {
      if (i == j) {
        chk[i][j] = -inf;
      } else {
        chk[i][j] = max(-inf, 1ll * profit[i][j] - 1ll * r * dist[i][j]);
      }
    }
  }
  for (int rep = 0; rep < 2; rep++) {
    for (int k = 1; k <= N; k++) {
      for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
          if (chk[i][j] < chk[i][k] + chk[k][j]) {
            chk[i][j] = min(inf, chk[i][k] + chk[k][j]);
          }
          if (chk[j][j] >= 0) {
            return true;
          }
        }
      }
    }
  }
  return false;
}

int main() {
  Read();
  FloydWarshall();
  
  int lo = 0, hi = 1e9 + 100;
  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 125 ms 1400 KB Output is correct
2 Correct 90 ms 1280 KB Output is correct
3 Correct 54 ms 1280 KB Output is correct
4 Correct 15 ms 768 KB Output is correct
5 Correct 13 ms 768 KB Output is correct
6 Correct 16 ms 768 KB Output is correct
7 Correct 13 ms 896 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 11 ms 768 KB Output is correct
10 Correct 12 ms 768 KB Output is correct
11 Correct 12 ms 768 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 16 ms 768 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 1528 KB Output is correct
2 Correct 178 ms 1400 KB Output is correct
3 Correct 112 ms 1408 KB Output is correct
4 Correct 151 ms 1660 KB Output is correct
5 Correct 119 ms 1536 KB Output is correct
6 Correct 80 ms 1408 KB Output is correct
7 Correct 24 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 21 ms 896 KB Output is correct
10 Correct 16 ms 896 KB Output is correct
11 Correct 18 ms 896 KB Output is correct
12 Correct 14 ms 896 KB Output is correct
13 Correct 14 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 768 KB Output is correct
2 Correct 14 ms 896 KB Output is correct
3 Correct 15 ms 768 KB Output is correct
4 Correct 14 ms 768 KB Output is correct
5 Correct 21 ms 916 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 14 ms 896 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 11 ms 768 KB Output is correct
10 Correct 12 ms 896 KB Output is correct
11 Correct 15 ms 896 KB Output is correct
12 Correct 17 ms 896 KB Output is correct
13 Correct 13 ms 896 KB Output is correct
14 Correct 14 ms 896 KB Output is correct
15 Correct 13 ms 896 KB Output is correct
16 Correct 13 ms 768 KB Output is correct
17 Correct 135 ms 1528 KB Output is correct
18 Correct 178 ms 1400 KB Output is correct
19 Correct 112 ms 1408 KB Output is correct
20 Correct 151 ms 1660 KB Output is correct
21 Correct 119 ms 1536 KB Output is correct
22 Correct 80 ms 1408 KB Output is correct
23 Correct 24 ms 896 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 21 ms 896 KB Output is correct
26 Correct 16 ms 896 KB Output is correct
27 Correct 18 ms 896 KB Output is correct
28 Correct 14 ms 896 KB Output is correct
29 Correct 14 ms 896 KB Output is correct
30 Correct 83 ms 1352 KB Output is correct
31 Correct 88 ms 1412 KB Output is correct
32 Correct 86 ms 1912 KB Output is correct
33 Correct 83 ms 1396 KB Output is correct
34 Correct 79 ms 1408 KB Output is correct
35 Correct 85 ms 1408 KB Output is correct
36 Correct 154 ms 3400 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 78 ms 1280 KB Output is correct
40 Correct 84 ms 1408 KB Output is correct
41 Correct 84 ms 1280 KB Output is correct
42 Correct 76 ms 1280 KB Output is correct
43 Correct 74 ms 1280 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 21 ms 896 KB Output is correct
46 Correct 17 ms 896 KB Output is correct
47 Correct 15 ms 896 KB Output is correct
48 Correct 137 ms 3448 KB Output is correct
49 Correct 137 ms 3320 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 125 ms 1400 KB Output is correct
52 Correct 90 ms 1280 KB Output is correct
53 Correct 54 ms 1280 KB Output is correct
54 Correct 15 ms 768 KB Output is correct
55 Correct 13 ms 768 KB Output is correct
56 Correct 16 ms 768 KB Output is correct
57 Correct 13 ms 896 KB Output is correct
58 Correct 4 ms 384 KB Output is correct
59 Correct 11 ms 768 KB Output is correct
60 Correct 12 ms 768 KB Output is correct
61 Correct 12 ms 768 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 16 ms 768 KB Output is correct