oj.uz

Submission #966238

# Submission time Handle Problem Language Result Execution time Memory
966238 2024-04-19T14:54:43 Z vjudge1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 558 ms 2140 KB 
#include <bits/stdc++.h>
using namespace std;

int32_t main() { 
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int32_t n; cin >> n;
	enum { BUY, SELL };
	vector<tuple<int32_t, bool, int32_t, int32_t>> a;

	for (int32_t i = 0; i < n; i++) {
		int32_t c, f, v; cin >> c >> f >> v;
		a.emplace_back(-f, BUY, c, v);
	}

	int32_t m; cin >> m;
	for (int32_t i = 0; i < m; i++) {
		int32_t c, f, v; cin >> c >> f >> v;
		a.emplace_back(-f, SELL, c, v);
	}

	sort(a.begin(), a.end());
	constexpr int32_t MAX_CORES = 100'000;
	constexpr int64_t INF = 1e15;
	

	vector<int64_t> dp(MAX_CORES + 1, -INF);
	dp[0] = 0;

	for (auto [f, type, c, v] : a) {
		auto nxt = dp;
		for (int32_t cores = 0; cores <= MAX_CORES; cores++) {
			if (type == BUY && cores >= c) {
				nxt[cores] = max(dp[cores], dp[cores - c] - v);
			} else if (type == SELL && cores + c <= MAX_CORES) {
				nxt[cores] = max(dp[cores], dp[cores + c] + v);
			}
		}
		swap(nxt, dp);
	}

	cout << *max_element(dp.begin(), dp.end()) << '\n';

	return 0;

}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 15 ms 1884 KB Output is correct
4 Correct 29 ms 1884 KB Output is correct
5 Correct 244 ms 2068 KB Output is correct
6 Correct 236 ms 2064 KB Output is correct
7 Correct 248 ms 2060 KB Output is correct
8 Correct 253 ms 1884 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 16 ms 2036 KB Output is correct
4 Correct 19 ms 2084 KB Output is correct
5 Correct 128 ms 2032 KB Output is correct
6 Correct 157 ms 2032 KB Output is correct
7 Correct 300 ms 2096 KB Output is correct
8 Correct 261 ms 1884 KB Output is correct
9 Correct 258 ms 1884 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1884 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 26 ms 1884 KB Output is correct
4 Correct 26 ms 1880 KB Output is correct
5 Correct 52 ms 1884 KB Output is correct
6 Correct 49 ms 2024 KB Output is correct
7 Correct 72 ms 2012 KB Output is correct
8 Correct 71 ms 2012 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1880 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 195 ms 1884 KB Output is correct
4 Correct 232 ms 2064 KB Output is correct
5 Correct 486 ms 2140 KB Output is correct
6 Correct 554 ms 2136 KB Output is correct
7 Correct 505 ms 2136 KB Output is correct
8 Correct 527 ms 2140 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1880 KB Output is correct
2 Correct 22 ms 2036 KB Output is correct
3 Correct 117 ms 2032 KB Output is correct
4 Correct 257 ms 2084 KB Output is correct
5 Correct 536 ms 2140 KB Output is correct
6 Correct 511 ms 2136 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 15 ms 1884 KB Output is correct
4 Correct 29 ms 1884 KB Output is correct
5 Correct 244 ms 2068 KB Output is correct
6 Correct 236 ms 2064 KB Output is correct
7 Correct 248 ms 2060 KB Output is correct
8 Correct 253 ms 1884 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct
11 Correct 16 ms 2036 KB Output is correct
12 Correct 19 ms 2084 KB Output is correct
13 Correct 128 ms 2032 KB Output is correct
14 Correct 157 ms 2032 KB Output is correct
15 Correct 300 ms 2096 KB Output is correct
16 Correct 261 ms 1884 KB Output is correct
17 Correct 258 ms 1884 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct
19 Correct 6 ms 1880 KB Output is correct
20 Correct 26 ms 1884 KB Output is correct
21 Correct 26 ms 1880 KB Output is correct
22 Correct 52 ms 1884 KB Output is correct
23 Correct 49 ms 2024 KB Output is correct
24 Correct 72 ms 2012 KB Output is correct
25 Correct 71 ms 2012 KB Output is correct
26 Correct 4 ms 1880 KB Output is correct
27 Correct 3 ms 1884 KB Output is correct
28 Correct 195 ms 1884 KB Output is correct
29 Correct 232 ms 2064 KB Output is correct
30 Correct 486 ms 2140 KB Output is correct
31 Correct 554 ms 2136 KB Output is correct
32 Correct 505 ms 2136 KB Output is correct
33 Correct 527 ms 2140 KB Output is correct
34 Correct 3 ms 1880 KB Output is correct
35 Correct 22 ms 2036 KB Output is correct
36 Correct 117 ms 2032 KB Output is correct
37 Correct 257 ms 2084 KB Output is correct
38 Correct 536 ms 2140 KB Output is correct
39 Correct 511 ms 2136 KB Output is correct
40 Correct 144 ms 2032 KB Output is correct
41 Correct 280 ms 2080 KB Output is correct
42 Correct 417 ms 2136 KB Output is correct
43 Correct 522 ms 2140 KB Output is correct
44 Correct 509 ms 2140 KB Output is correct
45 Correct 558 ms 2136 KB Output is correct
46 Correct 285 ms 2064 KB Output is correct
47 Correct 414 ms 2140 KB Output is correct
48 Correct 423 ms 2136 KB Output is correct