oj.uz

Submission #370718

# Submission time Handle Problem Language Result Execution time Memory
370718 2021-02-24T14:03:15 Z mihai145 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 102 ms 4332 KB 
//
// Created by mihai145 on 24.02.2021.
//

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

const int NMAX = 100;
const int KMAX = 1000;
const long long INF = 1e9;

int N, M, K;
long long buy[NMAX + 2][KMAX + 2], sell[NMAX + 2][KMAX + 2];
long long bestProfit[NMAX + 2][NMAX + 2], minTime[NMAX + 2][NMAX + 2];

void CalcBestProfit() {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            for (int k = 1; k <= K; k++) {
                if (sell[j][k] != -1 && buy[i][k] != -1) {
                    bestProfit[i][j] = max(bestProfit[i][j], sell[j][k] - buy[i][k]);
                }
            }
        }
    }
}

void CalcMinTime() {
    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                minTime[i][j] = min(minTime[i][j], minTime[i][k] + minTime[k][j]);
            }
        }
    }
}

long long mt[NMAX + 2][NMAX + 2];

bool Can(long long R) {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            mt[i][j] = bestProfit[i][j] - R * minTime[i][j];
        }
    }

    for (int k = 1; k <= N; k++) {
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                mt[i][j] = max(mt[i][j], mt[i][k] + mt[k][j]);
            }
        }
    }

    for (int i = 1; i <= N; i++) {
        if (mt[i][i] >= 0) {
            return true;
        }
    }

    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> M >> K;

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= K; j++) {
            cin >> buy[i][j] >> sell[i][j];
        }
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            minTime[i][j] = INF;
        }
    }
    for (int i = 1; i <= M; i++) {
        int u, v, t;
        cin >> u >> v >> t;
        minTime[u][v] = t;
    }

    CalcBestProfit();
    CalcMinTime();

    long long st = 0, dr = INF, sol = 0;

    while (st <= dr) {
        long long mid = (st + dr) >> 1;

        if (Can(mid)) {
            sol = mid;
            st = mid + 1;
        } else {
            dr = mid - 1;
        }
    }

    cout << sol << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2028 KB Output is correct
2 Correct 37 ms 1260 KB Output is correct
3 Correct 37 ms 1260 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 6 ms 876 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1132 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 6 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 7 ms 968 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 876 KB Output is correct
2 Correct 7 ms 1132 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 6 ms 876 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 7 ms 968 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 8 ms 876 KB Output is correct
12 Correct 6 ms 876 KB Output is correct
13 Correct 10 ms 876 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 7 ms 876 KB Output is correct
16 Correct 7 ms 876 KB Output is correct
17 Correct 6 ms 876 KB Output is correct
18 Correct 6 ms 876 KB Output is correct
19 Correct 7 ms 1004 KB Output is correct
20 Correct 7 ms 1004 KB Output is correct
21 Correct 6 ms 876 KB Output is correct
22 Correct 6 ms 876 KB Output is correct
23 Correct 9 ms 1004 KB Output is correct
24 Correct 6 ms 876 KB Output is correct
25 Correct 7 ms 1004 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 7 ms 1004 KB Output is correct
28 Correct 7 ms 1004 KB Output is correct
29 Correct 7 ms 1004 KB Output is correct
30 Correct 7 ms 876 KB Output is correct
31 Correct 6 ms 876 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1004 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 7 ms 1004 KB Output is correct
4 Correct 7 ms 1004 KB Output is correct
5 Correct 7 ms 1004 KB Output is correct
6 Correct 7 ms 876 KB Output is correct
7 Correct 6 ms 876 KB Output is correct
8 Correct 42 ms 1516 KB Output is correct
9 Correct 89 ms 2156 KB Output is correct
10 Correct 40 ms 1516 KB Output is correct
11 Correct 44 ms 1772 KB Output is correct
12 Correct 43 ms 1772 KB Output is correct
13 Correct 50 ms 1516 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 876 KB Output is correct
2 Correct 6 ms 876 KB Output is correct
3 Correct 8 ms 876 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 10 ms 876 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 7 ms 876 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 7 ms 1004 KB Output is correct
12 Correct 7 ms 1004 KB Output is correct
13 Correct 6 ms 876 KB Output is correct
14 Correct 6 ms 876 KB Output is correct
15 Correct 9 ms 1004 KB Output is correct
16 Correct 6 ms 876 KB Output is correct
17 Correct 42 ms 1516 KB Output is correct
18 Correct 89 ms 2156 KB Output is correct
19 Correct 40 ms 1516 KB Output is correct
20 Correct 44 ms 1772 KB Output is correct
21 Correct 43 ms 1772 KB Output is correct
22 Correct 50 ms 1516 KB Output is correct
23 Correct 7 ms 1004 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 7 ms 1004 KB Output is correct
26 Correct 7 ms 1004 KB Output is correct
27 Correct 7 ms 1004 KB Output is correct
28 Correct 7 ms 876 KB Output is correct
29 Correct 6 ms 876 KB Output is correct
30 Correct 65 ms 2028 KB Output is correct
31 Correct 37 ms 1260 KB Output is correct
32 Correct 37 ms 1260 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 6 ms 876 KB Output is correct
35 Correct 6 ms 876 KB Output is correct
36 Correct 7 ms 1132 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 6 ms 876 KB Output is correct
39 Correct 6 ms 876 KB Output is correct
40 Correct 6 ms 876 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 7 ms 968 KB Output is correct
43 Correct 38 ms 1388 KB Output is correct
44 Correct 40 ms 1644 KB Output is correct
45 Correct 59 ms 2668 KB Output is correct
46 Correct 40 ms 1644 KB Output is correct
47 Correct 40 ms 1644 KB Output is correct
48 Correct 40 ms 1772 KB Output is correct
49 Correct 95 ms 4196 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 37 ms 1448 KB Output is correct
53 Correct 39 ms 1516 KB Output is correct
54 Correct 39 ms 1516 KB Output is correct
55 Correct 40 ms 1388 KB Output is correct
56 Correct 37 ms 1388 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 8 ms 1004 KB Output is correct
59 Correct 8 ms 1004 KB Output is correct
60 Correct 8 ms 1004 KB Output is correct
61 Correct 102 ms 4204 KB Output is correct
62 Correct 100 ms 4332 KB Output is correct
63 Correct 1 ms 364 KB Output is correct