제출 #744426

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
744426		Mauve	여행하는 상인 (APIO17_merchant)	C++14	12 / 100	76 ms	2040 KiB

merchant

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
const ll INF=LLONG_MAX/10;
#define pb push_back
ll n,m,l,r,i,j,ii,jj,k,x,y,T,s,e,adj[101][101],ashig[101][101],adj1[101][101],buy[101][1001],sell[101][1001];
bool floyd_warshall(ll graph[101][101]){
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    for(int k=1;k<=n;k++)
    graph[j][k]=min(graph[j][k],graph[j][i]+graph[i][k]);
    for(int i=1;i<=n;i++) if(graph[i][i]<=0) return true;
    return false;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>n>>m>>k;
    for(i=1;i<=n;i++)
    for(j=1;j<=k;j++)
    cin>>buy[i][j]>>sell[i][j];
    for(i=1;i<=n;i++) for(j=1;j<=n;j++) adj[i][j]=INF;
    for(i=1;i<=m;i++){
        cin>>l>>r>>e;
        adj[l][r]=e;
    }
    floyd_warshall(adj);
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    for(ii=1;ii<=k;ii++)
    if(buy[i][ii]!=-1 && sell[j][ii]!=-1) ashig[i][j]=max(ashig[i][j],sell[j][ii]-buy[i][ii]);
    l=0;
    r=2e9;
    while(r-l>1){
        m=(r+l)/2;
        for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        adj1[i][j]=min(adj[i][j],(INF)/m)*m-ashig[i][j];
        if(floyd_warshall(adj1)) l=m;
        else r=m-1;
    }
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++) adj1[i][j]=adj[i][j]*r-ashig[i][j];
    if(floyd_warshall(adj1)) cout<<r;
    else cout<<l;
}

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