oj.uz

Submission #675151

# Submission time Handle Problem Language Result Execution time Memory
675151 2022-12-27T02:13:52 Z Cookie Cloud Computing (CEOI18_clo) C++14
100 / 100
 801 ms 2132 KB 
#include<bits/stdc++.h>

using namespace std;
#include<fstream>

#define ll long long
#define vt vector
#define pb push_back
#define fi first
#define se second
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
typedef unsigned long long ull;
#define pii pair<int, int>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
const ll mod=  1e9 + 7;
const int mxk = 1e3, sq = 750, mxn = 105;
const ll inf = -1e18;
int n, m;
ll d[2][2002][51], p[2005];
struct th{
    ll c, f, v;
    bool operator <(const th &b){
        if(f != b.f)return(f > b.f);
        return(v < b.v);
    }
};

vt<th>a, b;
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n; ll core = 0;
    forr(i, 0, n){
        int c, f, v; cin >> c >> f >> v;
        a.pb({c, f, -v}); core += c;
    }
    cin >> m;
    forr(i, 0, m){
        int c, f, v; cin >> c >> f >> v;
        a.pb({-c, f, v});
    }
    sort(a.begin(), a.end());
    vt<ll>pre; pre.resize(core + 1, inf);
    pre[0] = 0;
    for(auto [c, f, v]: a){
        vt<ll>curr; curr.resize(core + 1);
        for(int j = 0; j <= core; j++)curr[j] = pre[j];
        for(int i = 0; i <= core; i++){
            int lft = i - c;
            if(lft >= 0 && lft <= core && pre[lft] != inf){
                
                curr[i] = max(curr[i], pre[lft] + v);
            }
        }
        for(int j = 0; j <= core; j++)pre[j] = curr[j];
    }
    cout << *max_element(pre.begin(), pre.end());
    return(0);
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:46:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |     for(auto [c, f, v]: a){
      |              ^

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 6 ms 472 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 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 41 ms 724 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 224 ms 1248 KB Output is correct
8 Correct 39 ms 596 KB Output is correct
9 Correct 340 ms 1748 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 13 ms 464 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 389 ms 1364 KB Output is correct
6 Correct 775 ms 1936 KB Output is correct
7 Correct 756 ms 1932 KB Output is correct
8 Correct 739 ms 1876 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 2 ms 340 KB Output is correct
3 Correct 39 ms 780 KB Output is correct
4 Correct 10 ms 392 KB Output is correct
5 Correct 747 ms 1948 KB Output is correct
6 Correct 770 ms 1940 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 5 ms 468 KB Output is correct
8 Correct 6 ms 472 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 41 ms 724 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 224 ms 1248 KB Output is correct
16 Correct 39 ms 596 KB Output is correct
17 Correct 340 ms 1748 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 13 ms 464 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 389 ms 1364 KB Output is correct
31 Correct 775 ms 1936 KB Output is correct
32 Correct 756 ms 1932 KB Output is correct
33 Correct 739 ms 1876 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 39 ms 780 KB Output is correct
37 Correct 10 ms 392 KB Output is correct
38 Correct 747 ms 1948 KB Output is correct
39 Correct 770 ms 1940 KB Output is correct
40 Correct 50 ms 724 KB Output is correct
41 Correct 141 ms 980 KB Output is correct
42 Correct 10 ms 468 KB Output is correct
43 Correct 747 ms 2088 KB Output is correct
44 Correct 779 ms 2132 KB Output is correct
45 Correct 801 ms 2132 KB Output is correct
46 Correct 6 ms 448 KB Output is correct
47 Correct 9 ms 468 KB Output is correct
48 Correct 9 ms 464 KB Output is correct