oj.uz

Submission #941215

# Submission time Handle Problem Language Result Execution time Memory
941215 2024-03-08T09:42:21 Z vjudge1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 399 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
	return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
	return a < b ? (a = b) == b : false;
}
const int inf = 1e18;

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n; cin >> n;
    vector<array<int, 4>> vec;
	for (int i = 0; i < n; ++i) {
		int c, f, v; cin >> c >> f >> v;
        vec.push_back({f, 1, v, c});
	}
	int m; cin >> m;
	for (int i = 0; i < m; ++i) {
		int c, f, v; cin >> c >> f >> v;
        vec.push_back({f, 0, v, c});
	}
	sort(all(vec));
    vector<int> dp(50 * n + 1, -inf);
    dp[0] = 0;
    while (!vec.empty()) {
        auto [C, V] = make_pair(vec.back()[3], vec.back()[2]);
        if (vec.back()[1]) {
            for (int i = 50 * n - C; i >= 0; --i) {
                chmax(dp[i + C], dp[i] - V);
            }
        } else {
            for (int i = C; i <= 50 * n; ++i) {
                chmax(dp[i - C], dp[i] + V);
            }
        }
        vec.pop_back();
    }
    cout << *max_element(all(dp));
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 564 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 39 ms 860 KB Output is correct
6 Correct 44 ms 856 KB Output is correct
7 Correct 196 ms 1372 KB Output is correct
8 Correct 185 ms 1372 KB Output is correct
9 Correct 184 ms 1368 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 580 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 7 ms 604 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 105 ms 1116 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 369 ms 1372 KB Output is correct
6 Correct 357 ms 1372 KB Output is correct
7 Correct 388 ms 1372 KB Output is correct
8 Correct 382 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 22 ms 604 KB Output is correct
4 Correct 73 ms 860 KB Output is correct
5 Correct 399 ms 1368 KB Output is correct
6 Correct 387 ms 1368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 3 ms 564 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 39 ms 860 KB Output is correct
14 Correct 44 ms 856 KB Output is correct
15 Correct 196 ms 1372 KB Output is correct
16 Correct 185 ms 1372 KB Output is correct
17 Correct 184 ms 1368 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 504 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 580 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 7 ms 604 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 105 ms 1116 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 369 ms 1372 KB Output is correct
31 Correct 357 ms 1372 KB Output is correct
32 Correct 388 ms 1372 KB Output is correct
33 Correct 382 ms 1372 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 22 ms 604 KB Output is correct
37 Correct 73 ms 860 KB Output is correct
38 Correct 399 ms 1368 KB Output is correct
39 Correct 387 ms 1368 KB Output is correct
40 Correct 25 ms 604 KB Output is correct
41 Correct 72 ms 860 KB Output is correct
42 Correct 187 ms 1112 KB Output is correct
43 Correct 349 ms 1372 KB Output is correct
44 Correct 350 ms 1372 KB Output is correct
45 Correct 341 ms 1368 KB Output is correct
46 Correct 94 ms 856 KB Output is correct
47 Correct 200 ms 1112 KB Output is correct
48 Correct 180 ms 1112 KB Output is correct