제출 #409536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
409536		CursedCode	여행하는 상인 (APIO17_merchant)	C++14	21 / 100	200 ms	2028 KiB

merchant

#include <bits/stdc++.h>
using namespace std;
 
int n,m,k;
long long buy[105][1005],sell[105][1005];
long long adj[105][105],aral[105][105];
long long setup[105][105];
const long long inf=10e15;
int main(){
	cin >> n >> m >> k;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= k;j++) cin >> buy[i][j] >> sell[i][j];
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= n;j++) adj[i][j] = inf;
	}
	for(int i = 1;i <= m;i++){
		long long u,v,w;
		cin >> u >> v >> w;
		adj[u][v] = w;
	}
	for(int l = 1;l <= n;l++){
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				adj[i][j] = min(adj[i][j] , adj[i][l] + adj[l][j]);
			}
		}
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= n;j++){
			if(adj[i][j] >= inf){
				setup[i][j] =- inf;
				continue;
			}
			for(int cnt = 1;cnt <= k;cnt++){
				if(sell[j][cnt] == -1 || buy[i][cnt] == -1) continue;
				setup[i][j] = max(setup[i][j] , sell[j][cnt] - buy[i][cnt]);
			}
		}
	}
	long long lower = 0,higher = inf;
	while(lower<higher){
		long long mid = (lower + higher + 1) / 2;
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				if(adj[i][j] >= inf) aral[i][j] = -inf;
				else aral[i][j] = setup[i][j] - mid * adj[i][j];
			}
		}
		for(int l=1;l<=n;l++){
			for(int i = 1;i <= n;i++){
				for(int j = 1;j <= n;j++){
					if(adj[i][l] >= inf || adj[j][l] >= inf) continue;
					aral[i][j] = max(aral[i][j] , aral[i][l] + aral[l][j]);
				}
			}
		}
		bool check = false;
		for(int i = 1;i <= n;i++){
			if(aral[i][i] >= 0){
				check = true;
				break;
			}
		}
		if(check) lower=mid;
		else higher=mid-1;
	}
	cout << lower << endl;
 	return 0;
}

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