oj.uz

Submission #642646

# Submission time Handle Problem Language Result Execution time Memory
642646 2022-09-20T09:59:29 Z PoonYaPat Travelling Merchant (APIO17_merchant) C++14
100 / 100
 83 ms 4092 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,m,h;
ll profit[101][101],dis[101][101],buy[101][1001],sell[101][1001],dist[101][101];

bool solve(ll s) {
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            if (dis[i][j]!=1e15) {
                dist[i][j]=dis[i][j]*s-profit[i][j];
            } else dist[i][j]=1e15;
        }
    }
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            for (int k=1; k<=n; ++k) {
                dist[j][k]=min(dist[j][k],dist[j][i]+dist[i][k]);
            }
        }
    }
    for (int i=1; i<=n; ++i) {
        if (dist[i][i]<=0) return true;
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m>>h;
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=h; ++j) cin>>buy[i][j]>>sell[i][j];
    }

    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            dis[i][j]=1e15;
            for (int k=1; k<=h; ++k) if (sell[j][k]!=-1 && buy[i][k]!=-1)
                profit[i][j]=max(profit[i][j],sell[j][k]-buy[i][k]);
        }
    }

    for (int i=0; i<m; ++i) {
        int a,b,w; cin>>a>>b>>w;
        dis[a][b]=w;
    }

    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            for (int k=1; k<=n; ++k) {
                dis[j][k]=min(dis[j][k],dis[j][i]+dis[i][k]);
            }
        }
    }

    ll l=1, r=1e9, ans=0;
    while (l<=r) {
        int mid=(l+r)/2;
        if (solve(mid)) ans=mid,l=mid+1;
        else r=mid-1;
    }
    cout<<ans;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1956 KB Output is correct
2 Correct 29 ms 1236 KB Output is correct
3 Correct 32 ms 1236 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 5 ms 724 KB Output is correct
6 Correct 5 ms 820 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 5 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 5 ms 724 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 820 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 940 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 5 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 5 ms 852 KB Output is correct
18 Correct 5 ms 852 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 6 ms 844 KB Output is correct
21 Correct 6 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 6 ms 896 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 6 ms 852 KB Output is correct
29 Correct 6 ms 852 KB Output is correct
30 Correct 5 ms 840 KB Output is correct
31 Correct 5 ms 836 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 896 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 6 ms 852 KB Output is correct
4 Correct 6 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 840 KB Output is correct
7 Correct 5 ms 836 KB Output is correct
8 Correct 35 ms 1504 KB Output is correct
9 Correct 76 ms 2040 KB Output is correct
10 Correct 32 ms 1364 KB Output is correct
11 Correct 35 ms 1396 KB Output is correct
12 Correct 36 ms 1492 KB Output is correct
13 Correct 32 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 940 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 5 ms 852 KB Output is correct
17 Correct 35 ms 1504 KB Output is correct
18 Correct 76 ms 2040 KB Output is correct
19 Correct 32 ms 1364 KB Output is correct
20 Correct 35 ms 1396 KB Output is correct
21 Correct 36 ms 1492 KB Output is correct
22 Correct 32 ms 1364 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 6 ms 852 KB Output is correct
28 Correct 5 ms 840 KB Output is correct
29 Correct 5 ms 836 KB Output is correct
30 Correct 51 ms 1956 KB Output is correct
31 Correct 29 ms 1236 KB Output is correct
32 Correct 32 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 5 ms 724 KB Output is correct
35 Correct 5 ms 820 KB Output is correct
36 Correct 5 ms 852 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 5 ms 724 KB Output is correct
39 Correct 6 ms 724 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 5 ms 724 KB Output is correct
43 Correct 31 ms 1392 KB Output is correct
44 Correct 33 ms 1576 KB Output is correct
45 Correct 47 ms 2508 KB Output is correct
46 Correct 36 ms 1564 KB Output is correct
47 Correct 35 ms 1580 KB Output is correct
48 Correct 36 ms 1748 KB Output is correct
49 Correct 81 ms 4044 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 31 ms 1376 KB Output is correct
53 Correct 32 ms 1400 KB Output is correct
54 Correct 32 ms 1364 KB Output is correct
55 Correct 35 ms 1332 KB Output is correct
56 Correct 35 ms 1332 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 7 ms 980 KB Output is correct
59 Correct 6 ms 972 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 83 ms 4092 KB Output is correct
62 Correct 82 ms 4092 KB Output is correct
63 Correct 0 ms 324 KB Output is correct