Submission #202998

#	Time	Username	Problem	Language	Result	Execution time	Memory
202998		AQT	Travelling Merchant (APIO17_merchant)	C++14	66 / 100	159 ms	4344 KiB

merchant

#include <bits/stdc++.h>

using namespace std;

int N, M, K;
long long mx[105][105];
long long dis[105][105];
long long buy[105][1005];
long long sell[105][1005];
long long tmp[105][105];

bool solve(long long k){
	for(int i =1 ; i<=N; i++){
		for(int j = 1; j<=M; j++){
			//cout << i << " " << j << " " << k << " " << dis[i][j] << endl;
			tmp[i][j] = mx[i][j] - k*dis[i][j];
			//cout << tmp[i][j] << endl;
		}
	}
	for(int k = 1; k<=N; k++){
		for(int i = 1; i<=N; i++){
			for(int j = 1; j<=N; j++){
				if(i == j){
					if(k != i && tmp[i][k] + tmp[k][j] >= 0){
						return 1;
					}	
				}
				tmp[i][j] = max(tmp[i][j], tmp[i][k] + tmp[k][j]);
			}
		}
	}
	return 0;
}

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> M >> K;
	for(int i =1 ; i<=N; i++){
		for(int k = 1; k<=K; k++){
			cin >> buy[i][k] >> sell[i][k];
		}
	}
	for(int i = 1; i<=N; i++){
		for(int j = 1; j<=N; j++){
			for(int k = 1; k<=K; k++){
				if(sell[j][k]+1 && buy[i][k]+1){
					mx[i][j] = max(mx[i][j], sell[j][k] - buy[i][k]);
				}
			}
		}
	}
	for(int i = 1; i<=N; i++){
		for(int j = 1; j<=N; j++){
			dis[i][j] = 2000000000;
			if(i == j){
				dis[i][j] = 0;
			}
		}
	}
	for(int i = 1; i<=M; i++){
		long long a, b, c;
		cin >> a >> b >> c;
		dis[a][b] = min(dis[a][b], c);
	}
	for(int k = 1; k<=N; k++){
		for(int i = 1; i<=N; i++){
			for(int j = 1; j<=N; j++){
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
			}
		}
	}
	int l = 1,r = 1000000000, ans = 0;
	while(l <= r){
		int mid = l + r>> 1;
		if(solve(mid)){
			l = mid + 1;
			ans = mid;
		}
		else{
			r =mid - 1;
		}
	}
	cout << ans << endl;
}

Compilation message (stderr)

merchant.cpp: In function 'int main()':
merchant.cpp:76:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r>> 1;
             ~~^~~

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