oj.uz

Submission #704082

# Submission time Handle Problem Language Result Execution time Memory
704082 2023-03-01T14:15:52 Z Cyanmond Travelling Merchant (APIO17_merchant) C++17
100 / 100
 81 ms 2132 KB 
#include <bits/stdc++.h>

using i64 = long long;
constexpr int inf32 = 1 << 30;
constexpr i64 inf = 1ll << 50;

void calcMinDist(std::vector<std::vector<i64>> &graph) {
    const int n = (int)graph.size();
    for (int k = 0; k < n; ++k) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                graph[i][j] = std::min(graph[i][j], graph[i][k] + graph[k][j]);
            }
        }
    }
}

void calcMaxDist(std::vector<std::vector<i64>> &graph) {
    const int n = (int)graph.size();
    for (int k = 0; k < n; ++k) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                graph[i][j] = std::max(graph[i][j], graph[i][k] + graph[k][j]);
                graph[i][j] = std::min(graph[i][j], inf / 10);
            }
        }
    }
}

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>> buyList(N, std::vector<i64>(K)), sellList(N, std::vector<i64>(K));
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < K; ++j) {
            std::cin >> buyList[i][j] >> sellList[i][j];
        }
    }
    std::vector<std::vector<i64>> baseGraph(N, std::vector<i64>(N, inf32));
    for (int i = 0; i < M; ++i) {
        int v, w;
        i64 t;
        std::cin >> v >> w >> t;
        --v, --w;
        baseGraph[v][w] = t;
    }
    calcMinDist(baseGraph);
    std::vector<std::vector<i64>> profitList(N, std::vector<i64>(N));
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            i64 ma = 0;
            for (int k = 0; k < K; ++k) {
                if (buyList[i][k] == -1 or sellList[j][k] == -1) {
                    continue;
                }
                ma = std::max(ma, sellList[j][k] - buyList[i][k]);
            }
            profitList[i][j] = ma;
        }
    }

    i64 ok = 0, ng = inf32;
    while (ng - ok > 1) {
        const auto mid = (ok + ng) / 2;
        std::vector<std::vector<i64>> realGraph(N, std::vector<i64>(N));
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                realGraph[i][j] = (profitList[i][j] - mid * baseGraph[i][j]);
                realGraph[i][j] = std::max(realGraph[i][j], -inf);
            }
        }
        for (int i = 0; i < N; ++i) {
            realGraph[i][i] = -inf;
        }
        calcMaxDist(realGraph);
        bool isOk = false;
        for (int i = 0; i < N; ++i) {
            if (realGraph[i][i] >= 0) {
                isOk = true;
            }
        }
        if (isOk) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    std::cout << ok << std::endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2124 KB Output is correct
2 Correct 40 ms 468 KB Output is correct
3 Correct 42 ms 572 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 8 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 8 ms 392 KB Output is correct
11 Correct 6 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 8 ms 340 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 6 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 8 ms 392 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 8 ms 340 KB Output is correct
9 Correct 8 ms 340 KB Output is correct
10 Correct 6 ms 400 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 6 ms 340 KB Output is correct
16 Correct 6 ms 340 KB Output is correct
17 Correct 6 ms 340 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 8 ms 340 KB Output is correct
20 Correct 6 ms 340 KB Output is correct
21 Correct 6 ms 340 KB Output is correct
22 Correct 6 ms 408 KB Output is correct
23 Correct 9 ms 468 KB Output is correct
24 Correct 6 ms 392 KB Output is correct
25 Correct 6 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 7 ms 340 KB Output is correct
28 Correct 6 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 6 ms 340 KB Output is correct
31 Correct 6 ms 340 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 42 ms 724 KB Output is correct
9 Correct 73 ms 1896 KB Output is correct
10 Correct 40 ms 620 KB Output is correct
11 Correct 42 ms 712 KB Output is correct
12 Correct 42 ms 724 KB Output is correct
13 Correct 42 ms 620 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 340 KB Output is correct
2 Correct 6 ms 400 KB Output is correct
3 Correct 8 ms 340 KB Output is correct
4 Correct 6 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 6 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 6 ms 408 KB Output is correct
15 Correct 9 ms 468 KB Output is correct
16 Correct 6 ms 392 KB Output is correct
17 Correct 42 ms 724 KB Output is correct
18 Correct 73 ms 1896 KB Output is correct
19 Correct 40 ms 620 KB Output is correct
20 Correct 42 ms 712 KB Output is correct
21 Correct 42 ms 724 KB Output is correct
22 Correct 42 ms 620 KB Output is correct
23 Correct 6 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 7 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 6 ms 340 KB Output is correct
28 Correct 6 ms 340 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 65 ms 2124 KB Output is correct
31 Correct 40 ms 468 KB Output is correct
32 Correct 42 ms 572 KB Output is correct
33 Correct 5 ms 340 KB Output is correct
34 Correct 8 ms 340 KB Output is correct
35 Correct 6 ms 340 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 5 ms 340 KB Output is correct
39 Correct 8 ms 392 KB Output is correct
40 Correct 6 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 41 ms 596 KB Output is correct
44 Correct 42 ms 724 KB Output is correct
45 Correct 55 ms 1804 KB Output is correct
46 Correct 41 ms 724 KB Output is correct
47 Correct 48 ms 724 KB Output is correct
48 Correct 41 ms 724 KB Output is correct
49 Correct 71 ms 2048 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 43 ms 572 KB Output is correct
53 Correct 41 ms 468 KB Output is correct
54 Correct 43 ms 596 KB Output is correct
55 Correct 40 ms 596 KB Output is correct
56 Correct 39 ms 468 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 7 ms 468 KB Output is correct
59 Correct 7 ms 468 KB Output is correct
60 Correct 7 ms 468 KB Output is correct
61 Correct 71 ms 2116 KB Output is correct
62 Correct 81 ms 2132 KB Output is correct
63 Correct 1 ms 212 KB Output is correct