oj.uz

Submission #715085

# Submission time Handle Problem Language Result Execution time Memory
715085 2023-03-25T22:14:27 Z Trent Cloud Computing (CEOI18_clo) C++17
100 / 100
 544 ms 4208 KB 
#include "bits/stdc++.h"

using namespace std;
#define forR(i, a) for(int i = 0; (i) < (a); ++(i))
#define REP(i, a, b) for(int i = (a); (i) < (b); ++i)
#define all(a) a.begin(), a.end()
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define printArr(arr) for(int asdfg : arr) cout << asdfg << ' '; cout << '\n'
typedef long long ll;
typedef array<int, 2> pii;

// computer: (+ cores, speed, + in profit)
struct thing{
    int c, f, v;
};
const int MN = 4e3 + 10, MC=60;
const ll INF = 1e18;
thing arr[2 * MN];

signed main(){
    int n; cin >> n;
    forR(i, n) {
        cin >> arr[i].c >> arr[i].f >> arr[i].v;
        arr[i].v *= -1;
    }
    int m; cin >> m;
    REP(i, n, n + m){
        cin >> arr[i].c >> arr[i].f >> arr[i].v;
        arr[i].c *= -1;
    }
    sort(arr, arr + n + m, [](thing& a, thing& b){return a.f > b.f || a.f == b.f && a.c > b.c;});
    vector<ll> pre(MN * MC, -INF), cur(MN * MC, -INF);
    pre[0] = 0; int cs=0;
    forR(i, n + m){
        forR(j, cs + 1) cur[j] = pre[j];
        forR(j, cs + 1) if(j + arr[i].c >= 0) cur[j + arr[i].c] = max(cur[j + arr[i].c], pre[j] + arr[i].v);
        cs += max(0, arr[i].c);
        // forR(j, 20) cout << pre[j] << ' ';
        // cout << '\n';
        // forR(j, 20) cout << cur[j] << ' ';
        // cout << "\n\n";
        pre.swap(cur);
    }
    ll bes = 0;
    for(ll i : pre) bes = max(bes, i);
    cout << bes << '\n';
}

Compilation message

clo.cpp: In lambda function:
clo.cpp:31:82: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   31 |     sort(arr, arr + n + m, [](thing& a, thing& b){return a.f > b.f || a.f == b.f && a.c > b.c;});
      |                                                                       ~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 2 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 22 ms 4092 KB Output is correct
6 Correct 4 ms 4052 KB Output is correct
7 Correct 101 ms 4088 KB Output is correct
8 Correct 15 ms 4052 KB Output is correct
9 Correct 165 ms 4084 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 11 ms 4052 KB Output is correct
4 Correct 5 ms 4052 KB Output is correct
5 Correct 312 ms 4156 KB Output is correct
6 Correct 515 ms 4172 KB Output is correct
7 Correct 506 ms 4052 KB Output is correct
8 Correct 505 ms 4152 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 22 ms 4076 KB Output is correct
4 Correct 9 ms 4052 KB Output is correct
5 Correct 326 ms 4172 KB Output is correct
6 Correct 496 ms 4112 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4052 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 3 ms 4052 KB Output is correct
4 Correct 2 ms 4052 KB Output is correct
5 Correct 4 ms 4048 KB Output is correct
6 Correct 4 ms 4052 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 6 ms 4052 KB Output is correct
9 Correct 2 ms 4052 KB Output is correct
10 Correct 2 ms 4052 KB Output is correct
11 Correct 2 ms 4052 KB Output is correct
12 Correct 2 ms 4052 KB Output is correct
13 Correct 22 ms 4092 KB Output is correct
14 Correct 4 ms 4052 KB Output is correct
15 Correct 101 ms 4088 KB Output is correct
16 Correct 15 ms 4052 KB Output is correct
17 Correct 165 ms 4084 KB Output is correct
18 Correct 3 ms 4052 KB Output is correct
19 Correct 3 ms 4052 KB Output is correct
20 Correct 3 ms 4052 KB Output is correct
21 Correct 2 ms 4052 KB Output is correct
22 Correct 3 ms 4052 KB Output is correct
23 Correct 3 ms 4052 KB Output is correct
24 Correct 3 ms 4052 KB Output is correct
25 Correct 3 ms 4052 KB Output is correct
26 Correct 2 ms 4052 KB Output is correct
27 Correct 2 ms 4052 KB Output is correct
28 Correct 11 ms 4052 KB Output is correct
29 Correct 5 ms 4052 KB Output is correct
30 Correct 312 ms 4156 KB Output is correct
31 Correct 515 ms 4172 KB Output is correct
32 Correct 506 ms 4052 KB Output is correct
33 Correct 505 ms 4152 KB Output is correct
34 Correct 2 ms 4052 KB Output is correct
35 Correct 2 ms 4052 KB Output is correct
36 Correct 22 ms 4076 KB Output is correct
37 Correct 9 ms 4052 KB Output is correct
38 Correct 326 ms 4172 KB Output is correct
39 Correct 496 ms 4112 KB Output is correct
40 Correct 23 ms 4028 KB Output is correct
41 Correct 67 ms 4104 KB Output is correct
42 Correct 9 ms 4052 KB Output is correct
43 Correct 534 ms 4160 KB Output is correct
44 Correct 544 ms 4156 KB Output is correct
45 Correct 362 ms 4208 KB Output is correct
46 Correct 5 ms 4028 KB Output is correct
47 Correct 9 ms 4052 KB Output is correct
48 Correct 10 ms 4152 KB Output is correct