oj.uz

Submission #221636

# Submission time Handle Problem Language Result Execution time Memory
221636 2020-04-10T15:23:25 Z MKopchev Travelling Merchant (APIO17_merchant) C++14
100 / 100
 122 ms 3448 KB 
#include<bits/stdc++.h>
using namespace std;

const int nmax=1e2+5,kmax=1e3+5,inf=1e9+42;

int n,m,k;

int cost[2][nmax][kmax];

int dist[nmax][nmax];

int max_gain[nmax][nmax];

long long current_edges[nmax][nmax],current_dists[nmax][nmax];

bool can(int test)
{
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            current_edges[i][j]=max_gain[i][j]-1LL*test*dist[i][j];
            current_dists[i][j]=current_edges[i][j];
        }

    for(int p=1;p<=n;p++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                current_dists[i][j]=max(current_dists[i][j],current_dists[i][p]+current_dists[p][j]);

    for(int i=1;i<=n;i++)
        if(current_dists[i][i]>=0)return 1;
    return 0;
}
int main()
{
    scanf("%i%i%i",&n,&m,&k);

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            dist[i][j]=inf;

    for(int i=1;i<=n;i++)
        for(int j=1;j<=k;j++)
            for(int t=0;t<2;t++)
                scanf("%i",&cost[t][i][j]);

    int u,v,c;

    for(int i=1;i<=m;i++)
    {
        scanf("%i%i%i",&u,&v,&c);
        dist[u][v]=min(dist[u][v],c);
    }

    for(int p=1;p<=n;p++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                dist[i][j]=min(dist[i][j],dist[i][p]+dist[p][j]);

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(dist[i][j]!=inf)
            {
                for(int p=1;p<=k;p++)
                    if(cost[0][i][p]!=-1&&cost[1][j][p]!=-1)max_gain[i][j]=max(max_gain[i][j],cost[1][j][p]-cost[0][i][p]);
            }


    int ok=0,not_ok=inf;

    while(not_ok-ok>1)
    {
        int av=(ok+not_ok)/2;
        if(can(av))ok=av;
        else not_ok=av;
    }

    printf("%i\n",ok);
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i%i",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:45:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%i",&cost[t][i][j]);
                 ~~~~~^~~~~~~~~~~~~~~~~~~~~
merchant.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i%i",&u,&v,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 2552 KB Output is correct
2 Correct 41 ms 1280 KB Output is correct
3 Correct 42 ms 1408 KB Output is correct
4 Correct 10 ms 768 KB Output is correct
5 Correct 10 ms 768 KB Output is correct
6 Correct 10 ms 768 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 10 ms 768 KB Output is correct
10 Correct 10 ms 768 KB Output is correct
11 Correct 10 ms 768 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1460 KB Output is correct
2 Correct 115 ms 3192 KB Output is correct
3 Correct 45 ms 1536 KB Output is correct
4 Correct 50 ms 1536 KB Output is correct
5 Correct 48 ms 1536 KB Output is correct
6 Correct 45 ms 1408 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 10 ms 896 KB Output is correct
13 Correct 10 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 896 KB Output is correct
4 Correct 10 ms 768 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 11 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 12 ms 896 KB Output is correct
16 Correct 10 ms 896 KB Output is correct
17 Correct 48 ms 1460 KB Output is correct
18 Correct 115 ms 3192 KB Output is correct
19 Correct 45 ms 1536 KB Output is correct
20 Correct 50 ms 1536 KB Output is correct
21 Correct 48 ms 1536 KB Output is correct
22 Correct 45 ms 1408 KB Output is correct
23 Correct 11 ms 896 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 11 ms 896 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 10 ms 896 KB Output is correct
30 Correct 44 ms 1408 KB Output is correct
31 Correct 46 ms 1408 KB Output is correct
32 Correct 68 ms 1912 KB Output is correct
33 Correct 46 ms 1456 KB Output is correct
34 Correct 45 ms 1408 KB Output is correct
35 Correct 47 ms 1516 KB Output is correct
36 Correct 119 ms 3320 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 43 ms 1408 KB Output is correct
40 Correct 45 ms 1528 KB Output is correct
41 Correct 43 ms 1408 KB Output is correct
42 Correct 43 ms 1408 KB Output is correct
43 Correct 44 ms 1400 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 13 ms 1024 KB Output is correct
46 Correct 13 ms 896 KB Output is correct
47 Correct 12 ms 896 KB Output is correct
48 Correct 121 ms 3448 KB Output is correct
49 Correct 122 ms 3448 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 77 ms 2552 KB Output is correct
52 Correct 41 ms 1280 KB Output is correct
53 Correct 42 ms 1408 KB Output is correct
54 Correct 10 ms 768 KB Output is correct
55 Correct 10 ms 768 KB Output is correct
56 Correct 10 ms 768 KB Output is correct
57 Correct 11 ms 896 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 10 ms 768 KB Output is correct
60 Correct 10 ms 768 KB Output is correct
61 Correct 10 ms 768 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 10 ms 896 KB Output is correct