Submission #50112

#	Time	Username	Problem	Language	Result	Execution time	Memory
50112		mohammad_kilani	Travelling Merchant (APIO17_merchant)	C++17	12 / 100	78 ms	1660 KiB

merchant

#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 1000000005
const int N = 150 , K = 1100;
int dist[N][N] , best[N][N];
long long cur[N][N]; 
int b[N][K] , s[N][K];
int n , m , k , u , v , w;

bool check(int mid){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i == j) continue;
            if(dist[i][j] == oo)
                cur[i][j] = (long long)1e18 + 34342;
            else
                cur[i][j] = (long long)dist[i][j] * mid - best[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                cur[j][k] = min(cur[j][k] , cur[j][i] + cur[i][k]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i != j && dist[i][j] != oo && dist[j][i] != oo)
                if(cur[i][j] + (long long)mid * dist[j][i] <= 0)
                    return true;
        }
    }
    return false;
}

int main() {
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i != j)
                dist[i][j] = oo;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            scanf("%d%d",&b[i][j],&s[i][j]);
        }
    }
    for(int i=0;i<m;i++){
        scanf("%d%d%d",&u,&v,&w);
        dist[u][v] = min(dist[u][v],w);
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i == j) continue;
            best[i][j] = -oo;
            if(dist[i][j] == oo) continue;
            for(int l=1;l<=k;l++){
                if(b[i][l] != -1 && s[j][l] != -1)
                    best[i][j] = max(best[i][j], s[j][l] - b[i][l]);
            }
        }
    }
    int low = 0 , high = oo , ans = 0 , mid = 0;
    while(high >= low){
        mid = (low + high) / 2;
        if(check(mid)){
            ans = mid;
            low = mid + 1;
        }
        else
            high = mid - 1;
    }
    cout << ans << endl;
    return 0;
}

Compilation message (stderr)

merchant.cpp: In function 'int main()':
merchant.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:48:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d%d",&b[i][j],&s[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&u,&v,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~

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