oj.uz

Submission #788268

# Submission time Handle Problem Language Result Execution time Memory
788268 2023-07-20T04:07:49 Z TS_2392 Cloud Computing (CEOI18_clo) C++14
100 / 100
 255 ms 1840 KB 
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
// using namespace __gnu_pbds;

#define fileIO(name)  if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
#define SPEED         ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define EL            cout << '\n'
#define dbg(x)        cout << #x << " = " << (x) << ' '
#define dbgp(x)       cout << #x << " = (" << (x.fi) << ", " << (x.se) << ") "
#define dbga(x, l, r) {cout << #x << '[' << l << ", " << r << "] = { "; for(int i = l; i <= (int)r; ++i) cout << x[i] << ' '; cout << "} ";}

#define epl           emplace
#define pb            push_back
#define eb            emplace_back
#define fi            first
#define se            second
#define mp            make_pair

#define sqr(x)        ((x) * (x))
#define all(x)        (x).begin(), (x).end()
#define rall(x)       (x).rbegin(), (x).rend()
#define lwb           lower_bound
#define upb           upper_bound
#define ctz           __builtin_ctzll // or __builtin_ctz
#define pct           __builtin_popcountll // or __builtin_popcount

typedef long long            ll;
typedef long double          ldb;
typedef unsigned int         uint;
typedef unsigned long long   ull;
typedef pair<ll, ll>         pll;
typedef pair<ll, int>        pli;
typedef pair<int, ll>        pil;
typedef pair<int, int>       pii;
typedef pair<ldb, ldb>       pld;
typedef pair<double, double> pdd;

template<class T1, class T2> bool minimize(T1 &a, T2 b){return a > b ? a = b, true : false;}
template<class T1, class T2> bool maximize(T1 &a, T2 b){return a < b ? a = b, true : false;}

// int d4x[4] = {1, 0, -1, 0}, d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// int d4y[4] = {0, 1, 0, -1}, d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
const int N = 3002;
const ll oo = 1e18;
struct Items{
    int c, f;
    ll v;
    bool operator < (const Items &oth) const{
        return f > oth.f || (f == oth.f && c > oth.c);
    }
} item[N * 2];
int n, m, sz;
void TS_2392(){
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> item[i].c >> item[i].f >> item[i].v;
        item[i].v = -item[i].v;
    }
    cin >> m;
    for(int i = n + 1; i <= n + m; ++i){
        cin >> item[i].c >> item[i].f >> item[i].v;
        item[i].c = -item[i].c;
    }
    sz = n + m;
    sort(item + 1, item + 1 + sz);
    vector<ll> dp(1);
    for(int i = 0; i < sz; ++i){
        if(item[i + 1].c > 0){
            dp.resize((int)dp.size() + item[i + 1].c, -oo);
            for(int d = dp.size() - 1 - item[i + 1].c; d >= 0; --d){
                maximize(dp[d + item[i + 1].c], dp[d] + item[i + 1].v);
            }
        }
        else{
            for(int d = -item[i + 1].c; d < dp.size(); ++d){
                maximize(dp[d + item[i + 1].c], dp[d] + item[i + 1].v);
            }
        }
    }
    cout << *max_element(dp.begin(), dp.end());
}
int main(){
    SPEED; fileIO("text");
    int numtest = 1; //cin >> numtest;
    for(int itest = 1; itest <= numtest; ++itest){
        // cout << "Case #" << itest << ": ";
        TS_2392();
    }
    return 0;
}

Compilation message

clo.cpp: In function 'void TS_2392()':
clo.cpp:81:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |             for(int d = -item[i + 1].c; d < dp.size(); ++d){
      |                                         ~~^~~~~~~~~~~
clo.cpp: In function 'int main()':
clo.cpp:8:58: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | #define fileIO(name)  if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
      |                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:89:12: note: in expansion of macro 'fileIO'
   89 |     SPEED; fileIO("text");
      |            ^~~~~~
clo.cpp:8:91: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 | #define fileIO(name)  if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
      |                                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:89:12: note: in expansion of macro 'fileIO'
   89 |     SPEED; fileIO("text");
      |            ^~~~~~

Subtask #1
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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 2 ms 340 KB Output is correct

Subtask #2
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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 8 ms 800 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 36 ms 1048 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 68 ms 1260 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 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 3 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 107 ms 1232 KB Output is correct
6 Correct 190 ms 1308 KB Output is correct
7 Correct 177 ms 1340 KB Output is correct
8 Correct 255 ms 1340 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 8 ms 668 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 129 ms 1840 KB Output is correct
6 Correct 175 ms 1220 KB Output is correct

Subtask #6
10.0 / 10.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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 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 2 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 8 ms 800 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 36 ms 1048 KB Output is correct
16 Correct 5 ms 468 KB Output is correct
17 Correct 68 ms 1260 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 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 3 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 107 ms 1232 KB Output is correct
31 Correct 190 ms 1308 KB Output is correct
32 Correct 177 ms 1340 KB Output is correct
33 Correct 255 ms 1340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 8 ms 668 KB Output is correct
37 Correct 3 ms 340 KB Output is correct
38 Correct 129 ms 1840 KB Output is correct
39 Correct 175 ms 1220 KB Output is correct
40 Correct 9 ms 720 KB Output is correct
41 Correct 25 ms 768 KB Output is correct
42 Correct 3 ms 340 KB Output is correct
43 Correct 190 ms 1344 KB Output is correct
44 Correct 189 ms 1344 KB Output is correct
45 Correct 138 ms 1368 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 4 ms 336 KB Output is correct
48 Correct 2 ms 340 KB Output is correct