oj.uz

Submission #951675

# Submission time Handle Problem Language Result Execution time Memory
951675 2024-03-22T09:48:57 Z Github Cloud Computing (CEOI18_clo) C++17
100 / 100
 747 ms 2296 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <climits>
#include <cmath>
#include <algorithm>
#include <stack>
#include <set>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
#define pr printf
#define sc scanf
#define fi first
#define si second


const ll MOD = 998244353;
const ll INF = 1e17;

void setIO(string s){
    freopen((s+".in").c_str(), "r", stdin);
    freopen((s+".out").c_str(), "w", stdout);
}

struct Event{
    ll c, f, v;
};


int main() {
    speedup
    int n; cin >> n;
    vector<Event> a;
    ll mx = 0;
    for (int i = 0; i < n; i++){
        ll ci, f, v;  cin >> ci >> f >> v;
        mx += ci;
        a.push_back({ci, f, -v});
    }
    int m; cin >> m;
    for (int i = 0; i < m; i++){
        ll c, f, v; cin >> c >> f >> v;
        a.push_back({-c, f, v});
    }
    auto cmp = [&](Event x, Event y){
        return (x.f == y.f ? x.v < y.v: x.f > y.f);
    };
    sort(a.begin(), a.end(), cmp);
    vector<ll> oldDP(mx+1, LLONG_MIN);
    oldDP[0] = 0;
    for (Event& x: a){
        vector<ll> newDP(oldDP);
        for (ll c = 0; c <= mx; c++){
            ll p = c - x.c;
            if (0 <= p && p <= mx && oldDP[p] != LLONG_MIN){
                newDP[c] = max(newDP[c], oldDP[p]+x.v);
            }
        }
        oldDP = newDP;
    }
    cout << *max_element(oldDP.begin(), oldDP.end()) << endl;
    return 0;
}

Compilation message

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

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 548 KB Output is correct
8 Correct 3 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 30 ms 856 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 171 ms 1396 KB Output is correct
8 Correct 26 ms 744 KB Output is correct
9 Correct 233 ms 1920 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 9 ms 604 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 312 ms 1496 KB Output is correct
6 Correct 531 ms 2116 KB Output is correct
7 Correct 531 ms 2104 KB Output is correct
8 Correct 527 ms 1972 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 34 ms 920 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 602 ms 2092 KB Output is correct
6 Correct 507 ms 2076 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 548 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 30 ms 856 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 171 ms 1396 KB Output is correct
16 Correct 26 ms 744 KB Output is correct
17 Correct 233 ms 1920 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 9 ms 604 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 312 ms 1496 KB Output is correct
31 Correct 531 ms 2116 KB Output is correct
32 Correct 531 ms 2104 KB Output is correct
33 Correct 527 ms 1972 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 34 ms 920 KB Output is correct
37 Correct 6 ms 348 KB Output is correct
38 Correct 602 ms 2092 KB Output is correct
39 Correct 507 ms 2076 KB Output is correct
40 Correct 41 ms 860 KB Output is correct
41 Correct 112 ms 1112 KB Output is correct
42 Correct 6 ms 664 KB Output is correct
43 Correct 547 ms 2256 KB Output is correct
44 Correct 554 ms 2272 KB Output is correct
45 Correct 747 ms 2296 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 6 ms 672 KB Output is correct
48 Correct 7 ms 604 KB Output is correct