oj.uz

답안 #444404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444404 2021-07-14T03:00:15 Z mjhmjh1104 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 114 ms 1328 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int n, m, k, b[106][1006], s[106][1006];
long long dist[106][106], c[106][106], cost[106][106];

int main() {
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < n; i++) for (int j = 0; j < k; j++) scanf("%d%d", b[i] + j, s[i] + j);
    fill(dist[0], dist[105] + 106, (long long)1e9);
    for (int i = 0; i < m; i++) {
        int u, v, w;
        scanf("%d%d%d", &u, &v, &w);
        u--, v--;
        dist[u][v] = w;
    }
    for (int i = 0; i < 106; i++) dist[i][i] = 0;
    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]);
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {
        int curr = 0;
        for (int l = 0; l < k; l++) if (b[i][l] != -1 && s[j][l] != -1) curr = max(curr, s[j][l] - b[i][l]);
        c[i][j] = curr;
    }
    int l = 0, r = 1e9 + 5;
    while (l < r) {
        int m = (l + r + 1) / 2;
        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {
            if (dist[i][j] == (long long)1e9) cost[i][j] = 4e18;
            else cost[i][j] = m * dist[i][j] - c[i][j];
        }
        for (int i = 0; i < n; i++) cost[i][i] = 4e18;
        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], max(cost[i][k] + cost[k][j], (long long)-4e18));
        for (int i = 0; i < n; i++) if (cost[i][i] <= 0) {
            l = m;
            goto next;
        }
        r = m - 1;
        next:;
    }
    printf("%d", l);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:11:66: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     for (int i = 0; i < n; i++) for (int j = 0; j < k; j++) scanf("%d%d", b[i] + j, s[i] + j);
      |                                                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d%d%d", &u, &v, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 105 ms 1296 KB Output is correct
2 Correct 50 ms 1228 KB Output is correct
3 Correct 50 ms 1292 KB Output is correct
4 Correct 7 ms 840 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 7 ms 836 KB Output is correct
7 Correct 9 ms 840 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 10 ms 840 KB Output is correct
11 Correct 10 ms 844 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 10 ms 716 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 8 ms 844 KB Output is correct
4 Correct 8 ms 840 KB Output is correct
5 Correct 8 ms 716 KB Output is correct
6 Correct 8 ms 844 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 53 ms 1228 KB Output is correct
9 Correct 93 ms 1220 KB Output is correct
10 Correct 63 ms 1188 KB Output is correct
11 Correct 55 ms 1272 KB Output is correct
12 Correct 59 ms 1304 KB Output is correct
13 Correct 52 ms 1228 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 7 ms 840 KB Output is correct
3 Correct 8 ms 836 KB Output is correct
4 Correct 7 ms 820 KB Output is correct
5 Correct 8 ms 840 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 7 ms 836 KB Output is correct
8 Correct 8 ms 716 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 10 ms 716 KB Output is correct
11 Correct 11 ms 836 KB Output is correct
12 Correct 8 ms 716 KB Output is correct
13 Correct 8 ms 840 KB Output is correct
14 Correct 8 ms 840 KB Output is correct
15 Correct 13 ms 840 KB Output is correct
16 Correct 8 ms 844 KB Output is correct
17 Correct 53 ms 1228 KB Output is correct
18 Correct 93 ms 1220 KB Output is correct
19 Correct 63 ms 1188 KB Output is correct
20 Correct 55 ms 1272 KB Output is correct
21 Correct 59 ms 1304 KB Output is correct
22 Correct 52 ms 1228 KB Output is correct
23 Correct 8 ms 844 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 8 ms 840 KB Output is correct
27 Correct 8 ms 716 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 105 ms 1296 KB Output is correct
31 Correct 50 ms 1228 KB Output is correct
32 Correct 50 ms 1292 KB Output is correct
33 Correct 7 ms 840 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 7 ms 836 KB Output is correct
36 Correct 9 ms 840 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 8 ms 844 KB Output is correct
39 Correct 10 ms 840 KB Output is correct
40 Correct 10 ms 844 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 10 ms 716 KB Output is correct
43 Correct 52 ms 1304 KB Output is correct
44 Correct 53 ms 1228 KB Output is correct
45 Correct 85 ms 1200 KB Output is correct
46 Correct 54 ms 1228 KB Output is correct
47 Correct 69 ms 1192 KB Output is correct
48 Correct 53 ms 1228 KB Output is correct
49 Correct 91 ms 1220 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 50 ms 1228 KB Output is correct
53 Correct 55 ms 1228 KB Output is correct
54 Correct 53 ms 1228 KB Output is correct
55 Correct 51 ms 1228 KB Output is correct
56 Correct 53 ms 1228 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 9 ms 836 KB Output is correct
59 Correct 9 ms 844 KB Output is correct
60 Correct 9 ms 716 KB Output is correct
61 Correct 91 ms 1260 KB Output is correct
62 Correct 114 ms 1328 KB Output is correct
63 Correct 0 ms 332 KB Output is correct