oj.uz

Submission #306210

# Submission time Handle Problem Language Result Execution time Memory
306210 2020-09-24T21:10:51 Z jovan_b Travelling Merchant (APIO17_merchant) C++17
100 / 100
 736 ms 4216 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 639 ms 3576 KB Output is correct
2 Correct 681 ms 2808 KB Output is correct
3 Correct 587 ms 2808 KB Output is correct
4 Correct 80 ms 1408 KB Output is correct
5 Correct 79 ms 1472 KB Output is correct
6 Correct 87 ms 1528 KB Output is correct
7 Correct 141 ms 1408 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 81 ms 1408 KB Output is correct
10 Correct 81 ms 1408 KB Output is correct
11 Correct 79 ms 1408 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 89 ms 1528 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 1536 KB Output is correct
2 Correct 82 ms 1408 KB Output is correct
3 Correct 79 ms 1664 KB Output is correct
4 Correct 72 ms 1656 KB Output is correct
5 Correct 90 ms 1728 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 80 ms 1536 KB Output is correct
8 Correct 81 ms 1664 KB Output is correct
9 Correct 78 ms 1528 KB Output is correct
10 Correct 79 ms 1536 KB Output is correct
11 Correct 76 ms 1664 KB Output is correct
12 Correct 78 ms 1664 KB Output is correct
13 Correct 82 ms 1696 KB Output is correct
14 Correct 81 ms 1664 KB Output is correct
15 Correct 81 ms 1664 KB Output is correct
16 Correct 83 ms 1408 KB Output is correct
17 Correct 88 ms 1784 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 72 ms 1784 KB Output is correct
20 Correct 81 ms 1784 KB Output is correct
21 Correct 84 ms 1664 KB Output is correct
22 Correct 80 ms 1664 KB Output is correct
23 Correct 76 ms 1692 KB Output is correct
24 Correct 87 ms 1528 KB Output is correct
25 Correct 141 ms 1408 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 81 ms 1408 KB Output is correct
28 Correct 81 ms 1408 KB Output is correct
29 Correct 79 ms 1408 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 89 ms 1528 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 652 ms 3448 KB Output is correct
2 Correct 663 ms 3936 KB Output is correct
3 Correct 619 ms 3256 KB Output is correct
4 Correct 629 ms 3448 KB Output is correct
5 Correct 558 ms 3348 KB Output is correct
6 Correct 587 ms 3320 KB Output is correct
7 Correct 88 ms 1784 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 72 ms 1784 KB Output is correct
10 Correct 81 ms 1784 KB Output is correct
11 Correct 84 ms 1664 KB Output is correct
12 Correct 80 ms 1664 KB Output is correct
13 Correct 76 ms 1692 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 1536 KB Output is correct
2 Correct 82 ms 1408 KB Output is correct
3 Correct 79 ms 1664 KB Output is correct
4 Correct 72 ms 1656 KB Output is correct
5 Correct 90 ms 1728 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 80 ms 1536 KB Output is correct
8 Correct 81 ms 1664 KB Output is correct
9 Correct 78 ms 1528 KB Output is correct
10 Correct 79 ms 1536 KB Output is correct
11 Correct 76 ms 1664 KB Output is correct
12 Correct 78 ms 1664 KB Output is correct
13 Correct 82 ms 1696 KB Output is correct
14 Correct 81 ms 1664 KB Output is correct
15 Correct 81 ms 1664 KB Output is correct
16 Correct 83 ms 1408 KB Output is correct
17 Correct 652 ms 3448 KB Output is correct
18 Correct 663 ms 3936 KB Output is correct
19 Correct 619 ms 3256 KB Output is correct
20 Correct 629 ms 3448 KB Output is correct
21 Correct 558 ms 3348 KB Output is correct
22 Correct 587 ms 3320 KB Output is correct
23 Correct 88 ms 1784 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 72 ms 1784 KB Output is correct
26 Correct 81 ms 1784 KB Output is correct
27 Correct 84 ms 1664 KB Output is correct
28 Correct 80 ms 1664 KB Output is correct
29 Correct 76 ms 1692 KB Output is correct
30 Correct 651 ms 2904 KB Output is correct
31 Correct 630 ms 3448 KB Output is correct
32 Correct 620 ms 3840 KB Output is correct
33 Correct 593 ms 3200 KB Output is correct
34 Correct 611 ms 3272 KB Output is correct
35 Correct 620 ms 3320 KB Output is correct
36 Correct 699 ms 4216 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 640 ms 2808 KB Output is correct
40 Correct 610 ms 2808 KB Output is correct
41 Correct 634 ms 3072 KB Output is correct
42 Correct 590 ms 2812 KB Output is correct
43 Correct 617 ms 2808 KB Output is correct
44 Correct 1 ms 512 KB Output is correct
45 Correct 82 ms 1664 KB Output is correct
46 Correct 80 ms 1792 KB Output is correct
47 Correct 86 ms 1664 KB Output is correct
48 Correct 736 ms 4088 KB Output is correct
49 Correct 677 ms 4088 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 639 ms 3576 KB Output is correct
52 Correct 681 ms 2808 KB Output is correct
53 Correct 587 ms 2808 KB Output is correct
54 Correct 80 ms 1408 KB Output is correct
55 Correct 79 ms 1472 KB Output is correct
56 Correct 87 ms 1528 KB Output is correct
57 Correct 141 ms 1408 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 81 ms 1408 KB Output is correct
60 Correct 81 ms 1408 KB Output is correct
61 Correct 79 ms 1408 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 89 ms 1528 KB Output is correct