oj.uz

Submission #847883

# Submission time Handle Problem Language Result Execution time Memory
847883 2023-09-10T17:39:54 Z popovicirobert Travelling Merchant (APIO17_merchant) C++14
100 / 100
 91 ms 3504 KB 
#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

constexpr ll INF = (ll) 1e18;


int main() {
#ifdef HOME
    ifstream cin("input.in");
    ofstream cout("output.out");
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<int>> buy(n + 1, vector<int>(k + 1));
    vector<vector<int>> sell(n + 1, vector<int>(k + 1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> buy[i][j] >> sell[i][j];
        }
    }

    vector<vector<ll>> travel_time(n + 1, vector<ll>(n + 1, INF));
    for (int i = 1; i <= n; i++) {
        travel_time[i][i] = 0;
    }

    while (m--) {
        int x, y, t;
        cin >> x >> y >> t;
        travel_time[x][y] = t;
    }

    for (int z = 1; z <= n; z++) {
        auto temp = travel_time;
        for (int x = 1; x <= n; x++) {
            for (int y = 1; y <= n; y++) {
                temp[x][y] = min(temp[x][y], travel_time[x][z] + travel_time[z][y]);
            }
        }
        travel_time = move(temp);
    }

    vector<vector<ll>> best_profit(n + 1, vector<ll>(n + 1));
    for (int x = 1; x <= n; x++) {
        for (int y = 1; y <= n; y++) {
            for (int item = 1; item <= k; item++) {
                if (buy[x][item] != -1 && sell[y][item] != -1) {
                    best_profit[x][y] = max(best_profit[x][y], 1LL * sell[y][item] - buy[x][item]);
                }
            }
        }
    }

    auto Check = [&](ll coef) {
        vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, -INF));
        for (int x = 1; x <= n; x++) {
            for (int y = 1; y <= n; y++) {
                if (x != y && travel_time[x][y] != INF) {
                    dp[x][y] = best_profit[x][y] - travel_time[x][y] * coef;
                }
            }
        }

        for (int z = 1; z <= n; z++) {
            auto temp = dp;
            for (int x = 1; x <= n; x++) {
                for (int y = 1; y <= n; y++) {
                    temp[x][y] = max(temp[x][y], dp[x][z] + dp[z][y]);            
                }
            }
            dp = move(temp);
        }  

        for (int i = 1; i <= n; i++) {
            if (dp[i][i] >= 0) {
                return false;
            }
        }

        return true;
    };

    ll result = (1LL << 31);
    for (int step = 1 << 30; step; step >>= 1) {
        if (result >= step && Check(result - step)) {
            result -= step;
        }
    }

    cout << result - 1;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 1372 KB Output is correct
2 Correct 41 ms 600 KB Output is correct
3 Correct 41 ms 600 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 6 ms 548 KB Output is correct
7 Correct 7 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 544 KB Output is correct
10 Correct 6 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 548 KB Output is correct
2 Correct 7 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 6 ms 544 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 348 KB Output is correct
9 Correct 7 ms 604 KB Output is correct
10 Correct 8 ms 452 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 8 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 7 ms 560 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 7 ms 348 KB Output is correct
18 Correct 9 ms 860 KB Output is correct
19 Correct 7 ms 604 KB Output is correct
20 Correct 7 ms 604 KB Output is correct
21 Correct 7 ms 348 KB Output is correct
22 Correct 7 ms 348 KB Output is correct
23 Correct 8 ms 604 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 564 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
29 Correct 7 ms 568 KB Output is correct
30 Correct 8 ms 604 KB Output is correct
31 Correct 7 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 8 ms 564 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 7 ms 568 KB Output is correct
6 Correct 8 ms 604 KB Output is correct
7 Correct 7 ms 348 KB Output is correct
8 Correct 46 ms 856 KB Output is correct
9 Correct 82 ms 1364 KB Output is correct
10 Correct 43 ms 600 KB Output is correct
11 Correct 46 ms 860 KB Output is correct
12 Correct 45 ms 860 KB Output is correct
13 Correct 43 ms 600 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 8 ms 452 KB Output is correct
3 Correct 7 ms 348 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 8 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 7 ms 560 KB Output is correct
8 Correct 7 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 9 ms 860 KB Output is correct
11 Correct 7 ms 604 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 46 ms 856 KB Output is correct
18 Correct 82 ms 1364 KB Output is correct
19 Correct 43 ms 600 KB Output is correct
20 Correct 46 ms 860 KB Output is correct
21 Correct 45 ms 860 KB Output is correct
22 Correct 43 ms 600 KB Output is correct
23 Correct 7 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 8 ms 564 KB Output is correct
26 Correct 7 ms 348 KB Output is correct
27 Correct 7 ms 568 KB Output is correct
28 Correct 8 ms 604 KB Output is correct
29 Correct 7 ms 348 KB Output is correct
30 Correct 60 ms 1372 KB Output is correct
31 Correct 41 ms 600 KB Output is correct
32 Correct 41 ms 600 KB Output is correct
33 Correct 6 ms 348 KB Output is correct
34 Correct 6 ms 348 KB Output is correct
35 Correct 6 ms 548 KB Output is correct
36 Correct 7 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 544 KB Output is correct
39 Correct 6 ms 348 KB Output is correct
40 Correct 7 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 7 ms 348 KB Output is correct
43 Correct 42 ms 600 KB Output is correct
44 Correct 43 ms 860 KB Output is correct
45 Correct 55 ms 1892 KB Output is correct
46 Correct 43 ms 856 KB Output is correct
47 Correct 43 ms 856 KB Output is correct
48 Correct 46 ms 860 KB Output is correct
49 Correct 86 ms 3504 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 42 ms 604 KB Output is correct
53 Correct 49 ms 1108 KB Output is correct
54 Correct 42 ms 856 KB Output is correct
55 Correct 42 ms 604 KB Output is correct
56 Correct 42 ms 604 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 8 ms 604 KB Output is correct
59 Correct 8 ms 604 KB Output is correct
60 Correct 8 ms 604 KB Output is correct
61 Correct 91 ms 3396 KB Output is correct
62 Correct 88 ms 3392 KB Output is correct
63 Correct 0 ms 544 KB Output is correct