oj.uz

Submission #956384

# Submission time Handle Problem Language Result Execution time Memory
956384 2024-04-01T18:03:05 Z VMaksimoski008 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 105 ms 3576 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int P[505][505];

int32_t main() {
    int n, m, K;
    cin >> n >> m >> K;

    vector<vector<ll> > M(n+1, vector<ll>(n+1, 1e16));
    int B[n+1][K], S[n+1][K];

    for(int i=1; i<=n; i++)
        for(int j=0; j<K; j++) cin >> B[i][j] >> S[i][j];

    for(int i=0; i<m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        M[a][b] = min(M[a][b], 1ll * c);
    }

    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++) M[i][j] = min(M[i][j], M[i][k] + M[k][j]);

    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            for(int k=0; k<K; k++)
                if(S[j][k] != -1 && B[i][k] != -1) P[i][j] = max(P[i][j], S[j][k] - B[i][k]);

    ll l=1, r=1e9, ans=0;
    while(l <= r) {
        ll mid = (l + r) / 2;
        vector<vector<ll> > M2(n+1, vector<ll>(n+1, 1e16));
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++) if(M[i][j] < 1e16) M2[i][j] = mid * M[i][j] - P[i][j];

        for(int k=1; k<=n; k++)
            for(int i=1; i<=n; i++)
                for(int j=1; j<=n; j++) M2[i][j] = min(M2[i][j], M2[i][k] + M2[k][j]);

        bool ok = 0;
        for(int i=1; i<=n; i++)
            if(M2[i][i] <= 0) ok = 1;

        if(ok) ans = mid, l = mid + 1;
        else r = mid - 1;
    }

    cout << ans << '\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1364 KB Output is correct
2 Correct 26 ms 604 KB Output is correct
3 Correct 27 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 4 ms 484 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 5 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 6 ms 604 KB Output is correct
4 Correct 5 ms 536 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Correct 5 ms 604 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 33 ms 860 KB Output is correct
9 Correct 95 ms 1616 KB Output is correct
10 Correct 30 ms 860 KB Output is correct
11 Correct 35 ms 856 KB Output is correct
12 Correct 35 ms 964 KB Output is correct
13 Correct 31 ms 860 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 600 KB Output is correct
5 Correct 7 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 548 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 4 ms 616 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 33 ms 860 KB Output is correct
18 Correct 95 ms 1616 KB Output is correct
19 Correct 30 ms 860 KB Output is correct
20 Correct 35 ms 856 KB Output is correct
21 Correct 35 ms 964 KB Output is correct
22 Correct 31 ms 860 KB Output is correct
23 Correct 5 ms 604 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 6 ms 604 KB Output is correct
26 Correct 5 ms 536 KB Output is correct
27 Correct 5 ms 604 KB Output is correct
28 Correct 5 ms 604 KB Output is correct
29 Correct 4 ms 348 KB Output is correct
30 Correct 81 ms 1364 KB Output is correct
31 Correct 26 ms 604 KB Output is correct
32 Correct 27 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 4 ms 484 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 5 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 348 KB Output is correct
39 Correct 4 ms 348 KB Output is correct
40 Correct 4 ms 348 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 5 ms 344 KB Output is correct
43 Correct 28 ms 740 KB Output is correct
44 Correct 31 ms 860 KB Output is correct
45 Correct 55 ms 1896 KB Output is correct
46 Correct 39 ms 860 KB Output is correct
47 Correct 31 ms 860 KB Output is correct
48 Correct 31 ms 860 KB Output is correct
49 Correct 104 ms 3412 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 28 ms 692 KB Output is correct
53 Correct 32 ms 604 KB Output is correct
54 Correct 28 ms 604 KB Output is correct
55 Correct 28 ms 600 KB Output is correct
56 Correct 28 ms 600 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 7 ms 604 KB Output is correct
59 Correct 7 ms 708 KB Output is correct
60 Correct 9 ms 860 KB Output is correct
61 Correct 105 ms 3460 KB Output is correct
62 Correct 104 ms 3576 KB Output is correct
63 Correct 0 ms 348 KB Output is correct