oj.uz

Submission #567456

# Submission time Handle Problem Language Result Execution time Memory
567456 2022-05-23T13:53:55 Z hoanghq2004 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 112 ms 4244 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e2 + 10;
const long long INF = 2e18 + 7;

int n, m, k;
int d[N][N];
long long w[N][N], f[N];
int p[N][N];
int B[N][N * N], S[N][N * N];

int check(int limit) {
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            w[i][j] = 1LL * limit * d[i][j] - p[i][j];
    for (int k = 1; k <= n; ++k) {
        for (int u = 1; u <= n; ++u)
            for (int v = 1; v <= n; ++v)
                w[u][v] = min(w[u][v], w[u][k] + w[k][v]);
        for (int u = 1; u <= n; ++u)
            for (int v = u + 1; v <= n; ++v)
                if (w[u][v] + w[v][u] <= 0) return 1;
    }
    return 0;
}

int 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 >> 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 (S[v][i] != -1 && B[u][i] != -1) p[u][v] = max(p[u][v], S[v][i] - B[u][i]);
        }
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            d[i][j] = (i == j ? 0 : 1e9 + 7);
    while (m--) {
        int u, v, w;
        cin >> u >> v >> w;
        d[u][v] = min(d[u][v], w);
    }
    for (int w = 1; w <= n; ++w)
        for (int u = 1; u <= n; ++u)
            for (int v = 1; v <= n; ++v)
                d[u][v] = min(d[u][v], d[u][w] + d[w][v]);
    int L = 0, R = 1e9 + 7;
    while (L < R) {
        int mid = L + R + 1 >> 1;
        if (check(mid)) L = mid;
        else R = mid - 1;
    }
    cout << L;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:62:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |         int mid = L + R + 1 >> 1;
      |                   ~~~~~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3396 KB Output is correct
2 Correct 45 ms 1268 KB Output is correct
3 Correct 23 ms 1236 KB Output is correct
4 Correct 5 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 6 ms 716 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 8 ms 884 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 8 ms 884 KB Output is correct
9 Correct 7 ms 760 KB Output is correct
10 Correct 4 ms 856 KB Output is correct
11 Correct 6 ms 884 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 6 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 8 ms 848 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 6 ms 852 KB Output is correct
18 Correct 6 ms 880 KB Output is correct
19 Correct 6 ms 924 KB Output is correct
20 Correct 8 ms 852 KB Output is correct
21 Correct 5 ms 852 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 7 ms 936 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 6 ms 852 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 7 ms 928 KB Output is correct
28 Correct 7 ms 852 KB Output is correct
29 Correct 7 ms 852 KB Output is correct
30 Correct 6 ms 824 KB Output is correct
31 Correct 4 ms 844 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 7 ms 928 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 6 ms 824 KB Output is correct
7 Correct 4 ms 844 KB Output is correct
8 Correct 41 ms 1528 KB Output is correct
9 Correct 112 ms 3776 KB Output is correct
10 Correct 40 ms 1364 KB Output is correct
11 Correct 43 ms 1616 KB Output is correct
12 Correct 44 ms 1616 KB Output is correct
13 Correct 37 ms 1428 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 760 KB Output is correct
2 Correct 4 ms 856 KB Output is correct
3 Correct 6 ms 884 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 8 ms 848 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 6 ms 880 KB Output is correct
11 Correct 6 ms 924 KB Output is correct
12 Correct 8 ms 852 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 7 ms 936 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 41 ms 1528 KB Output is correct
18 Correct 112 ms 3776 KB Output is correct
19 Correct 40 ms 1364 KB Output is correct
20 Correct 43 ms 1616 KB Output is correct
21 Correct 44 ms 1616 KB Output is correct
22 Correct 37 ms 1428 KB Output is correct
23 Correct 6 ms 852 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 7 ms 928 KB Output is correct
26 Correct 7 ms 852 KB Output is correct
27 Correct 7 ms 852 KB Output is correct
28 Correct 6 ms 824 KB Output is correct
29 Correct 4 ms 844 KB Output is correct
30 Correct 58 ms 3396 KB Output is correct
31 Correct 45 ms 1268 KB Output is correct
32 Correct 23 ms 1236 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 4 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 4 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 6 ms 716 KB Output is correct
40 Correct 5 ms 724 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 8 ms 884 KB Output is correct
43 Correct 43 ms 1344 KB Output is correct
44 Correct 51 ms 1464 KB Output is correct
45 Correct 47 ms 2384 KB Output is correct
46 Correct 43 ms 1364 KB Output is correct
47 Correct 37 ms 1364 KB Output is correct
48 Correct 43 ms 1468 KB Output is correct
49 Correct 111 ms 3960 KB Output is correct
50 Correct 1 ms 324 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 44 ms 1236 KB Output is correct
53 Correct 51 ms 1364 KB Output is correct
54 Correct 34 ms 1364 KB Output is correct
55 Correct 34 ms 1360 KB Output is correct
56 Correct 33 ms 1236 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 10 ms 988 KB Output is correct
59 Correct 8 ms 988 KB Output is correct
60 Correct 7 ms 864 KB Output is correct
61 Correct 107 ms 4132 KB Output is correct
62 Correct 94 ms 4244 KB Output is correct
63 Correct 1 ms 332 KB Output is correct