oj.uz

Submission #52093

# Submission time Handle Problem Language Result Execution time Memory
52093 2018-06-23T20:31:42 Z Angelos Travelling Merchant (APIO17_merchant) C++17
100 / 100
 176 ms 9960 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 170 ms 1400 KB Output is correct
2 Correct 120 ms 1508 KB Output is correct
3 Correct 85 ms 1676 KB Output is correct
4 Correct 17 ms 1676 KB Output is correct
5 Correct 14 ms 1676 KB Output is correct
6 Correct 28 ms 1676 KB Output is correct
7 Correct 16 ms 1676 KB Output is correct
8 Correct 2 ms 1676 KB Output is correct
9 Correct 12 ms 1676 KB Output is correct
10 Correct 18 ms 1676 KB Output is correct
11 Correct 18 ms 1676 KB Output is correct
12 Correct 3 ms 1676 KB Output is correct
13 Correct 24 ms 1676 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 1708 KB Output is correct
2 Correct 157 ms 1836 KB Output is correct
3 Correct 108 ms 1840 KB Output is correct
4 Correct 126 ms 2052 KB Output is correct
5 Correct 85 ms 2452 KB Output is correct
6 Correct 98 ms 2520 KB Output is correct
7 Correct 17 ms 1676 KB Output is correct
8 Correct 3 ms 1676 KB Output is correct
9 Correct 21 ms 1676 KB Output is correct
10 Correct 16 ms 1676 KB Output is correct
11 Correct 19 ms 1676 KB Output is correct
12 Correct 13 ms 1676 KB Output is correct
13 Correct 13 ms 1676 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1676 KB Output is correct
2 Correct 15 ms 1676 KB Output is correct
3 Correct 18 ms 1676 KB Output is correct
4 Correct 16 ms 1676 KB Output is correct
5 Correct 17 ms 1676 KB Output is correct
6 Correct 2 ms 1676 KB Output is correct
7 Correct 15 ms 1676 KB Output is correct
8 Correct 20 ms 1676 KB Output is correct
9 Correct 16 ms 1676 KB Output is correct
10 Correct 18 ms 1676 KB Output is correct
11 Correct 15 ms 1676 KB Output is correct
12 Correct 15 ms 1676 KB Output is correct
13 Correct 14 ms 1676 KB Output is correct
14 Correct 14 ms 1676 KB Output is correct
15 Correct 16 ms 1676 KB Output is correct
16 Correct 15 ms 1676 KB Output is correct
17 Correct 108 ms 1708 KB Output is correct
18 Correct 157 ms 1836 KB Output is correct
19 Correct 108 ms 1840 KB Output is correct
20 Correct 126 ms 2052 KB Output is correct
21 Correct 85 ms 2452 KB Output is correct
22 Correct 98 ms 2520 KB Output is correct
23 Correct 17 ms 1676 KB Output is correct
24 Correct 3 ms 1676 KB Output is correct
25 Correct 21 ms 1676 KB Output is correct
26 Correct 16 ms 1676 KB Output is correct
27 Correct 19 ms 1676 KB Output is correct
28 Correct 13 ms 1676 KB Output is correct
29 Correct 13 ms 1676 KB Output is correct
30 Correct 108 ms 2532 KB Output is correct
31 Correct 113 ms 2668 KB Output is correct
32 Correct 111 ms 3000 KB Output is correct
33 Correct 116 ms 3120 KB Output is correct
34 Correct 113 ms 3184 KB Output is correct
35 Correct 113 ms 3484 KB Output is correct
36 Correct 176 ms 5256 KB Output is correct
37 Correct 2 ms 5256 KB Output is correct
38 Correct 2 ms 5256 KB Output is correct
39 Correct 103 ms 5316 KB Output is correct
40 Correct 120 ms 5336 KB Output is correct
41 Correct 113 ms 5464 KB Output is correct
42 Correct 102 ms 5628 KB Output is correct
43 Correct 108 ms 5628 KB Output is correct
44 Correct 2 ms 5628 KB Output is correct
45 Correct 18 ms 5628 KB Output is correct
46 Correct 18 ms 5628 KB Output is correct
47 Correct 17 ms 5628 KB Output is correct
48 Correct 173 ms 7912 KB Output is correct
49 Correct 164 ms 9960 KB Output is correct
50 Correct 2 ms 9960 KB Output is correct
51 Correct 170 ms 1400 KB Output is correct
52 Correct 120 ms 1508 KB Output is correct
53 Correct 85 ms 1676 KB Output is correct
54 Correct 17 ms 1676 KB Output is correct
55 Correct 14 ms 1676 KB Output is correct
56 Correct 28 ms 1676 KB Output is correct
57 Correct 16 ms 1676 KB Output is correct
58 Correct 2 ms 1676 KB Output is correct
59 Correct 12 ms 1676 KB Output is correct
60 Correct 18 ms 1676 KB Output is correct
61 Correct 18 ms 1676 KB Output is correct
62 Correct 3 ms 1676 KB Output is correct
63 Correct 24 ms 1676 KB Output is correct