oj.uz

Submission #348975

# Submission time Handle Problem Language Result Execution time Memory
348975 2021-01-16T08:49:38 Z denkendoemeer Travelling Merchant (APIO17_merchant) C++14
100 / 100
 108 ms 4844 KB 
#include<bits/stdc++.h>
#define ll long long
const ll inf=1e18;
using namespace std;
int b[105][1005],s[105][1005],p[1005][1005];
ll dist[1005][1005],dp[1005][1005];
int main()
{
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int n,m,k,i,x,y,j,e;
    scanf("%d%d%d",&n,&m,&k);
    for(i=1;i<=n;i++)
        for(j=1;j<=k;j++)
            scanf("%d%d",&b[i][j],&s[i][j]);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(e=1;e<=k;e++)
                if (b[i][e]!=-1 && s[j][e]!=-1)
                    p[i][j]=max(p[i][j],s[j][e]-b[i][e]);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            dist[i][j]=inf;
    for(i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        scanf("%lld",&dist[x][y]);
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(e=1;e<=n;e++)
                dist[j][e]=min(dist[j][e],dist[j][i]+dist[i][e]);
    int st=1,dr=1e9,mij,ans=0;
    while(st<=dr){
        mij=(st+dr)/2;
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                dp[i][j]=1LL*mij*min(dist[i][j],inf/mij)-p[i][j];
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                for(e=1;e<=n;e++)
                    dp[j][e]=min(dp[j][e],dp[j][i]+dp[i][e]);
        for(i=1;i<=n;i++)
            if (dp[i][i]<=0)
                break;
        if (i<=n)
            ans=mij,st=mij+1;
        else
            dr=mij-1;
    }
    printf("%d\n",ans);
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("%d%d%d",&n,&m,&k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:15:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |             scanf("%d%d",&b[i][j],&s[i][j]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |         scanf("%d%d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~
merchant.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |         scanf("%lld",&dist[x][y]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 3436 KB Output is correct
2 Correct 38 ms 2176 KB Output is correct
3 Correct 39 ms 2156 KB Output is correct
4 Correct 9 ms 1132 KB Output is correct
5 Correct 8 ms 1132 KB Output is correct
6 Correct 6 ms 1132 KB Output is correct
7 Correct 7 ms 1260 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 6 ms 1132 KB Output is correct
10 Correct 6 ms 1132 KB Output is correct
11 Correct 6 ms 1132 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 7 ms 1260 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 6 ms 1260 KB Output is correct
3 Correct 7 ms 1388 KB Output is correct
4 Correct 6 ms 1388 KB Output is correct
5 Correct 7 ms 1388 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 6 ms 1260 KB Output is correct
8 Correct 9 ms 1388 KB Output is correct
9 Correct 7 ms 1260 KB Output is correct
10 Correct 7 ms 1260 KB Output is correct
11 Correct 8 ms 1388 KB Output is correct
12 Correct 8 ms 1388 KB Output is correct
13 Correct 7 ms 1388 KB Output is correct
14 Correct 7 ms 1388 KB Output is correct
15 Correct 8 ms 1388 KB Output is correct
16 Correct 6 ms 1260 KB Output is correct
17 Correct 8 ms 1388 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 8 ms 1388 KB Output is correct
20 Correct 10 ms 1388 KB Output is correct
21 Correct 8 ms 1388 KB Output is correct
22 Correct 7 ms 1388 KB Output is correct
23 Correct 6 ms 1388 KB Output is correct
24 Correct 6 ms 1132 KB Output is correct
25 Correct 7 ms 1260 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 6 ms 1132 KB Output is correct
28 Correct 6 ms 1132 KB Output is correct
29 Correct 6 ms 1132 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 7 ms 1260 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2572 KB Output is correct
2 Correct 99 ms 4332 KB Output is correct
3 Correct 42 ms 2540 KB Output is correct
4 Correct 48 ms 2816 KB Output is correct
5 Correct 46 ms 2668 KB Output is correct
6 Correct 45 ms 2540 KB Output is correct
7 Correct 8 ms 1388 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 8 ms 1388 KB Output is correct
10 Correct 10 ms 1388 KB Output is correct
11 Correct 8 ms 1388 KB Output is correct
12 Correct 7 ms 1388 KB Output is correct
13 Correct 6 ms 1388 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1280 KB Output is correct
2 Correct 6 ms 1260 KB Output is correct
3 Correct 7 ms 1388 KB Output is correct
4 Correct 6 ms 1388 KB Output is correct
5 Correct 7 ms 1388 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 6 ms 1260 KB Output is correct
8 Correct 9 ms 1388 KB Output is correct
9 Correct 7 ms 1260 KB Output is correct
10 Correct 7 ms 1260 KB Output is correct
11 Correct 8 ms 1388 KB Output is correct
12 Correct 8 ms 1388 KB Output is correct
13 Correct 7 ms 1388 KB Output is correct
14 Correct 7 ms 1388 KB Output is correct
15 Correct 8 ms 1388 KB Output is correct
16 Correct 6 ms 1260 KB Output is correct
17 Correct 59 ms 2572 KB Output is correct
18 Correct 99 ms 4332 KB Output is correct
19 Correct 42 ms 2540 KB Output is correct
20 Correct 48 ms 2816 KB Output is correct
21 Correct 46 ms 2668 KB Output is correct
22 Correct 45 ms 2540 KB Output is correct
23 Correct 8 ms 1388 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 8 ms 1388 KB Output is correct
26 Correct 10 ms 1388 KB Output is correct
27 Correct 8 ms 1388 KB Output is correct
28 Correct 7 ms 1388 KB Output is correct
29 Correct 6 ms 1388 KB Output is correct
30 Correct 51 ms 2304 KB Output is correct
31 Correct 43 ms 2552 KB Output is correct
32 Correct 63 ms 3052 KB Output is correct
33 Correct 50 ms 2668 KB Output is correct
34 Correct 43 ms 2540 KB Output is correct
35 Correct 43 ms 2540 KB Output is correct
36 Correct 107 ms 4460 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 640 KB Output is correct
39 Correct 39 ms 2156 KB Output is correct
40 Correct 42 ms 2412 KB Output is correct
41 Correct 45 ms 2412 KB Output is correct
42 Correct 40 ms 2156 KB Output is correct
43 Correct 39 ms 2156 KB Output is correct
44 Correct 1 ms 492 KB Output is correct
45 Correct 9 ms 1536 KB Output is correct
46 Correct 9 ms 1436 KB Output is correct
47 Correct 9 ms 1516 KB Output is correct
48 Correct 108 ms 4844 KB Output is correct
49 Correct 108 ms 4588 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 70 ms 3436 KB Output is correct
52 Correct 38 ms 2176 KB Output is correct
53 Correct 39 ms 2156 KB Output is correct
54 Correct 9 ms 1132 KB Output is correct
55 Correct 8 ms 1132 KB Output is correct
56 Correct 6 ms 1132 KB Output is correct
57 Correct 7 ms 1260 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 6 ms 1132 KB Output is correct
60 Correct 6 ms 1132 KB Output is correct
61 Correct 6 ms 1132 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 7 ms 1260 KB Output is correct