oj.uz

Submission #450372

# Submission time Handle Problem Language Result Execution time Memory
450372 2021-08-02T16:11:24 Z JovanB Travelling Merchant (APIO17_merchant) C++17
100 / 100
 752 ms 6048 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
ll buy[105][1005];
ll sell[105][1005];
 
ll dist[1005][1005];
ll graf[1005][1005];
ll prof[1005][1005];
ld tren[1005][1005];
 
const ll INF = 1000000000000LL;
 
int n;
 
bool cmp(ld a, ld b){
    return abs(a-b) > 0.0001;
}
 
bool check(ld val){
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(dist[i][j] == INF) tren[i][j] = INF;
            else tren[i][j] = - prof[i][j] + (1.0*dist[i][j])*val;
            //cout << i << " " << j << " " << tren[i][j] << endl;
        }
    }
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                tren[i][j] = min(tren[i][j], tren[i][k] + tren[k][j]);
            }
        }
    }
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                if(tren[i][j] > tren[i][k] + tren[k][j] && cmp(tren[i][j], tren[i][k] + tren[k][j])) return 1;
            }
        }
    }
    return 0;
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;
 
    int m, K;
    cin >> n >> m >> K;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=K; j++){
            cin >> buy[i][j];
            cin >> sell[i][j];
            //buy[i][j] *= 2;
            //sell[i][j] *= 2;
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            dist[i][j] = graf[i][j] = INF;
        }
        dist[i][i] = graf[i][i] = 0;
    }
    for(int i=1; i<=m; i++){
        ll a, b, c;
        cin >> a >> b >> c;
        //c *= 2;
        dist[a][b] = graf[a][b] = min(graf[a][b], c);
    }
    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++){
            if(i == j) continue;
            for(int k=1; k<=K; k++){
                if(buy[i][k]+1 && sell[j][k]+1) prof[i][j] = max(prof[i][j], sell[j][k]-buy[i][k]);
            }
            //cout << i << " " << j << " za " << prof[i][j] << endl;
        }
    }
    ld res = 0, l = 1, r = 1000000000;
    int tries = 60;
    while(tries--){
        ld mid = (l+r)/2;
        if(check(mid)){
            res = mid;
            l = mid;
        }
        else r = mid;
    }
    res += 0.001;
    ll rr = res;
    cout << rr << "\n";
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 734 ms 4692 KB Output is correct
2 Correct 693 ms 2660 KB Output is correct
3 Correct 602 ms 2636 KB Output is correct
4 Correct 83 ms 1404 KB Output is correct
5 Correct 80 ms 1356 KB Output is correct
6 Correct 87 ms 1348 KB Output is correct
7 Correct 78 ms 1484 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 80 ms 1400 KB Output is correct
10 Correct 79 ms 1356 KB Output is correct
11 Correct 79 ms 1408 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 106 ms 1484 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1348 KB Output is correct
2 Correct 78 ms 1484 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 80 ms 1400 KB Output is correct
5 Correct 79 ms 1356 KB Output is correct
6 Correct 79 ms 1408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 106 ms 1484 KB Output is correct
9 Correct 86 ms 1564 KB Output is correct
10 Correct 107 ms 1356 KB Output is correct
11 Correct 81 ms 1612 KB Output is correct
12 Correct 77 ms 1492 KB Output is correct
13 Correct 91 ms 1732 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 82 ms 1504 KB Output is correct
16 Correct 88 ms 1680 KB Output is correct
17 Correct 77 ms 1452 KB Output is correct
18 Correct 79 ms 1484 KB Output is correct
19 Correct 80 ms 1612 KB Output is correct
20 Correct 79 ms 1612 KB Output is correct
21 Correct 92 ms 1608 KB Output is correct
22 Correct 82 ms 1648 KB Output is correct
23 Correct 87 ms 1716 KB Output is correct
24 Correct 81 ms 1348 KB Output is correct
25 Correct 86 ms 1684 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 92 ms 1612 KB Output is correct
28 Correct 81 ms 1612 KB Output is correct
29 Correct 81 ms 1612 KB Output is correct
30 Correct 80 ms 1612 KB Output is correct
31 Correct 83 ms 1620 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 1684 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 92 ms 1612 KB Output is correct
4 Correct 81 ms 1612 KB Output is correct
5 Correct 81 ms 1612 KB Output is correct
6 Correct 80 ms 1612 KB Output is correct
7 Correct 83 ms 1620 KB Output is correct
8 Correct 651 ms 3388 KB Output is correct
9 Correct 744 ms 5640 KB Output is correct
10 Correct 616 ms 3236 KB Output is correct
11 Correct 664 ms 3456 KB Output is correct
12 Correct 608 ms 3460 KB Output is correct
13 Correct 607 ms 3240 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 1564 KB Output is correct
2 Correct 107 ms 1356 KB Output is correct
3 Correct 81 ms 1612 KB Output is correct
4 Correct 77 ms 1492 KB Output is correct
5 Correct 91 ms 1732 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 82 ms 1504 KB Output is correct
8 Correct 88 ms 1680 KB Output is correct
9 Correct 77 ms 1452 KB Output is correct
10 Correct 79 ms 1484 KB Output is correct
11 Correct 80 ms 1612 KB Output is correct
12 Correct 79 ms 1612 KB Output is correct
13 Correct 92 ms 1608 KB Output is correct
14 Correct 82 ms 1648 KB Output is correct
15 Correct 87 ms 1716 KB Output is correct
16 Correct 81 ms 1348 KB Output is correct
17 Correct 651 ms 3388 KB Output is correct
18 Correct 744 ms 5640 KB Output is correct
19 Correct 616 ms 3236 KB Output is correct
20 Correct 664 ms 3456 KB Output is correct
21 Correct 608 ms 3460 KB Output is correct
22 Correct 607 ms 3240 KB Output is correct
23 Correct 86 ms 1684 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 92 ms 1612 KB Output is correct
26 Correct 81 ms 1612 KB Output is correct
27 Correct 81 ms 1612 KB Output is correct
28 Correct 80 ms 1612 KB Output is correct
29 Correct 83 ms 1620 KB Output is correct
30 Correct 734 ms 4692 KB Output is correct
31 Correct 693 ms 2660 KB Output is correct
32 Correct 602 ms 2636 KB Output is correct
33 Correct 83 ms 1404 KB Output is correct
34 Correct 80 ms 1356 KB Output is correct
35 Correct 87 ms 1348 KB Output is correct
36 Correct 78 ms 1484 KB Output is correct
37 Correct 1 ms 316 KB Output is correct
38 Correct 80 ms 1400 KB Output is correct
39 Correct 79 ms 1356 KB Output is correct
40 Correct 79 ms 1408 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 106 ms 1484 KB Output is correct
43 Correct 658 ms 2840 KB Output is correct
44 Correct 639 ms 3396 KB Output is correct
45 Correct 665 ms 4352 KB Output is correct
46 Correct 626 ms 3248 KB Output is correct
47 Correct 653 ms 3276 KB Output is correct
48 Correct 619 ms 3276 KB Output is correct
49 Correct 712 ms 5832 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 448 KB Output is correct
52 Correct 639 ms 2764 KB Output is correct
53 Correct 635 ms 2892 KB Output is correct
54 Correct 666 ms 3020 KB Output is correct
55 Correct 592 ms 2792 KB Output is correct
56 Correct 624 ms 2756 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 84 ms 1740 KB Output is correct
59 Correct 82 ms 1704 KB Output is correct
60 Correct 82 ms 1784 KB Output is correct
61 Correct 752 ms 5952 KB Output is correct
62 Correct 699 ms 6048 KB Output is correct
63 Correct 1 ms 332 KB Output is correct