oj.uz

Submission #956388

# Submission time Handle Problem Language Result Execution time Memory
956388 2024-04-01T18:10:30 Z VMaksimoski008 Travelling Merchant (APIO17_merchant) C++14
0 / 100
 80 ms 1480 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int P[505][505], n, m, K, i, j, k, a, b, c;

int main() {
    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(i=1; i<=n; i++)
        for(j=0; j<K; j++) cin >> B[i][j] >> S[i][j];

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

    auto F = [&](vector<vector<ll> > &D) {
        for(k=1; k<=n; k++)
            for(i=1; i<=n; i++)
                for(j=1; j<=n; j++) D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
    };

    F(M);

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

        F(M2);

        bool ok = 0;
        for(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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 1304 KB Output is correct
2 Correct 21 ms 604 KB Output is correct
3 Correct 21 ms 604 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 5 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 5 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 860 KB Output is correct
2 Correct 80 ms 1480 KB Output is correct
3 Correct 25 ms 604 KB Output is correct
4 Correct 28 ms 856 KB Output is correct
5 Incorrect 29 ms 856 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 860 KB Output is correct
2 Correct 80 ms 1480 KB Output is correct
3 Correct 25 ms 604 KB Output is correct
4 Correct 28 ms 856 KB Output is correct
5 Incorrect 29 ms 856 KB Output isn't correct
6 Halted 0 ms 0 KB -