oj.uz

답안 #842631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
842631 2023-09-03T06:34:54 Z tch1cherin 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 88 ms 2652 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1LL << 60;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M, K;
  cin >> N >> M >> K;
  vector<vector<int>> B(N, vector<int>(K)), S(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<pair<int, int>>> G(N);
  for (int i = 0; i < M; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    G[u].push_back({v, w});
  }
  vector<vector<int>> profit(N, vector<int>(N));
  for (int i = 0; i < N; i++)
    for (int j = 0; j < N; j++)
      if (i != j)
        for (int k = 0; k < K; k++)
          if (S[j][k] != -1 && B[i][k] != -1)
            profit[i][j] = max(profit[i][j], S[j][k] - B[i][k]);

  vector<vector<long long>> dist(N, vector<long long>(N, INF));
  for (int u = 0; u < N; u++) {
    dist[u][u] = 0;
    for (auto [v, t] : G[u]) {
      dist[u][v] = t;
    }
  }
  for (int k = 0; k < N; k++)
    for (int i = 0; i < N; i++)
      for (int j = 0; j < N; j++)
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);

  int l = 0, r = 1 << 30;
  while (r > l + 1) {
    int mid = (l + r) / 2;
    vector<vector<long long>> cost(N, vector<long long>(N));
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        if (dist[i][j] == INF || i == j) {
          cost[i][j] = INF;
        } else {
          cost[i][j] = 1LL * dist[i][j] * mid - profit[i][j];
        }
      }
    }
    for (int k = 0; k < N; k++)
      for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++) {
          cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
          cost[i][j] = max(cost[i][j], -INF);
          cost[i][j] = min(cost[i][j], INF);
        }

    bool good = false;
    for (int i = 0; i < N; i++) {
      if (cost[i][i] <= 0) {
        good = true;
      }
    }
    if (good) {
      l = mid;
    } else {
      r = mid;
    }
  }
  cout << l << "\n";
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 1368 KB Output is correct
2 Correct 48 ms 604 KB Output is correct
3 Correct 39 ms 600 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 564 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 528 KB Output is correct
11 Correct 7 ms 520 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 6 ms 564 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 5 ms 528 KB Output is correct
6 Correct 7 ms 520 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 7 ms 348 KB Output is correct
11 Correct 5 ms 544 KB Output is correct
12 Correct 5 ms 348 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 516 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 5 ms 520 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 6 ms 348 KB Output is correct
21 Correct 5 ms 348 KB Output is correct
22 Correct 6 ms 532 KB Output is correct
23 Correct 6 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 6 ms 348 KB Output is correct
28 Correct 6 ms 540 KB Output is correct
29 Correct 6 ms 356 KB Output is correct
30 Correct 5 ms 348 KB Output is correct
31 Correct 6 ms 516 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 348 KB Output is correct
4 Correct 6 ms 540 KB Output is correct
5 Correct 6 ms 356 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 6 ms 516 KB Output is correct
8 Correct 44 ms 744 KB Output is correct
9 Correct 86 ms 1616 KB Output is correct
10 Correct 43 ms 692 KB Output is correct
11 Correct 46 ms 604 KB Output is correct
12 Correct 45 ms 604 KB Output is correct
13 Correct 42 ms 604 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 7 ms 348 KB Output is correct
3 Correct 5 ms 544 KB Output is correct
4 Correct 5 ms 348 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 516 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 5 ms 520 KB Output is correct
10 Correct 6 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 6 ms 532 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 44 ms 744 KB Output is correct
18 Correct 86 ms 1616 KB Output is correct
19 Correct 43 ms 692 KB Output is correct
20 Correct 46 ms 604 KB Output is correct
21 Correct 45 ms 604 KB Output is correct
22 Correct 42 ms 604 KB Output is correct
23 Correct 6 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 6 ms 540 KB Output is correct
27 Correct 6 ms 356 KB Output is correct
28 Correct 5 ms 348 KB Output is correct
29 Correct 6 ms 516 KB Output is correct
30 Correct 61 ms 1368 KB Output is correct
31 Correct 48 ms 604 KB Output is correct
32 Correct 39 ms 600 KB Output is correct
33 Correct 5 ms 348 KB Output is correct
34 Correct 5 ms 348 KB Output is correct
35 Correct 5 ms 348 KB Output is correct
36 Correct 6 ms 564 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 5 ms 348 KB Output is correct
39 Correct 5 ms 528 KB Output is correct
40 Correct 7 ms 520 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 6 ms 344 KB Output is correct
43 Correct 41 ms 604 KB Output is correct
44 Correct 47 ms 912 KB Output is correct
45 Correct 53 ms 1768 KB Output is correct
46 Correct 42 ms 604 KB Output is correct
47 Correct 42 ms 820 KB Output is correct
48 Correct 51 ms 604 KB Output is correct
49 Correct 86 ms 2640 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 456 KB Output is correct
52 Correct 41 ms 604 KB Output is correct
53 Correct 42 ms 1156 KB Output is correct
54 Correct 41 ms 744 KB Output is correct
55 Correct 41 ms 604 KB Output is correct
56 Correct 44 ms 604 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 7 ms 604 KB Output is correct
59 Correct 7 ms 604 KB Output is correct
60 Correct 7 ms 600 KB Output is correct
61 Correct 88 ms 2652 KB Output is correct
62 Correct 87 ms 2648 KB Output is correct
63 Correct 1 ms 344 KB Output is correct