제출 #642631

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
642631		PoonYaPat	Travelling Merchant (APIO17_merchant)	C++14	0 / 100	92 ms	3780 KiB

merchant

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

int n,m,h;
ll profit[101][101],dis[101][101],buy[101][1001],sell[101][1001],dist[101][101];

bool solve(int s) {
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            if (dis[i][j]!=1e15) {
                dist[i][j]=dis[i][j]*s-profit[i][j];
            }
        }
    }
    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) {
        if (dist[i][i]<=0) return true;
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m>>h;
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=h; ++j) cin>>buy[i][j]>>sell[i][j];
    }

    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            dis[i][j]=1e15;
            for (int k=1; k<=h; ++k) if (sell[j][k]!=-1 && buy[i][k]!=-1)
                profit[i][j]=max(profit[i][j],sell[j][k]-buy[i][k]);
        }
    }

    for (int i=0; i<m; ++i) {
        int a,b,w; cin>>a>>b>>w;
        dis[a][b]=w;
    }

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

    int l=0, r=1e9, ans=0;
    while (l<=r) {
        int mid=(l+r)/2;
        if (solve(mid)) l=mid+1,ans=mid;
        else r=mid-1;
    }
    cout<<ans;
}

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