Submission #111447

#	Time	Username	Problem	Language	Result	Execution time	Memory
111447		Segtree	Travelling Merchant (APIO17_merchant)	C++14	0 / 100	64 ms	5112 KiB

merchant

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define N 110
#define K 1010
ll n,m,k,d[N][N];
ll s[N][K],b[N][K];
void wf(){
    for(int r=1;r<=n;r++){
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
	    d[i][j]=min(d[i][j],d[i][r]+d[r][j]);
	}
    }
}
int main(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)d[i][j]=1e17;
    for(int i=1;i<=n;i++){
	for(int j=0;j<k;j++)cin>>s[i][j]>>b[i][j];
	d[i][i]=0;
    } 
    for(int i=0;i<m;i++){
	ll x,y,z;cin>>x>>y>>z;
	d[x][y]=z;
    }
    wf();
    ll ans=0;
    for(int i=1;i<=n;i++){
	ll len=d[1][i]+d[i][1];
	ll ma=0;
	for(int j=0;j<k;j++){
	    if(b[1][j]==-1)continue;
	    ma=max(ma,s[i][j]-b[1][j]);
	}
	ans=max(ans,ma/len);
    }
    cout<<ans<<endl;
    return 0;
}

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