oj.uz

답안 #165463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165463 2019-11-27T10:49:04 Z fedoseevtimofey 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 140 ms 3420 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
const int Inf = 1e9;
 
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif 
  int n, m, k;
  cin >> n >> m >> k;
  vector <vector <int>> s(n, vector <int> (k)), b(n, vector <int> (k));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < k; ++j) {
      cin >> b[i][j] >> s[i][j];
    }
  }
  vector <vector <int>> d(n, vector <int> (n, Inf));
  for (int i = 0; i < m; ++i) {
    int u, v, x;
    cin >> u >> v >> x;
    --u, --v;
    d[u][v] = x;
  }
  for (int k = 0; k < n; ++k) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
  vector <vector <int>> best(n, vector <int> (n, 0));
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int id = 0; id < k; ++id) {
        if (s[j][id] != -1 && b[i][id] != -1) best[i][j] = max(best[i][j], s[j][id] - b[i][id]);
      }
    }
  }
  vector <vector <ll>> w(n, vector <ll> (n));
  int l = 0, r = 1e9 + 7;
  while (r - l > 1) {
    int m = (l + r) >> 1;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        w[i][j] = best[i][j] - (ll)m * d[i][j];
      }
    }
    bool fl = false;
    for (int k = 0; k < n; ++k) {
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
          if (i == j && w[i][k] + w[k][i] >= 0) fl = true;
          w[i][j] = max(w[i][j], w[i][k] + w[k][j]);
        }
      }
    }
    if (fl) l = m;
    else r = m;
  }
  cout << l << '\n';
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 1272 KB Output is correct
2 Correct 45 ms 504 KB Output is correct
3 Correct 47 ms 504 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 8 ms 380 KB Output is correct
7 Correct 9 ms 504 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 9 ms 376 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 9 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 9 ms 376 KB Output is correct
8 Correct 9 ms 376 KB Output is correct
9 Correct 9 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 10 ms 380 KB Output is correct
12 Correct 10 ms 376 KB Output is correct
13 Correct 9 ms 376 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 11 ms 504 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 10 ms 504 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 20 ms 504 KB Output is correct
20 Correct 10 ms 504 KB Output is correct
21 Correct 9 ms 504 KB Output is correct
22 Correct 9 ms 376 KB Output is correct
23 Correct 9 ms 376 KB Output is correct
24 Correct 8 ms 380 KB Output is correct
25 Correct 9 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 9 ms 376 KB Output is correct
28 Correct 8 ms 376 KB Output is correct
29 Correct 8 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 9 ms 376 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 760 KB Output is correct
2 Correct 126 ms 3036 KB Output is correct
3 Correct 52 ms 632 KB Output is correct
4 Correct 56 ms 760 KB Output is correct
5 Correct 56 ms 760 KB Output is correct
6 Correct 51 ms 632 KB Output is correct
7 Correct 10 ms 504 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 20 ms 504 KB Output is correct
10 Correct 10 ms 504 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 9 ms 376 KB Output is correct
13 Correct 9 ms 376 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 9 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 10 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 9 ms 376 KB Output is correct
8 Correct 9 ms 376 KB Output is correct
9 Correct 9 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 10 ms 380 KB Output is correct
12 Correct 10 ms 376 KB Output is correct
13 Correct 9 ms 376 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 11 ms 504 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 64 ms 760 KB Output is correct
18 Correct 126 ms 3036 KB Output is correct
19 Correct 52 ms 632 KB Output is correct
20 Correct 56 ms 760 KB Output is correct
21 Correct 56 ms 760 KB Output is correct
22 Correct 51 ms 632 KB Output is correct
23 Correct 10 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 20 ms 504 KB Output is correct
26 Correct 10 ms 504 KB Output is correct
27 Correct 9 ms 504 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 9 ms 376 KB Output is correct
30 Correct 48 ms 596 KB Output is correct
31 Correct 50 ms 632 KB Output is correct
32 Correct 67 ms 1656 KB Output is correct
33 Correct 50 ms 632 KB Output is correct
34 Correct 54 ms 632 KB Output is correct
35 Correct 50 ms 632 KB Output is correct
36 Correct 135 ms 3304 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 47 ms 504 KB Output is correct
40 Correct 51 ms 684 KB Output is correct
41 Correct 49 ms 760 KB Output is correct
42 Correct 48 ms 632 KB Output is correct
43 Correct 47 ms 504 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 11 ms 504 KB Output is correct
46 Correct 11 ms 504 KB Output is correct
47 Correct 11 ms 504 KB Output is correct
48 Correct 136 ms 3320 KB Output is correct
49 Correct 140 ms 3420 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 81 ms 1272 KB Output is correct
52 Correct 45 ms 504 KB Output is correct
53 Correct 47 ms 504 KB Output is correct
54 Correct 8 ms 376 KB Output is correct
55 Correct 8 ms 376 KB Output is correct
56 Correct 8 ms 380 KB Output is correct
57 Correct 9 ms 504 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 9 ms 376 KB Output is correct
60 Correct 8 ms 376 KB Output is correct
61 Correct 8 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 9 ms 376 KB Output is correct