oj.uz

Submission #409211

# Submission time Handle Problem Language Result Execution time Memory
409211 2021-05-20T11:05:24 Z tengiz05 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 209 ms 3224 KB 
#include <bits/stdc++.h>
using i64 = long long;
constexpr i64 inf = 1e18 + 1999;
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m, k;
    std::cin >> n >> m >> k;
    std::vector<std::vector<i64>> e(n, std::vector<i64>(n, inf)), prof(n, std::vector<i64>(n, 0));
    std::vector<std::vector<i64>> b(n, std::vector<i64>(k)), s(n, std::vector<i64>(k));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++)
            std::cin >> b[i][j] >> s[i][j];
    }
    for (int i = 0; i < m; i++) {
        int u, v, w;
        std::cin >> u >> v >> w;
        u--;
        v--;
        e[u][v] = std::min(e[u][v], i64(w));
    }
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                e[i][j] = std::min(e[i][j], e[i][k] + e[k][j]);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int c = 0; c < k; c++) {
                if (~b[i][c] && ~s[j][c]) {
                    prof[i][j] = std::max(prof[i][j], s[j][c] - b[i][c]);
                }
            }
        }
    }
    auto check = [&](int times) -> bool {
        std::vector<std::vector<i64>> a(n, std::vector<i64>(n, -inf));
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (e[i][j] != inf)
                        a[i][j] = std::max(a[i][j], prof[i][j] - e[i][j] * times);
                }
            }
        }
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    a[i][j] = std::max(a[i][j], a[i][k] + a[k][j]);
                }
            }
        }
        for (int i = 0; i < n; i++) {
            if (a[i][i] >= 0) {
                return true;
            }
        }
        return false;
    };
    i64 l = -1, r = 1e9 + 10;
    while (l + 1 < r) {
        int mid = (l + r) / 2;
        if (check(mid)) {
            l = mid;
        } else {
            r = mid;
        }
    }
    std::cout << l << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 2116 KB Output is correct
2 Correct 136 ms 568 KB Output is correct
3 Correct 158 ms 568 KB Output is correct
4 Correct 18 ms 332 KB Output is correct
5 Correct 18 ms 392 KB Output is correct
6 Correct 18 ms 332 KB Output is correct
7 Correct 19 ms 460 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 18 ms 384 KB Output is correct
10 Correct 19 ms 392 KB Output is correct
11 Correct 18 ms 384 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 16 ms 456 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 332 KB Output is correct
2 Correct 19 ms 460 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 18 ms 384 KB Output is correct
5 Correct 19 ms 392 KB Output is correct
6 Correct 18 ms 384 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 16 ms 456 KB Output is correct
9 Correct 19 ms 396 KB Output is correct
10 Correct 18 ms 332 KB Output is correct
11 Correct 19 ms 332 KB Output is correct
12 Correct 17 ms 332 KB Output is correct
13 Correct 19 ms 476 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 14 ms 388 KB Output is correct
16 Correct 16 ms 444 KB Output is correct
17 Correct 14 ms 332 KB Output is correct
18 Correct 14 ms 404 KB Output is correct
19 Correct 20 ms 460 KB Output is correct
20 Correct 16 ms 460 KB Output is correct
21 Correct 18 ms 404 KB Output is correct
22 Correct 20 ms 424 KB Output is correct
23 Correct 20 ms 472 KB Output is correct
24 Correct 18 ms 388 KB Output is correct
25 Correct 19 ms 432 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 20 ms 460 KB Output is correct
28 Correct 19 ms 460 KB Output is correct
29 Correct 17 ms 460 KB Output is correct
30 Correct 19 ms 332 KB Output is correct
31 Correct 15 ms 332 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 432 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 20 ms 460 KB Output is correct
4 Correct 19 ms 460 KB Output is correct
5 Correct 17 ms 460 KB Output is correct
6 Correct 19 ms 332 KB Output is correct
7 Correct 15 ms 332 KB Output is correct
8 Correct 141 ms 636 KB Output is correct
9 Correct 188 ms 3108 KB Output is correct
10 Correct 137 ms 708 KB Output is correct
11 Correct 142 ms 972 KB Output is correct
12 Correct 141 ms 852 KB Output is correct
13 Correct 136 ms 692 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 396 KB Output is correct
2 Correct 18 ms 332 KB Output is correct
3 Correct 19 ms 332 KB Output is correct
4 Correct 17 ms 332 KB Output is correct
5 Correct 19 ms 476 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 14 ms 388 KB Output is correct
8 Correct 16 ms 444 KB Output is correct
9 Correct 14 ms 332 KB Output is correct
10 Correct 14 ms 404 KB Output is correct
11 Correct 20 ms 460 KB Output is correct
12 Correct 16 ms 460 KB Output is correct
13 Correct 18 ms 404 KB Output is correct
14 Correct 20 ms 424 KB Output is correct
15 Correct 20 ms 472 KB Output is correct
16 Correct 18 ms 388 KB Output is correct
17 Correct 141 ms 636 KB Output is correct
18 Correct 188 ms 3108 KB Output is correct
19 Correct 137 ms 708 KB Output is correct
20 Correct 142 ms 972 KB Output is correct
21 Correct 141 ms 852 KB Output is correct
22 Correct 136 ms 692 KB Output is correct
23 Correct 19 ms 432 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 20 ms 460 KB Output is correct
26 Correct 19 ms 460 KB Output is correct
27 Correct 17 ms 460 KB Output is correct
28 Correct 19 ms 332 KB Output is correct
29 Correct 15 ms 332 KB Output is correct
30 Correct 168 ms 2116 KB Output is correct
31 Correct 136 ms 568 KB Output is correct
32 Correct 158 ms 568 KB Output is correct
33 Correct 18 ms 332 KB Output is correct
34 Correct 18 ms 392 KB Output is correct
35 Correct 18 ms 332 KB Output is correct
36 Correct 19 ms 460 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 18 ms 384 KB Output is correct
39 Correct 19 ms 392 KB Output is correct
40 Correct 18 ms 384 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 16 ms 456 KB Output is correct
43 Correct 140 ms 600 KB Output is correct
44 Correct 142 ms 780 KB Output is correct
45 Correct 158 ms 2284 KB Output is correct
46 Correct 139 ms 764 KB Output is correct
47 Correct 138 ms 716 KB Output is correct
48 Correct 138 ms 780 KB Output is correct
49 Correct 196 ms 3224 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 136 ms 588 KB Output is correct
53 Correct 142 ms 588 KB Output is correct
54 Correct 110 ms 656 KB Output is correct
55 Correct 140 ms 580 KB Output is correct
56 Correct 151 ms 600 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 18 ms 460 KB Output is correct
59 Correct 18 ms 556 KB Output is correct
60 Correct 15 ms 560 KB Output is correct
61 Correct 209 ms 3192 KB Output is correct
62 Correct 201 ms 3144 KB Output is correct
63 Correct 1 ms 204 KB Output is correct