oj.uz

Submission #839685

# Submission time Handle Problem Language Result Execution time Memory
839685 2023-08-30T12:52:03 Z themm1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 1257 ms 5900 KB 
#include <bits/stdc++.h>
using namespace std;
// ordered set whith s.order_of_key(x) method, which returns rank of element x in set s
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
*/

// pair printing
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "(" << par.first << "; " << par.second << ")"; return out;}
// set printing
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// map printing
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for(const auto &x:cont) out << x << ", "; out << "}"; return out; }
// unordered_set printing
template <class T>
ostream& operator<<(ostream& out, const unordered_set<T> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// unordered_map printing
template <class T, class U>
ostream& operator<<(ostream& out, const unordered_map<T, U> &cont) {out << "{";for(const auto &x:cont) out << x << ", ";out << "}";return out;}
// vector printing
template<class T>
ostream& operator<<(ostream& out, const vector<T> &cont){ out << "[";  for (const auto &x:cont) out << x << ", ";  out << "]"; return out;}

#define print(x) cout << (x) << endl;
#define dmp(x) cerr << #x << " = " << x << endl
#define dmpn(x) cerr << #x << " = " << x << "; "
#define dmpl(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << x << endl

#define int long long
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define contains(s,x) ((s).find(x) != (s).end())
const int MOD = 998244353;

struct item {
        int f, c, price;
        bool is_order;
};

bool compare(item &a, item &b) {
        if (a.f == b.f) return a.is_order < b.is_order;
        return a.f > b.f;
}

int N, M;

void solve() {
        cin >> N;
        vector<item> v(N);
        for (int i = 0; i < N; i++) cin >> v[i].c >> v[i].f >> v[i].price;
        cin >> M;
        v.resize(N + M);
        for (int i = N; i < N + M; i++) {
                cin >> v[i].c >> v[i].f >> v[i].price;
                v[i].is_order = true;
        }
        sort(all(v), compare);

        vector<int> last = { 0 };
        for (auto itm : v) {
                vector<int> current = last;
                // dmpn(itm.f); dmpn(itm.c); dmpn(itm.price); dmp(itm.is_order);
                for (int i = 0; i < sz(last); i++) {
                        if (itm.is_order) {
                                if (i + itm.c >= sz(last)) current[i] = last[i];
                                else current[i] = max(last[i], last[i + itm.c] + itm.price);
                        } else {
                                if (i - itm.c < 0) max(last[i], last[0] - itm.price);
                                else current[i] = max(last[i], last[i - itm.c] - itm.price);
                        }
                }
                if (!itm.is_order) {
                        for (int i = sz(last); i < sz(last) + itm.c; i++) {
                                if (i - itm.c < 0) current.pb(last[0] - itm.price);
                                else current.pb(last[i - itm.c] - itm.price);
                        }
                } else {
                        for (int i = sz(current) - 2; i >= 0; i--) {
                                current[i] = max(current[i], current[i + 1]);
                        }
                }
                // dmp(current);
                last = current;
        }
        int ans = last[0];
        cout << ans << endl;
}

int32_t main() {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);

        int t = 1;
        // cin >> t;
        while (t--) {
                solve();
        }
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 37 ms 1984 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 186 ms 3216 KB Output is correct
8 Correct 15 ms 984 KB Output is correct
9 Correct 328 ms 4856 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 7 ms 620 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 559 ms 3104 KB Output is correct
6 Correct 1105 ms 5020 KB Output is correct
7 Correct 1111 ms 5060 KB Output is correct
8 Correct 1068 ms 4868 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 39 ms 2284 KB Output is correct
4 Correct 12 ms 468 KB Output is correct
5 Correct 719 ms 4820 KB Output is correct
6 Correct 1115 ms 5076 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 37 ms 1984 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 186 ms 3216 KB Output is correct
16 Correct 15 ms 984 KB Output is correct
17 Correct 328 ms 4856 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 7 ms 620 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 559 ms 3104 KB Output is correct
31 Correct 1105 ms 5020 KB Output is correct
32 Correct 1111 ms 5060 KB Output is correct
33 Correct 1068 ms 4868 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 39 ms 2284 KB Output is correct
37 Correct 12 ms 468 KB Output is correct
38 Correct 719 ms 4820 KB Output is correct
39 Correct 1115 ms 5076 KB Output is correct
40 Correct 42 ms 2052 KB Output is correct
41 Correct 134 ms 2176 KB Output is correct
42 Correct 8 ms 596 KB Output is correct
43 Correct 1244 ms 5900 KB Output is correct
44 Correct 1257 ms 5660 KB Output is correct
45 Correct 804 ms 5452 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 7 ms 468 KB Output is correct
48 Correct 7 ms 580 KB Output is correct