oj.uz

Submission #709980

# Submission time Handle Problem Language Result Execution time Memory
709980 2023-03-15T02:19:55 Z Ozy Cloud Computing (CEOI18_clo) C++17
100 / 100
 460 ms 1484 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define pll pair<lli,lli>

#define MAX 2000

#define frec first.first
#define tipo first.second
#define core second.first
#define val second.second

vector<pair<pll,pll > > orden;
lli n,q,a,b,c,tam,res;
lli dp[100002];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    rep(i,1,100000) dp[i] = -(1ll<<60);

    // numerp 1 son las computadoras
    cin >> n;
    rep(i,1,n) {
        cin >> a >> b >> c;
        orden.push_back({{b,1},{a,c}});
    }

    // numerp 0 son las ventascin >> n;
    cin >> q;
    rep(i,1,q) {
        cin >> a >> b >> c;
        orden.push_back({{b,0},{a,c}});
    }

    sort(orden.begin(), orden.end());
    reverse(orden.begin(), orden.end());

    tam = 0;
    res = 0;
    for(auto act : orden) {

        if (act.tipo == 0) {      //es una venta
            rep(i,0,tam-act.core) {
                a = dp[i+act.core] + act.val;

                /*debugsl(i);
                debugsl(act.tipo);
                debugsl(tam);
                debugsl(act.core);
                debug(a);*/

                dp[i] = max(dp[i],a);
                res = max(res,a);
            }
        }
        else {
            repa(i,tam,0) {
                a = dp[i] - act.val;
                dp[i+act.core] = max(dp[i+act.core],a);
            }
            tam += act.core;
        }
    }

    cout << res;

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1180 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 3 ms 1236 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 11 ms 1108 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 65 ms 1236 KB Output is correct
8 Correct 8 ms 1248 KB Output is correct
9 Correct 81 ms 1248 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 1 ms 1064 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1112 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1104 KB Output is correct
3 Correct 6 ms 1236 KB Output is correct
4 Correct 3 ms 1236 KB Output is correct
5 Correct 175 ms 1392 KB Output is correct
6 Correct 346 ms 1384 KB Output is correct
7 Correct 322 ms 1392 KB Output is correct
8 Correct 281 ms 1392 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 12 ms 1108 KB Output is correct
4 Correct 5 ms 1248 KB Output is correct
5 Correct 216 ms 1400 KB Output is correct
6 Correct 304 ms 1372 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 2 ms 1180 KB Output is correct
6 Correct 2 ms 1236 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 3 ms 1236 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 11 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 65 ms 1236 KB Output is correct
16 Correct 8 ms 1248 KB Output is correct
17 Correct 81 ms 1248 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1064 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 2 ms 1112 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 980 KB Output is correct
27 Correct 1 ms 1104 KB Output is correct
28 Correct 6 ms 1236 KB Output is correct
29 Correct 3 ms 1236 KB Output is correct
30 Correct 175 ms 1392 KB Output is correct
31 Correct 346 ms 1384 KB Output is correct
32 Correct 322 ms 1392 KB Output is correct
33 Correct 281 ms 1392 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 12 ms 1108 KB Output is correct
37 Correct 5 ms 1248 KB Output is correct
38 Correct 216 ms 1400 KB Output is correct
39 Correct 304 ms 1372 KB Output is correct
40 Correct 14 ms 1120 KB Output is correct
41 Correct 52 ms 1236 KB Output is correct
42 Correct 6 ms 1364 KB Output is correct
43 Correct 328 ms 1396 KB Output is correct
44 Correct 460 ms 1404 KB Output is correct
45 Correct 212 ms 1484 KB Output is correct
46 Correct 4 ms 1236 KB Output is correct
47 Correct 5 ms 1380 KB Output is correct
48 Correct 5 ms 1364 KB Output is correct