oj.uz

Submission #977492

# Submission time Handle Problem Language Result Execution time Memory
977492 2024-05-08T04:57:43 Z Halym2007 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 126 ms 4320 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 (int 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 (int i = 1; i <= n; ++i) {
		for (int 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] = min (dis[l][r], w);
	
	}
	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 = 1e9, jog = 0;
	while (l <= r) {
		ll md = (l + r) / 2;
		if (check (md)) {
			jog = md;
			l = md + 1;
		}
		else {
			r = md - 1;
		}
	}
	cout << jog;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 2128 KB Output is correct
2 Correct 38 ms 1368 KB Output is correct
3 Correct 38 ms 1372 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 6 ms 940 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 5 ms 952 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 6 ms 980 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 940 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 5 ms 952 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 980 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 988 KB Output is correct
16 Correct 6 ms 860 KB Output is correct
17 Correct 5 ms 860 KB Output is correct
18 Correct 6 ms 860 KB Output is correct
19 Correct 6 ms 1028 KB Output is correct
20 Correct 7 ms 860 KB Output is correct
21 Correct 6 ms 856 KB Output is correct
22 Correct 6 ms 860 KB Output is correct
23 Correct 8 ms 860 KB Output is correct
24 Correct 6 ms 1116 KB Output is correct
25 Correct 7 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 860 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 6 ms 860 KB Output is correct
31 Correct 5 ms 988 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 7 ms 860 KB Output is correct
6 Correct 6 ms 860 KB Output is correct
7 Correct 5 ms 988 KB Output is correct
8 Correct 43 ms 1628 KB Output is correct
9 Correct 96 ms 2068 KB Output is correct
10 Correct 41 ms 1372 KB Output is correct
11 Correct 45 ms 1624 KB Output is correct
12 Correct 44 ms 1880 KB Output is correct
13 Correct 41 ms 1624 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 860 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 6 ms 860 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 6 ms 856 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 988 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 6 ms 1028 KB Output is correct
12 Correct 7 ms 860 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 6 ms 860 KB Output is correct
15 Correct 8 ms 860 KB Output is correct
16 Correct 6 ms 1116 KB Output is correct
17 Correct 43 ms 1628 KB Output is correct
18 Correct 96 ms 2068 KB Output is correct
19 Correct 41 ms 1372 KB Output is correct
20 Correct 45 ms 1624 KB Output is correct
21 Correct 44 ms 1880 KB Output is correct
22 Correct 41 ms 1624 KB Output is correct
23 Correct 7 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 7 ms 860 KB Output is correct
26 Correct 7 ms 860 KB Output is correct
27 Correct 7 ms 860 KB Output is correct
28 Correct 6 ms 860 KB Output is correct
29 Correct 5 ms 988 KB Output is correct
30 Correct 87 ms 2128 KB Output is correct
31 Correct 38 ms 1368 KB Output is correct
32 Correct 38 ms 1372 KB Output is correct
33 Correct 5 ms 860 KB Output is correct
34 Correct 5 ms 860 KB Output is correct
35 Correct 6 ms 940 KB Output is correct
36 Correct 6 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 5 ms 860 KB Output is correct
39 Correct 5 ms 860 KB Output is correct
40 Correct 5 ms 952 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 6 ms 980 KB Output is correct
43 Correct 40 ms 1372 KB Output is correct
44 Correct 42 ms 1628 KB Output is correct
45 Correct 68 ms 2684 KB Output is correct
46 Correct 42 ms 1636 KB Output is correct
47 Correct 42 ms 1628 KB Output is correct
48 Correct 43 ms 1628 KB Output is correct
49 Correct 102 ms 4192 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 44 ms 1628 KB Output is correct
53 Correct 43 ms 1620 KB Output is correct
54 Correct 40 ms 1372 KB Output is correct
55 Correct 39 ms 1368 KB Output is correct
56 Correct 39 ms 1368 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 8 ms 1124 KB Output is correct
59 Correct 9 ms 1116 KB Output is correct
60 Correct 8 ms 1172 KB Output is correct
61 Correct 108 ms 4320 KB Output is correct
62 Correct 126 ms 4068 KB Output is correct
63 Correct 0 ms 348 KB Output is correct