Submission #1311884

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311884		HasanV11010238	Travelling Merchant (APIO17_merchant)	C++20	12 / 100	71 ms	1996 KiB

merchant

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
#define INF2 1000000000005
int main(){
    ll n, m, k, x, y, co;
    cin>>n>>m>>k;
    vector<vector<ll>> b(n + 1, vector<ll>(k + 1, -1)), s(n + 1, vector<ll>(k + 1, -1));
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= k; j++){
            cin>>b[i][j]>>s[i][j];
        }
    }
    vector<vector<ll>> di(n + 1, vector<ll>(n + 1, INF)), pr(n + 1, vector<ll>(n + 1, 0));
    for (int i = 1; i <= m; i++){
        cin>>x>>y>>co;
        di[x][y] = min(di[x][y], co);
    }
    for (int i = 1; i <= n; i++) di[i][i] = 0;
    for (int l = 1; l <= n; l++){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= n; j++){
                di[i][j] = min(di[i][j], di[i][l] + di[l][j]);
            }
        }
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            for (int l = 1; l <= k; l++){
                if (b[i][l] != -1 && s[j][l] != -1) pr[i][j] = max(pr[i][j], s[j][l] - b[i][l]);
            }
        }
    }
    ll l = 1, r = 1000000000, best = 0;
    while (l <= r){
        ll mid = (l + r) / 2;
        vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, INF2));
        for (int i = 1; i <= n; i++){
            dp[i][i] = 0;
            for (int j = 1; j <= n; j++){
                dp[i][j] = min(mid * di[i][j] - pr[i][j], dp[i][j]);
            }
        }
        for (int z = 1; z <= n; z++){
            for (int i = 1; i <= n; i++){
                for (int j = 1; j <= n; j++){
                    dp[i][j] = min(dp[i][j], dp[i][z] + dp[z][j]);
                }
            }
        }
        bool can = 0;
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= n; j++){
                if (i == j) continue;
                if (dp[i][j] + min(mid * di[j][i], 1LL * INF2) <= 0) can = 1;
            }
        }
        if (can == 1){
            best = mid;
            l = mid + 1;
        }
        else{
            r = mid - 1;
        }
    }
    cout<<best;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 34