oj.uz

Submission #198216

# Submission time Handle Problem Language Result Execution time Memory
198216 2020-01-25T06:55:50 Z knon0501 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 164 ms 3704 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF=1e9+5;
int l[101][101];
int N,M,K;
int B[101][1001];
int S[101][1001];
int E[101][1001];
long long D[101][101];
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin>>N>>M>>K;

    int i,j,k;

    for(i=1 ; i<=N ; i++){
        for(j=1 ; j<=N; j++){
            l[i][j]=INF;
        }
        l[i][i]=0;
    }
    for(i=1 ; i<=N ; i++){
        for(j=1 ; j<=K ; j++){
            cin>>B[i][j]>>S[i][j];
        }
    }
    for(i=1 ; i<=M ; i++){
        int u,v,t;
        cin>>u>>v>>t;
        l[u][v]=t;
    }
    for(k=1 ; k<=N ; k++){
        for(i=1 ; i<=N ; i++){
            for(j=1 ; j<=N ; j++)
                l[i][j]=min(l[i][j],l[i][k]+l[k][j]);
        }
    }

    for(i=1 ; i<=N ; i++){
        for(j=1 ; j<=N ; j++){
            for(k=1 ; k<=K ; k++){
                if(S[j][k]>=0 && B[i][k]>=0)
                    E[i][j]=max(E[i][j],S[j][k]-B[i][k]);
            }
        }
    }
    int lef=0;
    int ans;
    int rig=INF;
    while(rig>=lef){
        long long mid=(lef+rig)/2;
        for(i=1 ; i<=N ; i++){
            for(j=1 ; j<=N ; j++){
                D[i][j]=mid*l[i][j]-E[i][j];
            }
            D[i][i]=INF;
        }
        for(k=1 ; k<=N ; k++)
            for(i=1 ; i<=N ; i++){
                for(j=1;  j<=N ; j++){
                    if(D[i][j]>D[i][k]+D[k][j])
                        D[i][j]=D[i][k]+D[k][j];
                }
            }
        int isok=0;
        for(i=1 ; i<=N ; i++){
            if(D[i][i]<=0)isok=1;
        }
        if(isok)lef=mid+1,ans=mid;
        else rig=mid-1;
    }
    cout<<ans;
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:74:9: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
     cout<<ans;
     ~~~~^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 2552 KB Output is correct
2 Correct 38 ms 1272 KB Output is correct
3 Correct 39 ms 1272 KB Output is correct
4 Correct 8 ms 760 KB Output is correct
5 Correct 8 ms 888 KB Output is correct
6 Correct 8 ms 760 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 8 ms 760 KB Output is correct
10 Correct 8 ms 760 KB Output is correct
11 Correct 8 ms 804 KB Output is correct
12 Correct 2 ms 392 KB Output is correct
13 Correct 8 ms 760 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 9 ms 1016 KB Output is correct
4 Correct 8 ms 1016 KB Output is correct
5 Correct 14 ms 1016 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 9 ms 1016 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 11 ms 1016 KB Output is correct
12 Correct 11 ms 1016 KB Output is correct
13 Correct 9 ms 1016 KB Output is correct
14 Correct 11 ms 1016 KB Output is correct
15 Correct 11 ms 1144 KB Output is correct
16 Correct 10 ms 888 KB Output is correct
17 Correct 18 ms 1072 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 18 ms 1016 KB Output is correct
20 Correct 13 ms 1016 KB Output is correct
21 Correct 13 ms 1016 KB Output is correct
22 Correct 9 ms 1020 KB Output is correct
23 Correct 10 ms 1016 KB Output is correct
24 Correct 8 ms 760 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 760 KB Output is correct
28 Correct 8 ms 760 KB Output is correct
29 Correct 8 ms 804 KB Output is correct
30 Correct 2 ms 392 KB Output is correct
31 Correct 8 ms 760 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 1824 KB Output is correct
2 Correct 164 ms 3524 KB Output is correct
3 Correct 88 ms 1768 KB Output is correct
4 Correct 121 ms 1896 KB Output is correct
5 Correct 117 ms 1784 KB Output is correct
6 Correct 56 ms 1784 KB Output is correct
7 Correct 18 ms 1072 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 18 ms 1016 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct
11 Correct 13 ms 1016 KB Output is correct
12 Correct 9 ms 1020 KB Output is correct
13 Correct 10 ms 1016 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 8 ms 888 KB Output is correct
3 Correct 9 ms 1016 KB Output is correct
4 Correct 8 ms 1016 KB Output is correct
5 Correct 14 ms 1016 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 8 ms 888 KB Output is correct
8 Correct 9 ms 1016 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 11 ms 1016 KB Output is correct
12 Correct 11 ms 1016 KB Output is correct
13 Correct 9 ms 1016 KB Output is correct
14 Correct 11 ms 1016 KB Output is correct
15 Correct 11 ms 1144 KB Output is correct
16 Correct 10 ms 888 KB Output is correct
17 Correct 109 ms 1824 KB Output is correct
18 Correct 164 ms 3524 KB Output is correct
19 Correct 88 ms 1768 KB Output is correct
20 Correct 121 ms 1896 KB Output is correct
21 Correct 117 ms 1784 KB Output is correct
22 Correct 56 ms 1784 KB Output is correct
23 Correct 18 ms 1072 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 18 ms 1016 KB Output is correct
26 Correct 13 ms 1016 KB Output is correct
27 Correct 13 ms 1016 KB Output is correct
28 Correct 9 ms 1020 KB Output is correct
29 Correct 10 ms 1016 KB Output is correct
30 Correct 45 ms 1400 KB Output is correct
31 Correct 47 ms 1756 KB Output is correct
32 Correct 61 ms 2228 KB Output is correct
33 Correct 41 ms 1656 KB Output is correct
34 Correct 38 ms 1784 KB Output is correct
35 Correct 56 ms 1784 KB Output is correct
36 Correct 133 ms 3516 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 40 ms 1400 KB Output is correct
40 Correct 41 ms 1500 KB Output is correct
41 Correct 42 ms 1656 KB Output is correct
42 Correct 41 ms 1436 KB Output is correct
43 Correct 37 ms 1272 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 12 ms 1144 KB Output is correct
46 Correct 12 ms 1144 KB Output is correct
47 Correct 12 ms 1144 KB Output is correct
48 Correct 116 ms 3676 KB Output is correct
49 Correct 116 ms 3704 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 68 ms 2552 KB Output is correct
52 Correct 38 ms 1272 KB Output is correct
53 Correct 39 ms 1272 KB Output is correct
54 Correct 8 ms 760 KB Output is correct
55 Correct 8 ms 888 KB Output is correct
56 Correct 8 ms 760 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 8 ms 760 KB Output is correct
60 Correct 8 ms 760 KB Output is correct
61 Correct 8 ms 804 KB Output is correct
62 Correct 2 ms 392 KB Output is correct
63 Correct 8 ms 760 KB Output is correct