oj.uz

Submission #977486

# Submission time Handle Problem Language Result Execution time Memory
977486 2024-05-08T04:35:38 Z Halym2007 Travelling Merchant (APIO17_merchant) C++17
21 / 100
 118 ms 2128 KB 
#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];
				val[i][j] = max (-INF, val[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]);
				val[i][j] = min (val[i][j], INF);
			}
		}
	}
	for (ll i = 1; i <= n; ++i) {
		if (val[i][i] >= 0) return 1;
	}
	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;
		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) {
			assert (profit[i][j] == 0);
			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]);
			}
		}
	}
	ll l = 0, r = INF, 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;
}

Compilation message

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

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 103 ms 2128 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 8 ms 856 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 9 ms 1020 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 10 ms 860 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 9 ms 860 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 8 ms 992 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 7 ms 960 KB Output is correct
17 Correct 8 ms 860 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 8 ms 1024 KB Output is correct
20 Correct 9 ms 856 KB Output is correct
21 Correct 9 ms 860 KB Output is correct
22 Correct 8 ms 860 KB Output is correct
23 Correct 7 ms 1112 KB Output is correct
24 Correct 7 ms 860 KB Output is correct
25 Correct 8 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 7 ms 860 KB Output is correct
28 Correct 7 ms 952 KB Output is correct
29 Correct 8 ms 860 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 8 ms 856 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 860 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 8 ms 1024 KB Output is correct
4 Correct 9 ms 856 KB Output is correct
5 Correct 9 ms 860 KB Output is correct
6 Correct 8 ms 860 KB Output is correct
7 Correct 7 ms 1112 KB Output is correct
8 Correct 60 ms 1628 KB Output is correct
9 Correct 118 ms 2128 KB Output is correct
10 Correct 56 ms 1540 KB Output is correct
11 Incorrect 69 ms 1628 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 8 ms 856 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 9 ms 1020 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 10 ms 860 KB Output is correct
9 Correct 7 ms 860 KB Output is correct
10 Correct 8 ms 860 KB Output is correct
11 Correct 9 ms 860 KB Output is correct
12 Correct 9 ms 1024 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 8 ms 992 KB Output is correct
15 Correct 10 ms 860 KB Output is correct
16 Correct 7 ms 960 KB Output is correct
17 Correct 60 ms 1628 KB Output is correct
18 Correct 118 ms 2128 KB Output is correct
19 Correct 56 ms 1540 KB Output is correct
20 Incorrect 69 ms 1628 KB Output isn't correct
21 Halted 0 ms 0 KB -