oj.uz

Submission #309922

# Submission time Handle Problem Language Result Execution time Memory
309922 2020-10-05T01:42:07 Z vipghn2003 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 135 ms 2296 KB 
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;

const int N=105;
const int K=1005;
int n,m,k,d[N][N],buy[N][K],sell[N][K],opt[N][N],w[N][N];

bool check(int lim)
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            w[i][j]=-3e18;
            if(d[i][j]==3e18) continue;
            int dist=d[i][j];
            int gain=opt[i][j];
            w[i][j]=gain-dist*lim;
        }
    }
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                w[i][j]=max(w[i][j],w[i][k]+w[k][j]);
                if(w[i][j]>=3e18) w[i][j]=3e18;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++) if(w[i][j]+w[j][i]>=0) return true;
    }
    return false;
}

main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=k;j++) cin>>buy[i][j]>>sell[i][j];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++) d[i][j]=3e18;
    }
    while(m--)
    {
        int u,v,w;
        cin>>u>>v>>w;
        d[u][v]=w;
    }
    for(int u=1;u<=n;u++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                int val=d[i][u]+d[u][j];
                d[i][j]=min(d[i][j],val);
            }
        }
    }
    for(int u=1;u<=n;u++)
    {
        for(int v=1;v<=n;v++)
        {
            opt[u][v]=0;
            for(int item=1;item<=k;item++)
            {
                if(buy[u][item]==-1||sell[v][item]==-1) continue;
                opt[u][v]=max(opt[u][v],sell[v][item]-buy[u][item]);
            }
        }
    }
    int l=1,r=1e9,res=0;
    while(l<=r)
    {
        int mid=(l+r)/2;
        if(check(mid))
        {
            res=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    cout<<res;
}

Compilation message

merchant.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main()
      |      ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 2296 KB Output is correct
2 Correct 69 ms 1408 KB Output is correct
3 Correct 69 ms 1408 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 10 ms 1024 KB Output is correct
12 Correct 1 ms 384 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 1024 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 11 ms 1024 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 12 ms 1024 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 11 ms 896 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 11 ms 1024 KB Output is correct
18 Correct 0 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 12 ms 896 KB Output is correct
22 Correct 10 ms 896 KB Output is correct
23 Correct 10 ms 928 KB Output is correct
24 Correct 10 ms 896 KB Output is correct
25 Correct 10 ms 896 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 10 ms 896 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 10 ms 1024 KB Output is correct
30 Correct 1 ms 384 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 74 ms 1536 KB Output is correct
2 Correct 131 ms 2296 KB Output is correct
3 Correct 73 ms 1408 KB Output is correct
4 Correct 76 ms 1536 KB Output is correct
5 Correct 77 ms 1536 KB Output is correct
6 Correct 72 ms 1408 KB Output is correct
7 Correct 11 ms 1024 KB Output is correct
8 Correct 0 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 12 ms 896 KB Output is correct
12 Correct 10 ms 896 KB Output is correct
13 Correct 10 ms 928 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 1024 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 11 ms 1024 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 12 ms 1024 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Correct 10 ms 896 KB Output is correct
15 Correct 11 ms 896 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 74 ms 1536 KB Output is correct
18 Correct 131 ms 2296 KB Output is correct
19 Correct 73 ms 1408 KB Output is correct
20 Correct 76 ms 1536 KB Output is correct
21 Correct 77 ms 1536 KB Output is correct
22 Correct 72 ms 1408 KB Output is correct
23 Correct 11 ms 1024 KB Output is correct
24 Correct 0 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 12 ms 896 KB Output is correct
28 Correct 10 ms 896 KB Output is correct
29 Correct 10 ms 928 KB Output is correct
30 Correct 69 ms 1408 KB Output is correct
31 Correct 74 ms 1536 KB Output is correct
32 Correct 93 ms 2176 KB Output is correct
33 Correct 72 ms 1536 KB Output is correct
34 Correct 72 ms 1536 KB Output is correct
35 Correct 73 ms 1536 KB Output is correct
36 Correct 128 ms 2168 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 69 ms 1408 KB Output is correct
40 Correct 72 ms 1528 KB Output is correct
41 Correct 78 ms 1528 KB Output is correct
42 Correct 70 ms 1408 KB Output is correct
43 Correct 71 ms 1408 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 12 ms 896 KB Output is correct
46 Correct 12 ms 896 KB Output is correct
47 Correct 12 ms 896 KB Output is correct
48 Correct 131 ms 2228 KB Output is correct
49 Correct 135 ms 2168 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 99 ms 2296 KB Output is correct
52 Correct 69 ms 1408 KB Output is correct
53 Correct 69 ms 1408 KB Output is correct
54 Correct 10 ms 896 KB Output is correct
55 Correct 10 ms 896 KB Output is correct
56 Correct 10 ms 896 KB Output is correct
57 Correct 10 ms 896 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 10 ms 896 KB Output is correct
60 Correct 10 ms 896 KB Output is correct
61 Correct 10 ms 1024 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 10 ms 896 KB Output is correct