oj.uz

Submission #977531

# Submission time Handle Problem Language Result Execution time Memory
977531 2024-05-08T06:22:03 Z Halym2007 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 103 ms 1624 KB 
/*
Kotda etyan zatlarym shu comment-da dusindiryar : https://codeforces.com/blog/entry/51981?#comment-360508
Solution of my code is explained in this comment : https://codeforces.com/blog/entry/51981?#comment-360508
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define sz size()
const int N = 1e2 + 5;
const int K = 1e3 + 5;

int buy[N][K], sell[N][K], n, m, d;
ll val[N][N], dis[N][N], profit[N][N];

ll INF = 1e13;
 
bool check (int 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 (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;
			if (i == j) dis[i][j] = 0;
		}
	}
	for (int i = 1; i <= m; ++i) {
		int l, r, w;
		cin >> l >> r >> w;
		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) {
			if (i == j) continue;
			for (int k = 1; k <= d; ++k) {
				// k-th item-y i-njiden satyn alyan j-nynjyda satyan
				if (sell[j][k] != -1 and buy[i][k] != -1) profit[i][j] = max (profit[i][j], sell[j][k] - 0LL - buy[i][k]);
			}
		}
	}
	ll l = 1, r = INF, jog = 0;
	while (l <= r) {
		int 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 72 ms 1264 KB Output is correct
2 Correct 28 ms 1400 KB Output is correct
3 Correct 28 ms 1372 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 924 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 5 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 924 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 860 KB Output is correct
9 Correct 7 ms 968 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 6 ms 856 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 7 ms 1104 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 4 ms 956 KB Output is correct
18 Correct 5 ms 824 KB Output is correct
19 Correct 7 ms 972 KB Output is correct
20 Correct 5 ms 860 KB Output is correct
21 Correct 5 ms 860 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 8 ms 972 KB Output is correct
24 Correct 5 ms 856 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 860 KB Output is correct
28 Correct 6 ms 860 KB Output is correct
29 Correct 5 ms 856 KB Output is correct
30 Correct 5 ms 860 KB Output is correct
31 Correct 4 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 6 ms 860 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 34 ms 1476 KB Output is correct
9 Correct 85 ms 1364 KB Output is correct
10 Correct 31 ms 1368 KB Output is correct
11 Correct 36 ms 1368 KB Output is correct
12 Correct 39 ms 1360 KB Output is correct
13 Correct 30 ms 1368 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 968 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 6 ms 856 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 7 ms 1104 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 5 ms 860 KB Output is correct
9 Correct 4 ms 956 KB Output is correct
10 Correct 5 ms 824 KB Output is correct
11 Correct 7 ms 972 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 5 ms 860 KB Output is correct
15 Correct 8 ms 972 KB Output is correct
16 Correct 5 ms 856 KB Output is correct
17 Correct 34 ms 1476 KB Output is correct
18 Correct 85 ms 1364 KB Output is correct
19 Correct 31 ms 1368 KB Output is correct
20 Correct 36 ms 1368 KB Output is correct
21 Correct 39 ms 1360 KB Output is correct
22 Correct 30 ms 1368 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 8 ms 860 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 5 ms 856 KB Output is correct
28 Correct 5 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 72 ms 1264 KB Output is correct
31 Correct 28 ms 1400 KB Output is correct
32 Correct 28 ms 1372 KB Output is correct
33 Correct 4 ms 856 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 5 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 4 ms 924 KB Output is correct
39 Correct 5 ms 860 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 5 ms 860 KB Output is correct
43 Correct 28 ms 1368 KB Output is correct
44 Correct 35 ms 1624 KB Output is correct
45 Correct 56 ms 1364 KB Output is correct
46 Correct 31 ms 1372 KB Output is correct
47 Correct 31 ms 1372 KB Output is correct
48 Correct 37 ms 1368 KB Output is correct
49 Correct 103 ms 1364 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 29 ms 1572 KB Output is correct
53 Correct 33 ms 1372 KB Output is correct
54 Correct 30 ms 1368 KB Output is correct
55 Correct 29 ms 1372 KB Output is correct
56 Correct 29 ms 1368 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 7 ms 960 KB Output is correct
59 Correct 7 ms 860 KB Output is correct
60 Correct 7 ms 860 KB Output is correct
61 Correct 96 ms 1464 KB Output is correct
62 Correct 94 ms 1468 KB Output is correct
63 Correct 1 ms 348 KB Output is correct