oj.uz

Submission #306222

# Submission time Handle Problem Language Result Execution time Memory
306222 2020-09-24T22:58:22 Z couplefire Travelling Merchant (APIO17_merchant) C++17
100 / 100
 162 ms 1528 KB 
#include "bits/stdc++.h"
using namespace std;

const int N = 105;
const int K = 1005;
const long long INF = 1e10;
const int MAX_ANS = 1e9 + 1;

int n, m, items;
int buy[N][K], sell[N][K];
long long dist[N][N], profit[N][N];
long long adj[N][N], adj2[N][N];

inline bool check(long long x) {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (dist[i][j] == INF) {
                adj[i][j] = -INF;
            } else {
                adj[i][j] = profit[i][j] - dist[i][j] * x;
                adj[i][j] = max(-INF, adj[i][j]);
            }
        }
        adj[i][i] = -INF;
    }
    long long res = -INF;
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                adj[i][j] = max(adj[i][j], adj[i][k] + adj[k][j]);
                res = max(res, adj[i][i]);
                if (res >= 0) {
                    return true;
                }
                adj[i][j] = min(adj[i][j], INF);
                adj2[i][j] = adj[i][j];
            }
        }
    }
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                adj2[i][j] = max(adj2[i][j], adj2[i][k] + adj2[k][j]);
                if (adj2[i][j] > adj[i][j]) {
                    return true;
                }
            }
        }
    }
    return false;
}

int main() {
    ios :: sync_with_stdio(false);
    cin >> n >> m >> items;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= items; j++) {
            cin >> buy[i][j] >> sell[i][j];
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dist[i][j] = INF;
        }
        dist[i][i] = 0;
    }
    for (int i = 1; i <= m; i++) {
        int u, v, w; cin >> u >> v >> w;
        dist[u][v] = min(dist[u][v], (long long) w);
    }
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            profit[i][j] = 0;
            for (int k = 1; k <= items; k++) {
                if (buy[i][k] == -1 || sell[j][k] == -1) continue;
                profit[i][j] = max(profit[i][j], (long long) sell[j][k] - (long long) buy[i][k]);
            }
        }
    }
    long long l = 1, r = MAX_ANS;
    long long ans = 0;
    while (l <= r) {
        long long mid = (l + r) >> 1;
        if (check(mid)) {
            l = mid + 1;
            ans = mid;
        } else {
            r = mid - 1;
        }
    }
    cout << ans << "\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 1528 KB Output is correct
2 Correct 106 ms 1408 KB Output is correct
3 Correct 63 ms 1408 KB Output is correct
4 Correct 14 ms 896 KB Output is correct
5 Correct 11 ms 896 KB Output is correct
6 Correct 15 ms 896 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 10 ms 896 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 16 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 1528 KB Output is correct
2 Correct 151 ms 1528 KB Output is correct
3 Correct 95 ms 1408 KB Output is correct
4 Correct 110 ms 1528 KB Output is correct
5 Correct 76 ms 1408 KB Output is correct
6 Correct 94 ms 1408 KB Output is correct
7 Correct 15 ms 896 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 11 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 14 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 896 KB Output is correct
2 Correct 12 ms 896 KB Output is correct
3 Correct 14 ms 896 KB Output is correct
4 Correct 13 ms 896 KB Output is correct
5 Correct 14 ms 896 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 12 ms 896 KB Output is correct
8 Correct 14 ms 896 KB Output is correct
9 Correct 9 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 12 ms 896 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 12 ms 896 KB Output is correct
15 Correct 11 ms 896 KB Output is correct
16 Correct 13 ms 896 KB Output is correct
17 Correct 95 ms 1528 KB Output is correct
18 Correct 151 ms 1528 KB Output is correct
19 Correct 95 ms 1408 KB Output is correct
20 Correct 110 ms 1528 KB Output is correct
21 Correct 76 ms 1408 KB Output is correct
22 Correct 94 ms 1408 KB Output is correct
23 Correct 15 ms 896 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 11 ms 896 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 14 ms 896 KB Output is correct
28 Correct 11 ms 896 KB Output is correct
29 Correct 11 ms 896 KB Output is correct
30 Correct 97 ms 1516 KB Output is correct
31 Correct 100 ms 1408 KB Output is correct
32 Correct 103 ms 1408 KB Output is correct
33 Correct 100 ms 1408 KB Output is correct
34 Correct 102 ms 1520 KB Output is correct
35 Correct 101 ms 1408 KB Output is correct
36 Correct 162 ms 1528 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 91 ms 1408 KB Output is correct
40 Correct 106 ms 1408 KB Output is correct
41 Correct 100 ms 1408 KB Output is correct
42 Correct 90 ms 1408 KB Output is correct
43 Correct 95 ms 1408 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 15 ms 896 KB Output is correct
46 Correct 15 ms 896 KB Output is correct
47 Correct 16 ms 1024 KB Output is correct
48 Correct 161 ms 1404 KB Output is correct
49 Correct 154 ms 1452 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 135 ms 1528 KB Output is correct
52 Correct 106 ms 1408 KB Output is correct
53 Correct 63 ms 1408 KB Output is correct
54 Correct 14 ms 896 KB Output is correct
55 Correct 11 ms 896 KB Output is correct
56 Correct 15 ms 896 KB Output is correct
57 Correct 11 ms 896 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 9 ms 896 KB Output is correct
60 Correct 10 ms 896 KB Output is correct
61 Correct 10 ms 896 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 16 ms 896 KB Output is correct