Submission #110078

#	Time	Username	Problem	Language	Result	Execution time	Memory
110078		maruii	Travelling Merchant (APIO17_merchant)	C++14	12 / 100	28 ms	2424 KiB

merchant

#include <bits/stdc++.h>
using namespace std;

int B[101][1000], S[101][1000], E[101][101];
int main(){
	ios_base::sync_with_stdio(0), cin.tie(0);
	int N,M,K; cin>>N>>M>>K;
	for(int i=1; i<=N; ++i) for(int j=0; j<K; ++j) cin>>B[i][j]>>S[i][j];
	for(int i=0; i<M; ++i){
		int a,b,c; cin>>a>>b>>c;
		E[a][b] = c;
	}
	for(int x=1; x<=N; ++x) for(int i=1; i<=N; ++i) for(int j=1; j<=N; ++j)
		if(E[i][x] && E[x][j] && (!E[i][j] || E[i][j] > E[i][x]+E[x][j])) E[i][j] = E[i][x]+E[x][j];
	int ans = 0;
	for(int i=1; i<=N; ++i){
		for(int j=1; j<=N; ++j){
			if(i==j || !E[i][j] || !E[j][i]) continue;
			int t = 0;
			for(int k=0; k<K; ++k) if(S[j][k]>0 && B[i][k]>0) t = max(t, S[j][k]-B[i][k]);
			ans = max(ans, t/(E[i][j]+E[j][i]));
		}
	}
	cout<<ans;
	return 0;
}

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