oj.uz

Submission #232045

# Submission time Handle Problem Language Result Execution time Memory
232045 2020-05-15T19:21:06 Z parsa_mobed Travelling Merchant (APIO17_merchant) C++14
100 / 100
 114 ms 4216 KB 
#include <bits/stdc++.h>

using namespace std;
#define int long long
const int N = 101, K = 1001, inf = 2e9;
int cost[N][N], d[N][N], dis[N][N], B[N][K], S[N][K], n;

bool check(int x) {
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) d[i][j] = dis[i][j] * x - cost[i][j];
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++) if (i != j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j && d[i][j] + d[j][i] <= 0) return 1;
    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int m, k; cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= k; j++) cin >> B[i][j] >> S[i][j];
    for (int u = 1; u <= n; u++)
        for (int v = 1; v <= n; v++)
            for (int i = 1; i <= k; i++) if (B[u][i] != -1 && S[v][i] != -1)
                cost[u][v] = max(cost[u][v], S[v][i] - B[u][i]);
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (i != j) dis[i][j] = inf;
    for (int i = 0; i < m; i++) {int u, v, w; cin >> u >> v >> w, dis[u][v] = min(dis[u][v], w);}
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++) dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
    int dw = 0, up = inf;
    while (up - dw > 1) {
        int md = (up+dw)>>1;
        if (check(md)) dw = md;
        else up = md;
    }
    cout << dw << "\n";

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 2048 KB Output is correct
2 Correct 46 ms 1280 KB Output is correct
3 Correct 47 ms 1280 KB Output is correct
4 Correct 11 ms 768 KB Output is correct
5 Correct 11 ms 768 KB Output is correct
6 Correct 11 ms 768 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 11 ms 768 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 11 ms 768 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 11 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1656 KB Output is correct
2 Correct 108 ms 2168 KB Output is correct
3 Correct 49 ms 1408 KB Output is correct
4 Correct 54 ms 1536 KB Output is correct
5 Correct 53 ms 1792 KB Output is correct
6 Correct 51 ms 1536 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 12 ms 1024 KB Output is correct
10 Correct 12 ms 896 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 14 ms 1024 KB Output is correct
13 Correct 12 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 896 KB Output is correct
2 Correct 11 ms 896 KB Output is correct
3 Correct 13 ms 768 KB Output is correct
4 Correct 11 ms 896 KB Output is correct
5 Correct 12 ms 896 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 11 ms 896 KB Output is correct
9 Correct 12 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 13 ms 1024 KB Output is correct
12 Correct 12 ms 1024 KB Output is correct
13 Correct 11 ms 896 KB Output is correct
14 Correct 11 ms 896 KB Output is correct
15 Correct 13 ms 1024 KB Output is correct
16 Correct 11 ms 896 KB Output is correct
17 Correct 57 ms 1656 KB Output is correct
18 Correct 108 ms 2168 KB Output is correct
19 Correct 49 ms 1408 KB Output is correct
20 Correct 54 ms 1536 KB Output is correct
21 Correct 53 ms 1792 KB Output is correct
22 Correct 51 ms 1536 KB Output is correct
23 Correct 12 ms 1024 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 12 ms 896 KB Output is correct
27 Correct 12 ms 896 KB Output is correct
28 Correct 14 ms 1024 KB Output is correct
29 Correct 12 ms 896 KB Output is correct
30 Correct 48 ms 1408 KB Output is correct
31 Correct 53 ms 1664 KB Output is correct
32 Correct 66 ms 2680 KB Output is correct
33 Correct 50 ms 1536 KB Output is correct
34 Correct 50 ms 1664 KB Output is correct
35 Correct 50 ms 1664 KB Output is correct
36 Correct 113 ms 4216 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 48 ms 1408 KB Output is correct
40 Correct 59 ms 1536 KB Output is correct
41 Correct 50 ms 1408 KB Output is correct
42 Correct 49 ms 1408 KB Output is correct
43 Correct 48 ms 1408 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 13 ms 1024 KB Output is correct
46 Correct 13 ms 1024 KB Output is correct
47 Correct 13 ms 1024 KB Output is correct
48 Correct 114 ms 4216 KB Output is correct
49 Correct 112 ms 4216 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 76 ms 2048 KB Output is correct
52 Correct 46 ms 1280 KB Output is correct
53 Correct 47 ms 1280 KB Output is correct
54 Correct 11 ms 768 KB Output is correct
55 Correct 11 ms 768 KB Output is correct
56 Correct 11 ms 768 KB Output is correct
57 Correct 11 ms 896 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 11 ms 768 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 11 ms 768 KB Output is correct
62 Correct 5 ms 512 KB Output is correct
63 Correct 11 ms 896 KB Output is correct