oj.uz

Submission #542088

# Submission time Handle Problem Language Result Execution time Memory
542088 2022-03-25T10:33:49 Z SavicS Cloud Computing (CEOI18_clo) C++17
100 / 100
 446 ms 1316 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for (auto& a : x)
 
#define sz(a) (int)(a).size()
#define pb push_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const ll inf = 1e18 + 5;
const int mxN = 2005; 

int n, m;
array<int,3> A[mxN];
array<int,3> B[mxN];

const int N = 100000;
ll dp[N + 5]; // dp[i] - max ako mi ostane i procesora

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;

    vector<array<int,4>> vec;
    ff(i,1,n){
        int c, f, v;
        cin >> c >> f >> v;
        vec.pb({f, 1, c, v});
    }

    cin >> m;
    ff(i,1,m){
        int C, F, V;
        cin >> C >> F >> V;
        vec.pb({F, -1, C, V});
    }

    sort(all(vec));

    ff(i,0,N + 1)dp[i] = -inf;
    dp[0] = 0;

    fb(i,sz(vec) - 1,0){
        
        if(vec[i][1] == 1){
            int c = vec[i][2];
            int v = vec[i][3];
            fb(j,N,0)if(j >= c)dp[j] = max(dp[j], dp[j - c] - v);
        }
        else{
            int C = vec[i][2];
            int V = vec[i][3];
            ff(j,0,N)if(j + C <= N)dp[j] = max(dp[j], dp[j + C] + V);
        }


    }

    ll rez = 0;
    fb(i,N,0)rez = max(rez, dp[i]);

    cout << rez << '\n';

    return 0;
}
/*

4
4 2200 700
2 1800 10
20 2550 9999
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550

1
5 1 8
2
3 1 10
10 1 10
 

4
4 1 700
2 1 10
20 1 9999
4 1 750
3
1 1 300
6 1 1500
3 1 4550
 
// probati bojenje sahovski
*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 11 ms 1120 KB Output is correct
4 Correct 22 ms 1236 KB Output is correct
5 Correct 179 ms 1108 KB Output is correct
6 Correct 195 ms 1200 KB Output is correct
7 Correct 212 ms 1224 KB Output is correct
8 Correct 193 ms 1228 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 13 ms 1120 KB Output is correct
4 Correct 14 ms 1108 KB Output is correct
5 Correct 109 ms 1148 KB Output is correct
6 Correct 109 ms 1148 KB Output is correct
7 Correct 234 ms 1204 KB Output is correct
8 Correct 229 ms 1216 KB Output is correct
9 Correct 221 ms 1172 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1108 KB Output is correct
2 Correct 4 ms 1088 KB Output is correct
3 Correct 19 ms 1128 KB Output is correct
4 Correct 19 ms 1112 KB Output is correct
5 Correct 39 ms 1116 KB Output is correct
6 Correct 42 ms 1116 KB Output is correct
7 Correct 59 ms 1124 KB Output is correct
8 Correct 55 ms 1128 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 178 ms 1152 KB Output is correct
4 Correct 183 ms 1160 KB Output is correct
5 Correct 402 ms 1236 KB Output is correct
6 Correct 418 ms 1236 KB Output is correct
7 Correct 410 ms 1236 KB Output is correct
8 Correct 422 ms 1236 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 17 ms 1120 KB Output is correct
3 Correct 95 ms 1136 KB Output is correct
4 Correct 218 ms 1180 KB Output is correct
5 Correct 438 ms 1280 KB Output is correct
6 Correct 440 ms 1252 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 11 ms 1120 KB Output is correct
4 Correct 22 ms 1236 KB Output is correct
5 Correct 179 ms 1108 KB Output is correct
6 Correct 195 ms 1200 KB Output is correct
7 Correct 212 ms 1224 KB Output is correct
8 Correct 193 ms 1228 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 13 ms 1120 KB Output is correct
12 Correct 14 ms 1108 KB Output is correct
13 Correct 109 ms 1148 KB Output is correct
14 Correct 109 ms 1148 KB Output is correct
15 Correct 234 ms 1204 KB Output is correct
16 Correct 229 ms 1216 KB Output is correct
17 Correct 221 ms 1172 KB Output is correct
18 Correct 4 ms 1108 KB Output is correct
19 Correct 4 ms 1088 KB Output is correct
20 Correct 19 ms 1128 KB Output is correct
21 Correct 19 ms 1112 KB Output is correct
22 Correct 39 ms 1116 KB Output is correct
23 Correct 42 ms 1116 KB Output is correct
24 Correct 59 ms 1124 KB Output is correct
25 Correct 55 ms 1128 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 178 ms 1152 KB Output is correct
29 Correct 183 ms 1160 KB Output is correct
30 Correct 402 ms 1236 KB Output is correct
31 Correct 418 ms 1236 KB Output is correct
32 Correct 410 ms 1236 KB Output is correct
33 Correct 422 ms 1236 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 17 ms 1120 KB Output is correct
36 Correct 95 ms 1136 KB Output is correct
37 Correct 218 ms 1180 KB Output is correct
38 Correct 438 ms 1280 KB Output is correct
39 Correct 440 ms 1252 KB Output is correct
40 Correct 117 ms 1148 KB Output is correct
41 Correct 207 ms 1192 KB Output is correct
42 Correct 328 ms 1248 KB Output is correct
43 Correct 430 ms 1276 KB Output is correct
44 Correct 427 ms 1280 KB Output is correct
45 Correct 446 ms 1316 KB Output is correct
46 Correct 219 ms 1184 KB Output is correct
47 Correct 319 ms 1236 KB Output is correct
48 Correct 343 ms 1236 KB Output is correct