oj.uz

Submission #109315

# Submission time Handle Problem Language Result Execution time Memory
109315 2019-05-06T06:49:40 Z PeppaPig Travelling Merchant (APIO17_merchant) C++14
100 / 100
 116 ms 4248 KB 
#include <bits/stdc++.h>

#define long long long
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 105;

int n, m, K;
long B[N][1005], S[N][1005];
long d[N][N], profit[N][N], dp[N][N];

bool chk(long mid) {
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
        dp[i][j] = profit[i][j] - d[i][j] * mid;
    for(int i = 1; i <= n; i++) dp[i][i] = -1e9;
    for(int k = 1; k <= n; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
        dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
    for(int i = 1; i <= n; i++) if(dp[i][i] >= 0) return true;
    return false;
}

int main() {
    fill_n(d[0], N*N, 1e9);
    scanf("%d %d %d", &n, &m, &K);
    for(int i = 1; i <= n; i++) for(int j = 1; j <= K; j++) scanf("%lld %lld", &B[i][j], &S[i][j]);
    for(int i = 1, a, b, c; i <= m; i++) {
        scanf("%d %d %d", &a, &b, &c);
        d[a][b] = c;
    }
    for(int i = 1; i <= n; i++) d[i][i] = 0;
    for(int k = 1; k <= n; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++)
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) for(int k = 1; k <= K; k++)
        if(~S[j][k] && ~B[i][k]) profit[i][j] = max(profit[i][j], S[j][k] - B[i][k]);
    
    long l = 0, r = 1e9;
    while(l < r) {
        long mid = (l + r + 1) >> 1;
        if(chk(mid)) l = mid;
        else r = mid-1;
    }
    printf("%lld\n", l);

    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &m, &K);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:29:66: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; i++) for(int j = 1; j <= K; j++) scanf("%lld %lld", &B[i][j], &S[i][j]);
                                                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 2296 KB Output is correct
2 Correct 43 ms 1280 KB Output is correct
3 Correct 37 ms 1280 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 9 ms 896 KB Output is correct
6 Correct 10 ms 948 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 8 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 8 ms 1024 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1536 KB Output is correct
2 Correct 106 ms 3960 KB Output is correct
3 Correct 64 ms 1536 KB Output is correct
4 Correct 44 ms 1792 KB Output is correct
5 Correct 47 ms 1792 KB Output is correct
6 Correct 42 ms 1536 KB Output is correct
7 Correct 9 ms 1152 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 11 ms 1024 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 11 ms 1024 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 896 KB Output is correct
2 Correct 8 ms 896 KB Output is correct
3 Correct 10 ms 896 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 9 ms 1024 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 11 ms 896 KB Output is correct
9 Correct 10 ms 964 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 10 ms 1024 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 9 ms 868 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 11 ms 1024 KB Output is correct
16 Correct 12 ms 896 KB Output is correct
17 Correct 50 ms 1536 KB Output is correct
18 Correct 106 ms 3960 KB Output is correct
19 Correct 64 ms 1536 KB Output is correct
20 Correct 44 ms 1792 KB Output is correct
21 Correct 47 ms 1792 KB Output is correct
22 Correct 42 ms 1536 KB Output is correct
23 Correct 9 ms 1152 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 11 ms 1024 KB Output is correct
26 Correct 11 ms 1024 KB Output is correct
27 Correct 11 ms 1024 KB Output is correct
28 Correct 9 ms 896 KB Output is correct
29 Correct 8 ms 896 KB Output is correct
30 Correct 42 ms 1408 KB Output is correct
31 Correct 56 ms 1700 KB Output is correct
32 Correct 67 ms 2680 KB Output is correct
33 Correct 55 ms 1656 KB Output is correct
34 Correct 47 ms 1784 KB Output is correct
35 Correct 47 ms 1664 KB Output is correct
36 Correct 102 ms 4216 KB Output is correct
37 Correct 3 ms 512 KB Output is correct
38 Correct 2 ms 512 KB Output is correct
39 Correct 43 ms 1408 KB Output is correct
40 Correct 46 ms 1508 KB Output is correct
41 Correct 42 ms 1408 KB Output is correct
42 Correct 38 ms 1484 KB Output is correct
43 Correct 51 ms 1416 KB Output is correct
44 Correct 2 ms 512 KB Output is correct
45 Correct 16 ms 1024 KB Output is correct
46 Correct 12 ms 1140 KB Output is correct
47 Correct 15 ms 1024 KB Output is correct
48 Correct 116 ms 4216 KB Output is correct
49 Correct 111 ms 4248 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 70 ms 2296 KB Output is correct
52 Correct 43 ms 1280 KB Output is correct
53 Correct 37 ms 1280 KB Output is correct
54 Correct 8 ms 896 KB Output is correct
55 Correct 9 ms 896 KB Output is correct
56 Correct 10 ms 948 KB Output is correct
57 Correct 8 ms 1024 KB Output is correct
58 Correct 3 ms 512 KB Output is correct
59 Correct 8 ms 896 KB Output is correct
60 Correct 8 ms 896 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 8 ms 1024 KB Output is correct