oj.uz

Submission #155118

# Submission time Handle Problem Language Result Execution time Memory
155118 2019-09-26T11:39:06 Z mhy908 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 112 ms 4268 KB 
#include <bits/stdc++.h>
#define inf 1987654321
using namespace std;
typedef long long LL;
int n, m, k;
LL buy[110][1010], sell[110][1010];
LL floyd[110][110];
LL cost[110][110];
LL edge[110][110];
bool negcycle()
{
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                edge[i][j]=min(edge[i][j], edge[i][k]+edge[k][j]);
            }
        }
    }
    bool ret=false;
    for(int i=1; i<=n; i++){
        if(edge[i][i]<=0)ret=true;
    }
    return ret;
}
LL binsearch(LL a, LL b){
    if(a==b)return a;
    LL mid=(a+b)/2+1;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            edge[i][j]=min((LL)inf, mid*floyd[i][j]-cost[i][j]);
        }
    }
    if(negcycle())return binsearch(mid, b);
    return binsearch(a, mid-1);
}
int main()
{
    scanf("%d %d %d", &n, &m, &k);
    for(int i=1; i<=n; i++)
        for(int j=1; j<=k; j++)
            scanf("%lld %lld", &buy[i][j], &sell[i][j]);
    for(int i=1; i<=n; i++)for(int j=1; j<=n; j++)floyd[i][j]=inf;
    for(int i=1; i<=m; i++){
        int a, b;
        LL c;
        scanf("%d %d %lld", &a, &b, &c);
        floyd[a][b]=min(floyd[a][b], c);
    }
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                floyd[i][j]=min(floyd[i][j], floyd[i][k]+floyd[k][j]);
            }
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            for(int z=1; z<=k; z++){
                if(sell[j][z]>=0&&buy[i][z]>=0)cost[i][j]=max(cost[i][j], sell[j][z]-buy[i][z]);
            }
        }
    }
    printf("%lld", binsearch(0, 1000000000));
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:38: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:41:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld %lld", &buy[i][j], &sell[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 3320 KB Output is correct
2 Correct 43 ms 1272 KB Output is correct
3 Correct 42 ms 1272 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 888 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 9 ms 760 KB Output is correct
11 Correct 8 ms 760 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 9 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 9 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 9 ms 936 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 892 KB Output is correct
15 Correct 10 ms 1016 KB Output is correct
16 Correct 9 ms 888 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 9 ms 888 KB Output is correct
21 Correct 9 ms 888 KB Output is correct
22 Correct 9 ms 888 KB Output is correct
23 Correct 8 ms 888 KB Output is correct
24 Correct 8 ms 888 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 888 KB Output is correct
28 Correct 9 ms 760 KB Output is correct
29 Correct 8 ms 760 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 9 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1784 KB Output is correct
2 Correct 100 ms 3880 KB Output is correct
3 Correct 45 ms 1656 KB Output is correct
4 Correct 49 ms 1784 KB Output is correct
5 Correct 50 ms 1784 KB Output is correct
6 Correct 45 ms 1656 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 9 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 9 ms 888 KB Output is correct
4 Correct 8 ms 888 KB Output is correct
5 Correct 9 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 9 ms 936 KB Output is correct
9 Correct 8 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 10 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 9 ms 888 KB Output is correct
14 Correct 9 ms 892 KB Output is correct
15 Correct 10 ms 1016 KB Output is correct
16 Correct 9 ms 888 KB Output is correct
17 Correct 48 ms 1784 KB Output is correct
18 Correct 100 ms 3880 KB Output is correct
19 Correct 45 ms 1656 KB Output is correct
20 Correct 49 ms 1784 KB Output is correct
21 Correct 50 ms 1784 KB Output is correct
22 Correct 45 ms 1656 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 9 ms 888 KB Output is correct
27 Correct 9 ms 888 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 8 ms 888 KB Output is correct
30 Correct 43 ms 1472 KB Output is correct
31 Correct 62 ms 1752 KB Output is correct
32 Correct 65 ms 2680 KB Output is correct
33 Correct 46 ms 1652 KB Output is correct
34 Correct 46 ms 1640 KB Output is correct
35 Correct 44 ms 1528 KB Output is correct
36 Correct 107 ms 4160 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 44 ms 1428 KB Output is correct
40 Correct 47 ms 1528 KB Output is correct
41 Correct 45 ms 1400 KB Output is correct
42 Correct 43 ms 1400 KB Output is correct
43 Correct 43 ms 1400 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 10 ms 1016 KB Output is correct
46 Correct 11 ms 1016 KB Output is correct
47 Correct 11 ms 1016 KB Output is correct
48 Correct 110 ms 4216 KB Output is correct
49 Correct 112 ms 4268 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 77 ms 3320 KB Output is correct
52 Correct 43 ms 1272 KB Output is correct
53 Correct 42 ms 1272 KB Output is correct
54 Correct 8 ms 760 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 888 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 8 ms 888 KB Output is correct
60 Correct 9 ms 760 KB Output is correct
61 Correct 8 ms 760 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 9 ms 888 KB Output is correct