oj.uz

Submission #531251

# Submission time Handle Problem Language Result Execution time Memory
531251 2022-02-28T09:02:31 Z kaxzert Cloud Computing (CEOI18_clo) C++17
100 / 100
 1690 ms 2124 KB 
/**
      ⚡⚡  ⚡⚡      ⚡⚡⚡     ⚡⚡  ⚡⚡  ⚡⚡⚡⚡⚡⚡  ⚡⚡⚡⚡⚡   ⚡⚡⚡⚡⚡⚡  ⚡⚡⚡⚡⚡⚡
      ⚡⚡ ⚡⚡      ⚡⚡⚡⚡      ⚡⚡ ⚡⚡     ⚡⚡   ⚡⚡      ⚡⚡  ⚡⚡  ⚡⚡⚡⚡⚡⚡
      ⚡⚡⚡⚡      ⚡⚡  ⚡⚡      ⚡⚡      ⚡⚡    ⚡⚡⚡⚡⚡   ⚡⚡⚡⚡⚡⚡    ⚡⚡
      ⚡⚡ ⚡⚡    ⚡⚡⚡⚡⚡⚡⚡⚡   ⚡⚡ ⚡⚡    ⚡⚡     ⚡⚡      ⚡⚡  ⚡⚡    ⚡⚡
      ⚡⚡  ⚡⚡  ⚡⚡     ⚡⚡  ⚡⚡  ⚡⚡  ⚡⚡⚡⚡⚡⚡   ⚡⚡⚡⚡⚡   ⚡⚡   ⚡⚡   ⚡⚡
**/

#include<bits/stdc++.h>

using namespace std;

#define fto(i, a, b) for(int i = a; i <= b; ++i)
#define fdto(i, a, b) for(int i = a; i >= b; --i)
#define bugarr(a, i, j) cout << #a << "{" << i << "..." << j << "}:"; fto(k, i, j-1) cout << a[k] << ", "; cout << a[j] << endl;
#define ll long long
#define db double
#define ldb long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define vt vector
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define trav(i, a) for(auto &i : a)
#define sz(a) (int)a.size()
#define pi(a, b) pair<a, b>
#define fast ios::sync_with_stdio(false); cin.tie(0)

void setIO(string s) {
    if (sz(s) != 0) {
        freopen((s+".inp").c_str(),"r",stdin);
        freopen((s+".out").c_str(),"w",stdout);
    }
}

void setIOusaco(string s) {
    if (sz(s) != 0) {
        freopen((s+".in").c_str(),"r",stdin);
        freopen((s+".out").c_str(),"w",stdout);
    }
}

template<typename T, typename V>
bool ckmin(T &a, V b) {return (b < a)? a = b, true : false;}
template<typename T, typename V>
bool ckmax(T &a, V b) {return (b > a)? a = b, true : false;}

int main() {
    #ifndef TAP 
    setIO("");
    //setIOusaco("CEOI18_clo");
    #endif

    fast;
    int n;
    vt<array<ll, 3> > a;
    cin >> n;
    ll mx = 0;
    fto(i, 1, n) {
        ll x, y, z;
        cin >> x >> y >> z;
        z = -z;
        a.pb({x, y, z});
        mx += x;
    }

    int m;
    cin >> m;
    fto(i, 1, m) {
        ll x, y, z;
        cin >> x >> y >> z;
        x = -x;
        a.pb({x, y, z});
    }

    sort(all(a), [](array<ll, 3> a, array<ll, 3> b) {
        return (a[1] != b[1] ? a[1] > b[1]: a[2] < b[2]);
    });

    vt<ll> f(mx+1, -1e15);
    f[0] = 0;
    trav(c, a) {
        vt<ll> nf(f);
        fto(i, 0, mx) {
            int newcore = i+c[0];
            if (newcore < 0 || newcore > mx) continue;
            nf[newcore] = max(nf[newcore], f[i]+c[2]);
        }
        f = nf;
    }

    cout << *max_element(all(f)) << '\n';

    return 0;
}

Compilation message

clo.cpp: In function 'void setIO(std::string)':
clo.cpp:34:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         freopen((s+".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:35:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         freopen((s+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp: In function 'void setIOusaco(std::string)':
clo.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen((s+".in").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen((s+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 380 KB Output is correct
8 Correct 6 ms 452 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 94 ms 700 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 428 ms 1280 KB Output is correct
8 Correct 89 ms 588 KB Output is correct
9 Correct 719 ms 1776 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 29 ms 332 KB Output is correct
4 Correct 4 ms 324 KB Output is correct
5 Correct 803 ms 1356 KB Output is correct
6 Correct 1510 ms 1928 KB Output is correct
7 Correct 1512 ms 1928 KB Output is correct
8 Correct 1421 ms 1868 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 312 KB Output is correct
3 Correct 88 ms 756 KB Output is correct
4 Correct 17 ms 332 KB Output is correct
5 Correct 1500 ms 1936 KB Output is correct
6 Correct 1492 ms 1952 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 380 KB Output is correct
8 Correct 6 ms 452 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 94 ms 700 KB Output is correct
14 Correct 5 ms 332 KB Output is correct
15 Correct 428 ms 1280 KB Output is correct
16 Correct 89 ms 588 KB Output is correct
17 Correct 719 ms 1776 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 312 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 29 ms 332 KB Output is correct
29 Correct 4 ms 324 KB Output is correct
30 Correct 803 ms 1356 KB Output is correct
31 Correct 1510 ms 1928 KB Output is correct
32 Correct 1512 ms 1928 KB Output is correct
33 Correct 1421 ms 1868 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 3 ms 312 KB Output is correct
36 Correct 88 ms 756 KB Output is correct
37 Correct 17 ms 332 KB Output is correct
38 Correct 1500 ms 1936 KB Output is correct
39 Correct 1492 ms 1952 KB Output is correct
40 Correct 91 ms 708 KB Output is correct
41 Correct 271 ms 968 KB Output is correct
42 Correct 19 ms 456 KB Output is correct
43 Correct 1660 ms 2104 KB Output is correct
44 Correct 1622 ms 2116 KB Output is correct
45 Correct 1690 ms 2124 KB Output is correct
46 Correct 10 ms 356 KB Output is correct
47 Correct 20 ms 460 KB Output is correct
48 Correct 20 ms 504 KB Output is correct