oj.uz

Submission #399019

# Submission time Handle Problem Language Result Execution time Memory
399019 2021-05-05T04:17:05 Z Osama_Alkhodairy Travelling Merchant (APIO17_merchant) C++17
100 / 100
 100 ms 4232 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 101;
const int K = 1001;
const ll INF = (ll)1e18;

int n, m, k;
ll B[N][K], S[N][K], mx[N][N], dist[N][N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for(int i = 1 ; i < N ; i++){
        for(int j = 1 ; j < N ; j++){
            dist[i][j] = INF;
        }
    }
    cin >> n >> m >> k;
    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= k ; j++){
            cin >> B[i][j] >> S[i][j];
        }
    }
    for(int i = 0 ; i < m ; i++){
        int x, y, z;
        cin >> x >> y >> z;
        dist[x][y] = z;
    }
    for(int k = 1 ; k <= n ; k++){
        for(int i = 1 ; i <= n ; i++){
            for(int j = 1 ; j <= n ; j++){
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    for(int i = 1 ; i <= n ; i++){
        for(int j = 1 ; j <= n ; j++){
            for(int p = 1 ; p <= k ; p++){
                if(B[i][p] != -1 && S[j][p] != -1){
                    mx[i][j] = max(mx[i][j], S[j][p] - B[i][p]);
                }
            }
        }
    }
    int l = 0, r = (int)1e9;
    while(l <= r){
        int mid = (l + r) / 2;
        vector <vector <ll> > c(n + 1, vector <ll>(n + 1));
        for(int i = 1 ; i <= n ; i++){
            for(int j = 1 ; j <= n ; j++){
                c[i][j] = mx[i][j] - (dist[i][j] == INF ? INF : dist[i][j] * mid);
            }
        }
        for(int k = 1 ; k <= n ; k++){
            for(int i = 1 ; i <= n ; i++){
                for(int j = 1 ; j <= n ; j++){
                    c[i][j] = max(c[i][j], c[i][k] + c[k][j]);
                }
            }
        }
        bool ok = 0;
        for(int i = 1 ; i <= n ; i++){
            if(c[i][i] >= 0) ok = 1;
        }
        if(ok) l = mid + 1;
        else r = mid - 1;
    }
    cout << r << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2500 KB Output is correct
2 Correct 36 ms 1228 KB Output is correct
3 Correct 37 ms 1280 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 6 ms 840 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 6 ms 848 KB Output is correct
11 Correct 6 ms 716 KB Output is correct
12 Correct 1 ms 460 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 6 ms 716 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 6 ms 848 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 6 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 6 ms 844 KB Output is correct
11 Correct 7 ms 924 KB Output is correct
12 Correct 6 ms 844 KB Output is correct
13 Correct 7 ms 844 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 6 ms 844 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 6 ms 844 KB Output is correct
18 Correct 6 ms 844 KB Output is correct
19 Correct 9 ms 956 KB Output is correct
20 Correct 7 ms 844 KB Output is correct
21 Correct 6 ms 892 KB Output is correct
22 Correct 6 ms 844 KB Output is correct
23 Correct 7 ms 972 KB Output is correct
24 Correct 6 ms 844 KB Output is correct
25 Correct 8 ms 844 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 7 ms 844 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 6 ms 844 KB Output is correct
31 Correct 6 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 7 ms 844 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 44 ms 1612 KB Output is correct
9 Correct 95 ms 2616 KB Output is correct
10 Correct 39 ms 1484 KB Output is correct
11 Correct 46 ms 1612 KB Output is correct
12 Correct 47 ms 1732 KB Output is correct
13 Correct 39 ms 1484 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 844 KB Output is correct
2 Correct 6 ms 844 KB Output is correct
3 Correct 7 ms 924 KB Output is correct
4 Correct 6 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 6 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 6 ms 844 KB Output is correct
11 Correct 9 ms 956 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 6 ms 892 KB Output is correct
14 Correct 6 ms 844 KB Output is correct
15 Correct 7 ms 972 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 44 ms 1612 KB Output is correct
18 Correct 95 ms 2616 KB Output is correct
19 Correct 39 ms 1484 KB Output is correct
20 Correct 46 ms 1612 KB Output is correct
21 Correct 47 ms 1732 KB Output is correct
22 Correct 39 ms 1484 KB Output is correct
23 Correct 8 ms 844 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 7 ms 844 KB Output is correct
26 Correct 7 ms 844 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 6 ms 844 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 65 ms 2500 KB Output is correct
31 Correct 36 ms 1228 KB Output is correct
32 Correct 37 ms 1280 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 6 ms 840 KB Output is correct
35 Correct 6 ms 716 KB Output is correct
36 Correct 7 ms 844 KB Output is correct
37 Correct 1 ms 464 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 6 ms 848 KB Output is correct
40 Correct 6 ms 716 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 6 ms 844 KB Output is correct
43 Correct 37 ms 1412 KB Output is correct
44 Correct 41 ms 1484 KB Output is correct
45 Correct 60 ms 2608 KB Output is correct
46 Correct 39 ms 1484 KB Output is correct
47 Correct 39 ms 1572 KB Output is correct
48 Correct 40 ms 1488 KB Output is correct
49 Correct 95 ms 3968 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 38 ms 1356 KB Output is correct
53 Correct 39 ms 1356 KB Output is correct
54 Correct 39 ms 1460 KB Output is correct
55 Correct 38 ms 1356 KB Output is correct
56 Correct 37 ms 1356 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 9 ms 1044 KB Output is correct
59 Correct 8 ms 976 KB Output is correct
60 Correct 8 ms 1040 KB Output is correct
61 Correct 99 ms 4232 KB Output is correct
62 Correct 100 ms 4072 KB Output is correct
63 Correct 1 ms 332 KB Output is correct