oj.uz

Submission #549691

# Submission time Handle Problem Language Result Execution time Memory
549691 2022-04-16T10:19:56 Z krit3379 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 94 ms 4232 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 105
#define inf 1000000000000000000

long long dis[N][N],diss[N][N],b[N][1005],s[N][1005],p[N][N];

int main(){
    int n,m,item,i,j,k,u,v,l,r,mid;
    long long w;
    scanf("%d %d %d",&n,&m,&item);
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++)dis[i][j]=inf;
        for(j=1;j<=item;j++)scanf("%lld %lld",&b[i][j],&s[i][j]);
    }
    for(i=1;i<=m;i++){
        scanf("%d %d %lld",&u,&v,&w);
        dis[u][v]=w;
    }
    for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){
        dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
    }
    for(i=1;i<=n;i++)for(j=1;j<=n;j++)for(k=1;k<=item;k++){
        if(b[i][k]!=-1&&s[j][k]!=-1)p[i][j]=max(p[i][j],s[j][k]-b[i][k]);
    }
    l=1,r=1e9;
    while(l<=r){
        mid=(l+r)/2;
        for(i=1;i<=n;i++)for(j=1;j<=n;j++)diss[i][j]=mid*min(dis[i][j],inf/(long long)mid)-p[i][j];
        for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){
            diss[i][j]=min(diss[i][j],diss[i][k]+diss[k][j]);
        }
        for(i=1;i<=n;i++)if(diss[i][i]<=0)break;
        if(i<=n)l=mid+1;
        else r=mid-1;
    }
    printf("%d",r);
    return 0;
}

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 3412 KB Output is correct
2 Correct 31 ms 1280 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 692 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 7 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 692 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 6 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 692 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 6 ms 876 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 7 ms 832 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 6 ms 852 KB Output is correct
18 Correct 5 ms 832 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 852 KB Output is correct
21 Correct 6 ms 832 KB Output is correct
22 Correct 6 ms 852 KB Output is correct
23 Correct 6 ms 924 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 832 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 7 ms 828 KB Output is correct
31 Correct 5 ms 724 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 832 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 7 ms 828 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 42 ms 1644 KB Output is correct
9 Correct 84 ms 3768 KB Output is correct
10 Correct 34 ms 1484 KB Output is correct
11 Correct 38 ms 1704 KB Output is correct
12 Correct 37 ms 1620 KB Output is correct
13 Correct 34 ms 1492 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 5 ms 724 KB Output is correct
3 Correct 6 ms 876 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 7 ms 832 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 5 ms 832 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 6 ms 832 KB Output is correct
14 Correct 6 ms 852 KB Output is correct
15 Correct 6 ms 924 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 42 ms 1644 KB Output is correct
18 Correct 84 ms 3768 KB Output is correct
19 Correct 34 ms 1484 KB Output is correct
20 Correct 38 ms 1704 KB Output is correct
21 Correct 37 ms 1620 KB Output is correct
22 Correct 34 ms 1492 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 832 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 7 ms 828 KB Output is correct
29 Correct 5 ms 724 KB Output is correct
30 Correct 60 ms 3412 KB Output is correct
31 Correct 31 ms 1280 KB Output is correct
32 Correct 31 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 692 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 7 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 7 ms 692 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 44 ms 1364 KB Output is correct
44 Correct 48 ms 1568 KB Output is correct
45 Correct 58 ms 2608 KB Output is correct
46 Correct 34 ms 1492 KB Output is correct
47 Correct 35 ms 1584 KB Output is correct
48 Correct 34 ms 1472 KB Output is correct
49 Correct 92 ms 4088 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 35 ms 1236 KB Output is correct
53 Correct 36 ms 1428 KB Output is correct
54 Correct 34 ms 1344 KB Output is correct
55 Correct 37 ms 1364 KB Output is correct
56 Correct 38 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 9 ms 952 KB Output is correct
59 Correct 9 ms 980 KB Output is correct
60 Correct 8 ms 1004 KB Output is correct
61 Correct 94 ms 4232 KB Output is correct
62 Correct 93 ms 4064 KB Output is correct
63 Correct 1 ms 340 KB Output is correct