oj.uz

Submission #57837

# Submission time Handle Problem Language Result Execution time Memory
57837 2018-07-16T09:52:44 Z Jeez Travelling Merchant (APIO17_merchant) C++14
100 / 100
 233 ms 12728 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 160 ms 1656 KB Output is correct
2 Correct 123 ms 1656 KB Output is correct
3 Correct 119 ms 1776 KB Output is correct
4 Correct 28 ms 1776 KB Output is correct
5 Correct 17 ms 1776 KB Output is correct
6 Correct 21 ms 1776 KB Output is correct
7 Correct 14 ms 1776 KB Output is correct
8 Correct 3 ms 1776 KB Output is correct
9 Correct 13 ms 1776 KB Output is correct
10 Correct 13 ms 1776 KB Output is correct
11 Correct 13 ms 1776 KB Output is correct
12 Correct 4 ms 1776 KB Output is correct
13 Correct 23 ms 1776 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 2704 KB Output is correct
2 Correct 169 ms 4380 KB Output is correct
3 Correct 125 ms 4484 KB Output is correct
4 Correct 136 ms 4776 KB Output is correct
5 Correct 100 ms 4916 KB Output is correct
6 Correct 118 ms 5000 KB Output is correct
7 Correct 24 ms 2036 KB Output is correct
8 Correct 3 ms 2036 KB Output is correct
9 Correct 16 ms 2036 KB Output is correct
10 Correct 15 ms 2036 KB Output is correct
11 Correct 25 ms 2036 KB Output is correct
12 Correct 20 ms 2048 KB Output is correct
13 Correct 19 ms 2200 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1776 KB Output is correct
2 Correct 19 ms 1776 KB Output is correct
3 Correct 20 ms 1776 KB Output is correct
4 Correct 24 ms 1776 KB Output is correct
5 Correct 21 ms 1776 KB Output is correct
6 Correct 3 ms 1776 KB Output is correct
7 Correct 25 ms 1776 KB Output is correct
8 Correct 22 ms 1776 KB Output is correct
9 Correct 18 ms 1776 KB Output is correct
10 Correct 15 ms 1776 KB Output is correct
11 Correct 18 ms 1776 KB Output is correct
12 Correct 18 ms 1776 KB Output is correct
13 Correct 21 ms 1776 KB Output is correct
14 Correct 16 ms 1776 KB Output is correct
15 Correct 18 ms 2036 KB Output is correct
16 Correct 25 ms 2036 KB Output is correct
17 Correct 133 ms 2704 KB Output is correct
18 Correct 169 ms 4380 KB Output is correct
19 Correct 125 ms 4484 KB Output is correct
20 Correct 136 ms 4776 KB Output is correct
21 Correct 100 ms 4916 KB Output is correct
22 Correct 118 ms 5000 KB Output is correct
23 Correct 24 ms 2036 KB Output is correct
24 Correct 3 ms 2036 KB Output is correct
25 Correct 16 ms 2036 KB Output is correct
26 Correct 15 ms 2036 KB Output is correct
27 Correct 25 ms 2036 KB Output is correct
28 Correct 20 ms 2048 KB Output is correct
29 Correct 19 ms 2200 KB Output is correct
30 Correct 130 ms 5216 KB Output is correct
31 Correct 112 ms 5296 KB Output is correct
32 Correct 138 ms 5688 KB Output is correct
33 Correct 158 ms 5796 KB Output is correct
34 Correct 151 ms 5796 KB Output is correct
35 Correct 147 ms 5880 KB Output is correct
36 Correct 233 ms 7904 KB Output is correct
37 Correct 3 ms 7904 KB Output is correct
38 Correct 2 ms 7904 KB Output is correct
39 Correct 142 ms 7904 KB Output is correct
40 Correct 146 ms 7904 KB Output is correct
41 Correct 137 ms 7996 KB Output is correct
42 Correct 103 ms 8032 KB Output is correct
43 Correct 112 ms 8164 KB Output is correct
44 Correct 3 ms 8164 KB Output is correct
45 Correct 20 ms 8164 KB Output is correct
46 Correct 22 ms 8164 KB Output is correct
47 Correct 22 ms 8164 KB Output is correct
48 Correct 220 ms 10552 KB Output is correct
49 Correct 190 ms 12728 KB Output is correct
50 Correct 2 ms 12728 KB Output is correct
51 Correct 160 ms 1656 KB Output is correct
52 Correct 123 ms 1656 KB Output is correct
53 Correct 119 ms 1776 KB Output is correct
54 Correct 28 ms 1776 KB Output is correct
55 Correct 17 ms 1776 KB Output is correct
56 Correct 21 ms 1776 KB Output is correct
57 Correct 14 ms 1776 KB Output is correct
58 Correct 3 ms 1776 KB Output is correct
59 Correct 13 ms 1776 KB Output is correct
60 Correct 13 ms 1776 KB Output is correct
61 Correct 13 ms 1776 KB Output is correct
62 Correct 4 ms 1776 KB Output is correct
63 Correct 23 ms 1776 KB Output is correct