제출 #549691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549691		krit3379	여행하는 상인 (APIO17_merchant)	C++17	100 / 100	94 ms	4232 KiB

merchant

#include<bits/stdc++.h>
using namespace std;
#define N 105
#define inf 1000000000000000000

long long dis[N][N],diss[N][N],b[N][1005],s[N][1005],p[N][N];

int main(){
    int n,m,item,i,j,k,u,v,l,r,mid;
    long long w;
    scanf("%d %d %d",&n,&m,&item);
    for(i=1;i<=n;i++){
        for(j=1;j<=n;j++)dis[i][j]=inf;
        for(j=1;j<=item;j++)scanf("%lld %lld",&b[i][j],&s[i][j]);
    }
    for(i=1;i<=m;i++){
        scanf("%d %d %lld",&u,&v,&w);
        dis[u][v]=w;
    }
    for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){
        dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
    }
    for(i=1;i<=n;i++)for(j=1;j<=n;j++)for(k=1;k<=item;k++){
        if(b[i][k]!=-1&&s[j][k]!=-1)p[i][j]=max(p[i][j],s[j][k]-b[i][k]);
    }
    l=1,r=1e9;
    while(l<=r){
        mid=(l+r)/2;
        for(i=1;i<=n;i++)for(j=1;j<=n;j++)diss[i][j]=mid*min(dis[i][j],inf/(long long)mid)-p[i][j];
        for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++){
            diss[i][j]=min(diss[i][j],diss[i][k]+diss[k][j]);
        }
        for(i=1;i<=n;i++)if(diss[i][i]<=0)break;
        if(i<=n)l=mid+1;
        else r=mid-1;
    }
    printf("%d",r);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

merchant.cpp: In function 'int main()':
merchant.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d %d",&n,&m,&item);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:14:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         for(j=1;j<=item;j++)scanf("%lld %lld",&b[i][j],&s[i][j]);
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%d %d %lld",&u,&v,&w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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