oj.uz

Submission #888372

# Submission time Handle Problem Language Result Execution time Memory
888372 2023-12-17T08:04:41 Z NoLove Cloud Computing (CEOI18_clo) C++14
100 / 100
 391 ms 1372 KB 
/**
 *    author : Lăng Trọng Đạt
 *    created: 17-12-2023 
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int int64_t
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;

const int INF = 1e15;
vector<int> dp; // dp[i][j]: maximum profit of first i "transaction" and j cores left
vector<vector<int>> g; // {f, c, v}
int n, m, cores_cnt = 0;

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    if (fopen("hi.inp", "r")) {
        freopen("hi.inp", "r", stdin);
//        freopen("hi.out", "w", stdout);
    } 

    cin >> n;
    for (int i = 0, c, f, v; i < n; i++) {
        cin >> c >> f >> v;
        cores_cnt += c;
        g.pb({f, c, -v});
    }
    cin >> m;
    for (int i = 0, c, f, v; i < m; i++) {
        cin >> c >> f >> v;
        g.pb({f, -c, v});
    }
    sort(all(g), greater<vector<int>>());
    int res = 0;
    dp.assign(cores_cnt + 5, -INF);
    dp[0] = 0;
    for (auto x : g) {
        if (x[1] < 0) {
            // db(i - x[1] - cores_cnt)
            for (int i = 0; i - x[1] <= cores_cnt; i++) {
                dp[i] = max(dp[i], dp[i - x[1]] + x[2]);
            }
        } else {
            for (int i = cores_cnt; i >= x[1]; i--) {
                dp[i] = max(dp[i], dp[i - x[1]] + x[2]);
            }
        }
        // } else {
        //     for (int i = )
        // }
    }
    cout << *max_element(all(dp));
}

Compilation message

clo.cpp: In function 'int32_t main()':
clo.cpp:42:9: warning: unused variable 'res' [-Wunused-variable]
   42 |     int res = 0;
      |         ^~~
clo.cpp:26:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         freopen("hi.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 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 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 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 0 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 20 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 99 ms 860 KB Output is correct
8 Correct 18 ms 604 KB Output is correct
9 Correct 151 ms 1116 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 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 7 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 186 ms 1116 KB Output is correct
6 Correct 341 ms 1368 KB Output is correct
7 Correct 339 ms 1372 KB Output is correct
8 Correct 366 ms 1368 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 20 ms 604 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 339 ms 1372 KB Output is correct
6 Correct 344 ms 1372 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 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 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 20 ms 604 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 99 ms 860 KB Output is correct
16 Correct 18 ms 604 KB Output is correct
17 Correct 151 ms 1116 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 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 7 ms 348 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 186 ms 1116 KB Output is correct
31 Correct 341 ms 1368 KB Output is correct
32 Correct 339 ms 1372 KB Output is correct
33 Correct 366 ms 1368 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 20 ms 604 KB Output is correct
37 Correct 5 ms 600 KB Output is correct
38 Correct 339 ms 1372 KB Output is correct
39 Correct 344 ms 1372 KB Output is correct
40 Correct 23 ms 600 KB Output is correct
41 Correct 63 ms 860 KB Output is correct
42 Correct 6 ms 604 KB Output is correct
43 Correct 383 ms 1372 KB Output is correct
44 Correct 391 ms 1368 KB Output is correct
45 Correct 377 ms 1368 KB Output is correct
46 Correct 3 ms 604 KB Output is correct
47 Correct 5 ms 604 KB Output is correct
48 Correct 5 ms 604 KB Output is correct