oj.uz

Submission #532267

# Submission time Handle Problem Language Result Execution time Memory
532267 2022-03-02T15:51:53 Z Fidisk Travelling Merchant (APIO17_merchant) C++14
100 / 100
 108 ms 4196 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll oo=1e9;
const ll maxans=1e9;

ll n,m,k,buys[109][1009],sell[109][1009],cost[109][109],dist[109][109],f[109][109],u,v,w,ans,i,j,l;

bool ok(ll x) {
    for (ll ii=1;ii<=n;ii++) {
        for (ll ij=1;ij<=n;ij++) {
            f[ii][ij]=cost[ii][ij]-dist[ii][ij]*x;
        }
    }
    for (ll ii=1;ii<=n;ii++) {
        for (ll ij=1;ij<=n;ij++) {
            for (ll jj=1;jj<=n;jj++) {
                f[ij][jj]=max(f[ij][jj],f[ij][ii]+f[ii][jj]);
            }
        }
    }
    for (ll ii=1;ii<=n;ii++) {
        if (f[ii][ii]>=0) {
            return true;
        }
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>k;
    for (i=1;i<=n;i++) {
        for (j=1;j<=k;j++) {
            cin>>buys[i][j];
            cin>>sell[i][j];
        }
    }
    for (i=1;i<=n;i++) {
        for (j=1;j<=n;j++) {
            dist[i][j]=oo;
        }
    }
    for (i=1;i<=m;i++) {
        cin>>u>>v>>w;
        dist[u][v]=w;
    }
    for (i=1;i<=n;i++) {
        for (j=1;j<=n;j++) {
            for (l=1;l<=n;l++) {
                dist[j][l]=min(dist[j][l],dist[j][i]+dist[i][l]);
            }
        }
    }
    for (i=1;i<=n;i++) {
        for (j=1;j<=n;j++) {
            for (l=1;l<=k;l++) {
                if (buys[i][l]!=-1) {
                    if (sell[j][l]!=-1) {
                        cost[i][j]=max(cost[i][j],sell[j][l]-buys[i][l]);
                    }
                }
            }
        }
    }
    /*
    for (i=1;i<=n;i++) {
        for (j=1;j<=n;j++) {
            cout<<dist[i][j]<<' ';
        }
        cout<<'\n';
    }
    for (i=1;i<=n;i++) {
        for (j=1;j<=n;j++) {
            cout<<cost[i][j]<<' ';
        }
        cout<<'\n';
    }
    */
    ans=0;
    for (i=maxans;i>0;i/=2) {
        while (ok(ans+i)) {
            ans+=i;
        }
    }
    cout<<ans<<'\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 3324 KB Output is correct
2 Correct 37 ms 1216 KB Output is correct
3 Correct 62 ms 1284 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 7 ms 716 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 11 ms 844 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 7 ms 716 KB Output is correct
10 Correct 8 ms 716 KB Output is correct
11 Correct 7 ms 820 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 6 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 11 ms 844 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 7 ms 716 KB Output is correct
5 Correct 8 ms 716 KB Output is correct
6 Correct 7 ms 820 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 6 ms 844 KB Output is correct
9 Correct 9 ms 860 KB Output is correct
10 Correct 7 ms 836 KB Output is correct
11 Correct 9 ms 844 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 8 ms 844 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 856 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 8 ms 844 KB Output is correct
18 Correct 8 ms 844 KB Output is correct
19 Correct 9 ms 844 KB Output is correct
20 Correct 9 ms 844 KB Output is correct
21 Correct 10 ms 872 KB Output is correct
22 Correct 8 ms 892 KB Output is correct
23 Correct 9 ms 844 KB Output is correct
24 Correct 7 ms 836 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 8 ms 840 KB Output is correct
28 Correct 8 ms 936 KB Output is correct
29 Correct 8 ms 844 KB Output is correct
30 Correct 8 ms 844 KB Output is correct
31 Correct 7 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 8 ms 840 KB Output is correct
4 Correct 8 ms 936 KB Output is correct
5 Correct 8 ms 844 KB Output is correct
6 Correct 8 ms 844 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 51 ms 1644 KB Output is correct
9 Correct 98 ms 3888 KB Output is correct
10 Correct 56 ms 1484 KB Output is correct
11 Correct 50 ms 1728 KB Output is correct
12 Correct 54 ms 1744 KB Output is correct
13 Correct 60 ms 1508 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 860 KB Output is correct
2 Correct 7 ms 836 KB Output is correct
3 Correct 9 ms 844 KB Output is correct
4 Correct 6 ms 844 KB Output is correct
5 Correct 8 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 856 KB Output is correct
8 Correct 6 ms 844 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 9 ms 844 KB Output is correct
12 Correct 9 ms 844 KB Output is correct
13 Correct 10 ms 872 KB Output is correct
14 Correct 8 ms 892 KB Output is correct
15 Correct 9 ms 844 KB Output is correct
16 Correct 7 ms 836 KB Output is correct
17 Correct 51 ms 1644 KB Output is correct
18 Correct 98 ms 3888 KB Output is correct
19 Correct 56 ms 1484 KB Output is correct
20 Correct 50 ms 1728 KB Output is correct
21 Correct 54 ms 1744 KB Output is correct
22 Correct 60 ms 1508 KB Output is correct
23 Correct 7 ms 844 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 8 ms 840 KB Output is correct
26 Correct 8 ms 936 KB Output is correct
27 Correct 8 ms 844 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 65 ms 3324 KB Output is correct
31 Correct 37 ms 1216 KB Output is correct
32 Correct 62 ms 1284 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 7 ms 716 KB Output is correct
35 Correct 5 ms 716 KB Output is correct
36 Correct 11 ms 844 KB Output is correct
37 Correct 1 ms 316 KB Output is correct
38 Correct 7 ms 716 KB Output is correct
39 Correct 8 ms 716 KB Output is correct
40 Correct 7 ms 820 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 6 ms 844 KB Output is correct
43 Correct 42 ms 1400 KB Output is correct
44 Correct 42 ms 1476 KB Output is correct
45 Correct 69 ms 2632 KB Output is correct
46 Correct 44 ms 1572 KB Output is correct
47 Correct 44 ms 1588 KB Output is correct
48 Correct 54 ms 1588 KB Output is correct
49 Correct 90 ms 4076 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 42 ms 1356 KB Output is correct
53 Correct 43 ms 1472 KB Output is correct
54 Correct 43 ms 1356 KB Output is correct
55 Correct 50 ms 1404 KB Output is correct
56 Correct 45 ms 1356 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 7 ms 984 KB Output is correct
59 Correct 9 ms 972 KB Output is correct
60 Correct 8 ms 972 KB Output is correct
61 Correct 98 ms 4196 KB Output is correct
62 Correct 108 ms 4192 KB Output is correct
63 Correct 0 ms 332 KB Output is correct