제출 #977493

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

merchant

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair <ll, ll>
#define ff first
#define ss second
#define sz size()
// bir subtaska gecenson long long etmeli yerleri long long et INF-ny uly sana denle
 
const int N = 1e2 + 5;
const int K = 1e3 + 5;
ll val[N][N], buy[N][K], sell[N][K], n, m, d, dis[N][N], profit[N][N];
vector <ll> nodes;
vector <pii> v[N];
ll INF = 1e13;
ll node, new_jog;
 
bool check (ll x) {
	// jog - x * time >= 0
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (dis[i][j] != INF) val[i][j] = profit[i][j] - x * dis[i][j];
			else val[i][j] = -INF;
		}
		val[i][i] = -INF;
	}
	for (int k = 1; k <= n; ++k) {
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= n; ++j) {
				val[i][j] = max (val[i][j], val[i][k] + val[k][j]);
			}
		}
	}
	for (ll i = 1; i <= n; ++i) {
		if (val[i][i] >= 0) return 1;
	}
//	for (ll i = 1; i <= n; ++i) {
//		for (ll j = 1; j <= n; ++j) {
////			if (i == j) continue;
////			if (dis[i][j] != 1e8 and dis[j][i] != 1e8)
////				if (val[i][j] + val[j][i] >= 0) {
////					return 1;
////				}
//			val[i][j] = max (val[i][j], val[i][k])
//		}
//	}
	return 0;
}
 
 
 
int main () {
//	freopen ("input.txt", "r", stdin);
	cin >> n >> m >> d;
	for (ll i = 1; i <= n; ++i) {
		for (ll j = 1; j <= d; ++j) {
			cin >> buy[i][j] >> sell[i][j];
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			dis[i][j] = INF;
		}
		dis[i][i] = 0;
	}
	for (int i = 1; i <= m; ++i) {
		ll l, r, w;
		cin >> l >> r >> w;
		v[l].pb ({r, w});
		dis[l][r] = w;
		assert (w <= INF);
	}
	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]);
			}
		}
	} 
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (i == j) continue;
			for (int k = 1; k <= d; ++k) {
				// k-th item-y i-njiden satyn alyan j-nynjyda satyan
				if (buy[i][k] != -1 and sell[j][k] != -1) profit[i][j] = max (profit[i][j], sell[j][k] - buy[i][k]);
			}
		}
	}
//	cout << check(2);
//	return 0;
	ll l = 0, r = 1e9, jog = 0;
	ll sana = 0;
	while (l <= r) {
		ll md = (l + r) / 2;
		if (check (md)) {
			jog = md;
			l = md + 1;
		}
		else {
			r = md - 1;
		}
	}
	cout << jog;
}

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

merchant.cpp: In function 'int main()':
merchant.cpp:93:5: warning: unused variable 'sana' [-Wunused-variable]
   93 |  ll sana = 0;
      |     ^~~~

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