oj.uz

Submission #963624

# Submission time Handle Problem Language Result Execution time Memory
963624 2024-04-15T11:54:07 Z oblantis Cloud Computing (CEOI18_clo) C++17
100 / 100
 369 ms 1368 KB 
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
#define uid(a, b) uniform_int_distribution<int>(a, b)(mt)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll inf = 1e18;
const int mod = 1e9+7;
const int maxn = 100000 + 5;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
ll dp[maxn];
void solve() {
    int n, m;
    cin >> n;
    dp[0] = 0;
    for(int i = 1; i < maxn; i++)dp[i] = -inf;
    tuple<int, bool, int, int> e[4000];
    for(int i = 0, c, f, v; i < n; i++){
        cin >> c >> f >> v;
        e[i] = make_tuple(f, 1, c, v);
    }
    cin >> m;
    for(int i = 0, c, f, v; i < m; i++){
        cin >> c >> f >> v;
        e[i + n] = make_tuple(f, 0, c, v);
    }
    sort(e, e + n + m);
    reverse(e, e + n + m);
    for(int i = 0; i < n + m; i++){
        auto [f, wt, c, v] = e[i];
        if(wt == 0){
            for(int j = 0; j + c < maxn; j++){
                dp[j] = max(dp[j], dp[j + c] + v);
            }
        }
        else {
            for(int j = maxn - 1; j >= c; j--){
                dp[j] = max(dp[j], dp[j - c] - v);
            }
        }
    }
    cout << *max_element(dp, dp + maxn);
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int times = 1; //cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1304 KB Output is correct
4 Correct 16 ms 1312 KB Output is correct
5 Correct 159 ms 1320 KB Output is correct
6 Correct 157 ms 1324 KB Output is correct
7 Correct 150 ms 1328 KB Output is correct
8 Correct 166 ms 1116 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 9 ms 1112 KB Output is correct
4 Correct 9 ms 1368 KB Output is correct
5 Correct 69 ms 1300 KB Output is correct
6 Correct 68 ms 1112 KB Output is correct
7 Correct 158 ms 1328 KB Output is correct
8 Correct 158 ms 1368 KB Output is correct
9 Correct 150 ms 1300 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 14 ms 1312 KB Output is correct
4 Correct 15 ms 1116 KB Output is correct
5 Correct 35 ms 1292 KB Output is correct
6 Correct 28 ms 1112 KB Output is correct
7 Correct 38 ms 1116 KB Output is correct
8 Correct 39 ms 1112 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 128 ms 1296 KB Output is correct
4 Correct 177 ms 1116 KB Output is correct
5 Correct 284 ms 1340 KB Output is correct
6 Correct 369 ms 1364 KB Output is correct
7 Correct 314 ms 1364 KB Output is correct
8 Correct 291 ms 1332 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 13 ms 1304 KB Output is correct
3 Correct 62 ms 1288 KB Output is correct
4 Correct 146 ms 1112 KB Output is correct
5 Correct 298 ms 1344 KB Output is correct
6 Correct 301 ms 1308 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1304 KB Output is correct
4 Correct 16 ms 1312 KB Output is correct
5 Correct 159 ms 1320 KB Output is correct
6 Correct 157 ms 1324 KB Output is correct
7 Correct 150 ms 1328 KB Output is correct
8 Correct 166 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 9 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 69 ms 1300 KB Output is correct
14 Correct 68 ms 1112 KB Output is correct
15 Correct 158 ms 1328 KB Output is correct
16 Correct 158 ms 1368 KB Output is correct
17 Correct 150 ms 1300 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 14 ms 1312 KB Output is correct
21 Correct 15 ms 1116 KB Output is correct
22 Correct 35 ms 1292 KB Output is correct
23 Correct 28 ms 1112 KB Output is correct
24 Correct 38 ms 1116 KB Output is correct
25 Correct 39 ms 1112 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 128 ms 1296 KB Output is correct
29 Correct 177 ms 1116 KB Output is correct
30 Correct 284 ms 1340 KB Output is correct
31 Correct 369 ms 1364 KB Output is correct
32 Correct 314 ms 1364 KB Output is correct
33 Correct 291 ms 1332 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 13 ms 1304 KB Output is correct
36 Correct 62 ms 1288 KB Output is correct
37 Correct 146 ms 1112 KB Output is correct
38 Correct 298 ms 1344 KB Output is correct
39 Correct 301 ms 1308 KB Output is correct
40 Correct 83 ms 1368 KB Output is correct
41 Correct 152 ms 1308 KB Output is correct
42 Correct 228 ms 1324 KB Output is correct
43 Correct 306 ms 1348 KB Output is correct
44 Correct 297 ms 1116 KB Output is correct
45 Correct 315 ms 1368 KB Output is correct
46 Correct 149 ms 1308 KB Output is correct
47 Correct 245 ms 1328 KB Output is correct
48 Correct 221 ms 1328 KB Output is correct