oj.uz

Submission #406365

# Submission time Handle Problem Language Result Execution time Memory
406365 2021-05-17T13:14:07 Z aryan12 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 98 ms 4296 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int N = 110, K = 1010;
 
int nodes, edges, items;
int buy[N][K], sell[N][K];
int value[N][N], dist[N][N];
 
bool Check(long long x) {
    long long efficiency[N][N];
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < N; j++) {
            efficiency[i][j] = -1e16;
        }
    }
    for(int i = 1; i <= nodes; i++) {
        for(int j = 1; j <= nodes; j++) {
            if(dist[i][j] != 1e16) {
                efficiency[i][j] = max(efficiency[i][j], value[i][j] - dist[i][j] * x);
            }
        }
    }
    for(int k = 1; k <= nodes; k++) {
        for(int i = 1; i <= nodes; i++) {
            for(int j = 1; j <= nodes; j++) {
                efficiency[i][j] = max(efficiency[i][j], efficiency[i][k] + efficiency[k][j]);
            }
        }
    }
    /*cout << "Outputing the efficiency\n";
    for(int i = 1; i <= nodes; i++) {
        for(int j = 1; j <= nodes; j++) {
            cout << efficiency[i][j] << " ";
        }
        cout << "\n";
    }*/
    for(int i = 1; i <= nodes; i++) {
        if(efficiency[i][i] >= 0)
            return true;
    }
    return false;
}

void Solve() {
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < N; j++) {
            dist[i][j] = 1e16;
            value[i][j] = 0;
        }
    }
    cin >> nodes >> edges >> items;
    for(int i = 1; i <= nodes; i++) {
        for(int j = 1; j <= items; j++) {
            cin >> buy[i][j] >> sell[i][j];
        }
    }
    for(int i = 1; i <= edges; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        dist[v][u] = w;
    }
    for(int k = 1; k <= nodes; k++) {
        for(int i = 1; i <= nodes; i++) {
            for(int j = 1; j <= nodes; j++) {
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    for(int item_number = 1; item_number <= items; item_number++) {
        for(int buy_node = 1; buy_node <= nodes; buy_node++) {
            for(int sell_node = 1; sell_node <= nodes; sell_node++) {
                if(buy[buy_node][item_number] != -1 && sell[sell_node][item_number] != -1 && dist[buy_node][sell_node] != 1e15) {
                    value[buy_node][sell_node] = max(value[buy_node][sell_node], sell[sell_node][item_number] - buy[buy_node][item_number]);
                }
            }
        }
    }
    /*cout << "Minimum distance to travel from a pair of indices (i, j) are as follows: \n";
    for(int i = 1; i <= nodes; i++) {
        for(int j = 1; j <= nodes; j++) {
            cout << dist[i][j] << " ";
        }
        cout << "\n";
    }

    cout << "Maximum value which can be gained when travelling from i to j is as follows: \n";
    for(int i = 1; i <= nodes; i++) {
        for(int j = 1; j <= nodes; j++) {
            cout << value[i][j] << " ";
        }
        cout << "\n";
    }*/

    int ans = 0;
    int left = 0, right = 1e10;
    while(left <= right) {
        int mid = (left + right) >> 1;
        if(Check(mid)) {
            ans = mid;
            left = mid + 1;
        }
        else {
            right = mid - 1;
        }
    }
    cout << ans << "\n";
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    Solve();
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 2212 KB Output is correct
2 Correct 44 ms 1356 KB Output is correct
3 Correct 48 ms 1308 KB Output is correct
4 Correct 8 ms 972 KB Output is correct
5 Correct 7 ms 972 KB Output is correct
6 Correct 7 ms 972 KB Output is correct
7 Correct 11 ms 1032 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 8 ms 972 KB Output is correct
10 Correct 10 ms 1008 KB Output is correct
11 Correct 7 ms 972 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 8 ms 1036 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 972 KB Output is correct
2 Correct 11 ms 1032 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 8 ms 972 KB Output is correct
5 Correct 10 ms 1008 KB Output is correct
6 Correct 7 ms 972 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 8 ms 1036 KB Output is correct
9 Correct 8 ms 972 KB Output is correct
10 Correct 8 ms 1008 KB Output is correct
11 Correct 8 ms 1032 KB Output is correct
12 Correct 7 ms 972 KB Output is correct
13 Correct 8 ms 1032 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 7 ms 1012 KB Output is correct
16 Correct 8 ms 1036 KB Output is correct
17 Correct 8 ms 1016 KB Output is correct
18 Correct 8 ms 972 KB Output is correct
19 Correct 8 ms 972 KB Output is correct
20 Correct 8 ms 1036 KB Output is correct
21 Correct 8 ms 1004 KB Output is correct
22 Correct 8 ms 1016 KB Output is correct
23 Correct 9 ms 972 KB Output is correct
24 Correct 10 ms 1016 KB Output is correct
25 Correct 9 ms 972 KB Output is correct
26 Correct 1 ms 588 KB Output is correct
27 Correct 9 ms 972 KB Output is correct
28 Correct 9 ms 972 KB Output is correct
29 Correct 8 ms 972 KB Output is correct
30 Correct 9 ms 1008 KB Output is correct
31 Correct 7 ms 972 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 972 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 9 ms 972 KB Output is correct
4 Correct 9 ms 972 KB Output is correct
5 Correct 8 ms 972 KB Output is correct
6 Correct 9 ms 1008 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 48 ms 1484 KB Output is correct
9 Correct 88 ms 2148 KB Output is correct
10 Correct 45 ms 1356 KB Output is correct
11 Correct 49 ms 1484 KB Output is correct
12 Correct 53 ms 1740 KB Output is correct
13 Correct 46 ms 1532 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 972 KB Output is correct
2 Correct 8 ms 1008 KB Output is correct
3 Correct 8 ms 1032 KB Output is correct
4 Correct 7 ms 972 KB Output is correct
5 Correct 8 ms 1032 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 7 ms 1012 KB Output is correct
8 Correct 8 ms 1036 KB Output is correct
9 Correct 8 ms 1016 KB Output is correct
10 Correct 8 ms 972 KB Output is correct
11 Correct 8 ms 972 KB Output is correct
12 Correct 8 ms 1036 KB Output is correct
13 Correct 8 ms 1004 KB Output is correct
14 Correct 8 ms 1016 KB Output is correct
15 Correct 9 ms 972 KB Output is correct
16 Correct 10 ms 1016 KB Output is correct
17 Correct 48 ms 1484 KB Output is correct
18 Correct 88 ms 2148 KB Output is correct
19 Correct 45 ms 1356 KB Output is correct
20 Correct 49 ms 1484 KB Output is correct
21 Correct 53 ms 1740 KB Output is correct
22 Correct 46 ms 1532 KB Output is correct
23 Correct 9 ms 972 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 9 ms 972 KB Output is correct
26 Correct 9 ms 972 KB Output is correct
27 Correct 8 ms 972 KB Output is correct
28 Correct 9 ms 1008 KB Output is correct
29 Correct 7 ms 972 KB Output is correct
30 Correct 90 ms 2212 KB Output is correct
31 Correct 44 ms 1356 KB Output is correct
32 Correct 48 ms 1308 KB Output is correct
33 Correct 8 ms 972 KB Output is correct
34 Correct 7 ms 972 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 11 ms 1032 KB Output is correct
37 Correct 1 ms 588 KB Output is correct
38 Correct 8 ms 972 KB Output is correct
39 Correct 10 ms 1008 KB Output is correct
40 Correct 7 ms 972 KB Output is correct
41 Correct 1 ms 588 KB Output is correct
42 Correct 8 ms 1036 KB Output is correct
43 Correct 45 ms 1356 KB Output is correct
44 Correct 53 ms 1612 KB Output is correct
45 Correct 65 ms 2576 KB Output is correct
46 Correct 50 ms 1612 KB Output is correct
47 Correct 52 ms 1612 KB Output is correct
48 Correct 47 ms 1612 KB Output is correct
49 Correct 96 ms 4064 KB Output is correct
50 Correct 1 ms 588 KB Output is correct
51 Correct 1 ms 588 KB Output is correct
52 Correct 45 ms 1356 KB Output is correct
53 Correct 47 ms 1604 KB Output is correct
54 Correct 60 ms 1484 KB Output is correct
55 Correct 49 ms 1356 KB Output is correct
56 Correct 59 ms 1356 KB Output is correct
57 Correct 1 ms 588 KB Output is correct
58 Correct 10 ms 1156 KB Output is correct
59 Correct 9 ms 1100 KB Output is correct
60 Correct 10 ms 1164 KB Output is correct
61 Correct 95 ms 4296 KB Output is correct
62 Correct 98 ms 4196 KB Output is correct
63 Correct 1 ms 588 KB Output is correct