답안 #551466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551466 2022-04-20T19:11:50 Z Ai7081 여행하는 상인 (APIO17_merchant) C++17
100 / 100
91 ms 2120 KB
#include <bits/stdc++.h>
using namespace std;
#define long long long

const int N = 105;
const int I = 1005;
const long inf = 1e18;

long n, m, item, x, y, z, dis[N][N], fin[N][N], val[N][N], b[N][I], s[N][I];

int main() {
    scanf(" %lld %lld %lld", &n, &m, &item);
    for (int i=1; i<=n; i++) for (int j=1; j<=item; j++) scanf(" %lld %lld", &b[i][j], &s[i][j]);
    fill_n(dis[0], N*N, inf);
    while (m--) {
        scanf(" %lld %lld %lld", &x, &y, &z);
        dis[x][y] = z;
    }
    for (int k=1; k<=n; k++) for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) {
        dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
    }
    for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) for (int k=1; k<=item; k++) {
        if (b[i][k]!=-1  && s[j][k]!=-1) val[i][j] = max(val[i][j], s[j][k] - b[i][k]);
    }
//    for (int i=1; i<=n; i++) {for (int j=1; j<=n; j++) printf("%lld " , dis[i][j]); printf("\n");}
//    for (int i=1; i<=n; i++) {for (int j=1; j<=n; j++) printf("%lld " , val[i][j]); printf("\n");}
    long l=1, r=1e9;
    while (l <= r) {
        long mid = (l+r)>>1;
//        printf("%lld %lld %lld\n", l, mid, r);
        for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) fin[i][j] = mid * min(dis[i][j], inf/mid) - val[i][j];
        for (int k=1; k<=n; k++) for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) {
            fin[i][j] = min(fin[i][j], fin[i][k] + fin[k][j]);
        }
        bool ok = false;
        for (int i=1; i<=n; i++) if (fin[i][i] <= 0) {ok=true; break;}
        if (ok) l = mid+1;
        else r = mid-1;
    }
    printf("%lld", r);
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf(" %lld %lld %lld", &n, &m, &item);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:13:63: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for (int i=1; i<=n; i++) for (int j=1; j<=item; j++) scanf(" %lld %lld", &b[i][j], &s[i][j]);
      |                                                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf(" %lld %lld %lld", &x, &y, &z);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 1996 KB Output is correct
2 Correct 32 ms 1236 KB Output is correct
3 Correct 34 ms 1236 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 892 KB Output is correct
10 Correct 5 ms 888 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 6 ms 924 KB Output is correct
20 Correct 6 ms 932 KB Output is correct
21 Correct 7 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 928 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 864 KB Output is correct
30 Correct 5 ms 852 KB Output is correct
31 Correct 5 ms 852 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 928 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 864 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 40 ms 1492 KB Output is correct
9 Correct 87 ms 2112 KB Output is correct
10 Correct 39 ms 1408 KB Output is correct
11 Correct 40 ms 1400 KB Output is correct
12 Correct 39 ms 1492 KB Output is correct
13 Correct 35 ms 1428 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 892 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 924 KB Output is correct
12 Correct 6 ms 932 KB Output is correct
13 Correct 7 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 40 ms 1492 KB Output is correct
18 Correct 87 ms 2112 KB Output is correct
19 Correct 39 ms 1408 KB Output is correct
20 Correct 40 ms 1400 KB Output is correct
21 Correct 39 ms 1492 KB Output is correct
22 Correct 35 ms 1428 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 928 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 864 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 58 ms 1996 KB Output is correct
31 Correct 32 ms 1236 KB Output is correct
32 Correct 34 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 5 ms 852 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 34 ms 1364 KB Output is correct
44 Correct 37 ms 1492 KB Output is correct
45 Correct 54 ms 2120 KB Output is correct
46 Correct 39 ms 1504 KB Output is correct
47 Correct 37 ms 1492 KB Output is correct
48 Correct 36 ms 1492 KB Output is correct
49 Correct 87 ms 2116 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 35 ms 1236 KB Output is correct
53 Correct 36 ms 1236 KB Output is correct
54 Correct 35 ms 1364 KB Output is correct
55 Correct 34 ms 1376 KB Output is correct
56 Correct 34 ms 1236 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 7 ms 852 KB Output is correct
59 Correct 7 ms 852 KB Output is correct
60 Correct 8 ms 852 KB Output is correct
61 Correct 91 ms 2096 KB Output is correct
62 Correct 91 ms 2092 KB Output is correct
63 Correct 0 ms 340 KB Output is correct