oj.uz

Submission #979134

# Submission time Handle Problem Language Result Execution time Memory
979134 2024-05-10T09:32:55 Z Sharky Travelling Merchant (APIO17_merchant) C++17
100 / 100
 186 ms 4316 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int N = 101;
const int K = 1001;
const int INF = 1e18;

int n, m, k;
int dist[N][N], p[N][N], buy[N][K], sell[N][K];

bool check(int k) {
    vector<vector<int>> d(N, vector<int> (N, INF));
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
        if (j != i && dist[i][j] != INF) {
            d[i][j] = k * min(dist[i][j], INF / k) - p[i][j];
        }
    }
    for (int x = 1; x <= n; x++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
        if (d[i][x] < INF && d[x][j] < INF) d[i][j] = min(d[i][j], max(-INF, d[i][x] + d[x][j]));
    }
    for (int x = 1; x <= n; x++) if (d[x][x] <= 0) return true;
    return false;
}

int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0);
    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++) {
            if (i == j) continue;
            for (int id = 1; id <= k; id++) {
                if (sell[j][id] == -1 || buy[i][id] == -1) continue;
                p[i][j] = max(p[i][j], sell[j][id] - buy[i][id]);
            }
        }
    }
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j) dist[i][j] = INF;
    for (int i = 1; i <= m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        dist[u][v] = min(dist[u][v], w);
    }
    for (int x = 1; x <= n; x++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dist[i][j] = min(dist[i][j], dist[i][x] + dist[x][j]);
    int lb = 0, rb = INF;
    while (lb < rb) {
        int mid = (lb + rb + 1) / 2;
        if (check(mid)) lb = mid;
        else rb = mid - 1;
    }
    cout << lb << '\n';
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 3420 KB Output is correct
2 Correct 77 ms 1436 KB Output is correct
3 Correct 91 ms 1412 KB Output is correct
4 Correct 12 ms 860 KB Output is correct
5 Correct 12 ms 860 KB Output is correct
6 Correct 13 ms 1004 KB Output is correct
7 Correct 14 ms 860 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 13 ms 860 KB Output is correct
10 Correct 14 ms 1008 KB Output is correct
11 Correct 16 ms 860 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 11 ms 1064 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1004 KB Output is correct
2 Correct 14 ms 860 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 860 KB Output is correct
5 Correct 14 ms 1008 KB Output is correct
6 Correct 16 ms 860 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 11 ms 1064 KB Output is correct
9 Correct 15 ms 860 KB Output is correct
10 Correct 13 ms 860 KB Output is correct
11 Correct 14 ms 856 KB Output is correct
12 Correct 12 ms 860 KB Output is correct
13 Correct 24 ms 1112 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 9 ms 1044 KB Output is correct
16 Correct 14 ms 860 KB Output is correct
17 Correct 9 ms 1036 KB Output is correct
18 Correct 10 ms 1060 KB Output is correct
19 Correct 17 ms 1112 KB Output is correct
20 Correct 13 ms 1116 KB Output is correct
21 Correct 14 ms 856 KB Output is correct
22 Correct 16 ms 1056 KB Output is correct
23 Correct 15 ms 1116 KB Output is correct
24 Correct 18 ms 856 KB Output is correct
25 Correct 26 ms 1096 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 26 ms 1124 KB Output is correct
28 Correct 18 ms 860 KB Output is correct
29 Correct 17 ms 1116 KB Output is correct
30 Correct 14 ms 860 KB Output is correct
31 Correct 12 ms 856 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1096 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 26 ms 1124 KB Output is correct
4 Correct 18 ms 860 KB Output is correct
5 Correct 17 ms 1116 KB Output is correct
6 Correct 14 ms 860 KB Output is correct
7 Correct 12 ms 856 KB Output is correct
8 Correct 160 ms 1628 KB Output is correct
9 Correct 186 ms 4016 KB Output is correct
10 Correct 128 ms 1636 KB Output is correct
11 Correct 137 ms 1628 KB Output is correct
12 Correct 167 ms 1848 KB Output is correct
13 Correct 102 ms 1628 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 860 KB Output is correct
2 Correct 13 ms 860 KB Output is correct
3 Correct 14 ms 856 KB Output is correct
4 Correct 12 ms 860 KB Output is correct
5 Correct 24 ms 1112 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 9 ms 1044 KB Output is correct
8 Correct 14 ms 860 KB Output is correct
9 Correct 9 ms 1036 KB Output is correct
10 Correct 10 ms 1060 KB Output is correct
11 Correct 17 ms 1112 KB Output is correct
12 Correct 13 ms 1116 KB Output is correct
13 Correct 14 ms 856 KB Output is correct
14 Correct 16 ms 1056 KB Output is correct
15 Correct 15 ms 1116 KB Output is correct
16 Correct 18 ms 856 KB Output is correct
17 Correct 160 ms 1628 KB Output is correct
18 Correct 186 ms 4016 KB Output is correct
19 Correct 128 ms 1636 KB Output is correct
20 Correct 137 ms 1628 KB Output is correct
21 Correct 167 ms 1848 KB Output is correct
22 Correct 102 ms 1628 KB Output is correct
23 Correct 26 ms 1096 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 26 ms 1124 KB Output is correct
26 Correct 18 ms 860 KB Output is correct
27 Correct 17 ms 1116 KB Output is correct
28 Correct 14 ms 860 KB Output is correct
29 Correct 12 ms 856 KB Output is correct
30 Correct 96 ms 3420 KB Output is correct
31 Correct 77 ms 1436 KB Output is correct
32 Correct 91 ms 1412 KB Output is correct
33 Correct 12 ms 860 KB Output is correct
34 Correct 12 ms 860 KB Output is correct
35 Correct 13 ms 1004 KB Output is correct
36 Correct 14 ms 860 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 13 ms 860 KB Output is correct
39 Correct 14 ms 1008 KB Output is correct
40 Correct 16 ms 860 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 11 ms 1064 KB Output is correct
43 Correct 84 ms 1372 KB Output is correct
44 Correct 87 ms 1628 KB Output is correct
45 Correct 93 ms 2740 KB Output is correct
46 Correct 81 ms 1624 KB Output is correct
47 Correct 82 ms 1628 KB Output is correct
48 Correct 83 ms 1624 KB Output is correct
49 Correct 159 ms 4192 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 1 ms 412 KB Output is correct
52 Correct 85 ms 1372 KB Output is correct
53 Correct 81 ms 1584 KB Output is correct
54 Correct 89 ms 1372 KB Output is correct
55 Correct 85 ms 1368 KB Output is correct
56 Correct 87 ms 1620 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 17 ms 1152 KB Output is correct
59 Correct 17 ms 1116 KB Output is correct
60 Correct 11 ms 1116 KB Output is correct
61 Correct 127 ms 4316 KB Output is correct
62 Correct 134 ms 4292 KB Output is correct
63 Correct 1 ms 344 KB Output is correct