oj.uz

Submission #890513

# Submission time Handle Problem Language Result Execution time Memory
890513 2023-12-21T11:26:19 Z cuman Cloud Computing (CEOI18_clo) C++14
100 / 100
 741 ms 2140 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i = (l); i <= (r); i++)
#define sqr(x) ((x) * (x))
#define len(v) (int((v).size()))
#define all(v) v.begin(),v.end()
using i64 = long long;
#define x() real()
#define y() imag()
#define ckmin(a,b) a = min(a,b)
#define ckmax(a,b) a = max(a,b)

const int MaxN = 2000;
const int MaxCores = 50 * MaxN;

// (clock rate, cores added, profit added)
array<int,3> Transacs[2*MaxN];
int tranCount = 0;

int N, M;

// dp function for reference. the answer is F(0, 0)
int F(int p, int curCores) {
    if (p == tranCount) return 0;
    int res1 = curCores + Transacs[p][1] >= 0 ? F(p+1, curCores + Transacs[p][1]) + Transacs[p][2] : 0;
    int res2 = F(p+1, curCores);
    return max(res1, res2);
}

i64 dp[MaxCores + 1], dpprev[MaxCores + 1];

signed main() {
    cin >> N;
    for (int i = 0; i < N; i++) {
        int c, f, v; cin >> c >> f >> v;
        Transacs[tranCount++] = {f, c, -v};
    }

    cin >> M;
    for (int i = 0; i < M; i++) {
        int c, f, v; cin >> c >> f >> v;
        Transacs[tranCount++] = {f, -c, v};
    }

    sort(Transacs, Transacs + tranCount, greater<array<int,3>>());

    for (int p = tranCount; p >= 0; p--) {
        for (int curCores = MaxCores; curCores >= 0; curCores--) {
            if (p == tranCount) {
                dp[curCores] = 0;
                continue;
            }
            i64 res1 = curCores + Transacs[p][1] >= 0 ? dpprev[curCores + Transacs[p][1]] + Transacs[p][2] : 0;
            i64 res2 = dpprev[curCores];
            dp[curCores] = max(res1, res2);
        }

        swap(dp, dpprev);
    }

    cout << dpprev[0];

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 21 ms 2008 KB Output is correct
4 Correct 39 ms 1884 KB Output is correct
5 Correct 351 ms 1884 KB Output is correct
6 Correct 356 ms 1884 KB Output is correct
7 Correct 369 ms 1884 KB Output is correct
8 Correct 371 ms 1880 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 3 ms 1988 KB Output is correct
3 Correct 20 ms 1880 KB Output is correct
4 Correct 21 ms 1884 KB Output is correct
5 Correct 170 ms 2008 KB Output is correct
6 Correct 168 ms 1884 KB Output is correct
7 Correct 368 ms 2080 KB Output is correct
8 Correct 372 ms 1880 KB Output is correct
9 Correct 362 ms 2024 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1884 KB Output is correct
2 Correct 8 ms 1884 KB Output is correct
3 Correct 34 ms 1884 KB Output is correct
4 Correct 34 ms 1884 KB Output is correct
5 Correct 67 ms 1880 KB Output is correct
6 Correct 67 ms 1884 KB Output is correct
7 Correct 92 ms 1884 KB Output is correct
8 Correct 95 ms 2004 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1884 KB Output is correct
2 Correct 5 ms 1884 KB Output is correct
3 Correct 278 ms 2012 KB Output is correct
4 Correct 331 ms 2020 KB Output is correct
5 Correct 687 ms 2080 KB Output is correct
6 Correct 733 ms 1884 KB Output is correct
7 Correct 741 ms 2072 KB Output is correct
8 Correct 718 ms 2064 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 31 ms 1884 KB Output is correct
3 Correct 153 ms 1884 KB Output is correct
4 Correct 370 ms 2036 KB Output is correct
5 Correct 728 ms 2132 KB Output is correct
6 Correct 734 ms 2048 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 21 ms 2008 KB Output is correct
4 Correct 39 ms 1884 KB Output is correct
5 Correct 351 ms 1884 KB Output is correct
6 Correct 356 ms 1884 KB Output is correct
7 Correct 369 ms 1884 KB Output is correct
8 Correct 371 ms 1880 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 3 ms 1988 KB Output is correct
11 Correct 20 ms 1880 KB Output is correct
12 Correct 21 ms 1884 KB Output is correct
13 Correct 170 ms 2008 KB Output is correct
14 Correct 168 ms 1884 KB Output is correct
15 Correct 368 ms 2080 KB Output is correct
16 Correct 372 ms 1880 KB Output is correct
17 Correct 362 ms 2024 KB Output is correct
18 Correct 9 ms 1884 KB Output is correct
19 Correct 8 ms 1884 KB Output is correct
20 Correct 34 ms 1884 KB Output is correct
21 Correct 34 ms 1884 KB Output is correct
22 Correct 67 ms 1880 KB Output is correct
23 Correct 67 ms 1884 KB Output is correct
24 Correct 92 ms 1884 KB Output is correct
25 Correct 95 ms 2004 KB Output is correct
26 Correct 4 ms 1884 KB Output is correct
27 Correct 5 ms 1884 KB Output is correct
28 Correct 278 ms 2012 KB Output is correct
29 Correct 331 ms 2020 KB Output is correct
30 Correct 687 ms 2080 KB Output is correct
31 Correct 733 ms 1884 KB Output is correct
32 Correct 741 ms 2072 KB Output is correct
33 Correct 718 ms 2064 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 31 ms 1884 KB Output is correct
36 Correct 153 ms 1884 KB Output is correct
37 Correct 370 ms 2036 KB Output is correct
38 Correct 728 ms 2132 KB Output is correct
39 Correct 734 ms 2048 KB Output is correct
40 Correct 188 ms 2012 KB Output is correct
41 Correct 351 ms 2028 KB Output is correct
42 Correct 568 ms 2140 KB Output is correct
43 Correct 733 ms 2072 KB Output is correct
44 Correct 740 ms 2084 KB Output is correct
45 Correct 740 ms 2132 KB Output is correct
46 Correct 365 ms 1880 KB Output is correct
47 Correct 552 ms 2056 KB Output is correct
48 Correct 543 ms 2056 KB Output is correct