oj.uz

답안 #483229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
483229 2021-10-28T10:19:17 Z Monarchuwu Cloud Computing (CEOI18_clo) C++17
100 / 100
 250 ms 1356 KB 
/**
 *  - xét: f[i] = F[j] = 1
 *  => build 2 knap:
 *      + dp1[x]: mincost để mua được x cores
 *      + dp2[y]: max profit khi bán được y cores
 *      + ans = max(dp2[y] - dp1[x]) (x >= y)
 *      + cùng đơn vị core => ta sửa đổi lại lại một chút nhằm hợp lại còn 1 knap:
 *          + machine   : c[i] cores và -v[i] value
 *          + order     : -C[i] cores và V[i] value
 *          => knap max profit = max dp[i] (i >= 0)
 *
 *  - xét: f, F bất kì
 *  => ta sort f, F (sort chung) giảm dần và build 1 knap dp[j] là max profit khi còn trữ j cores (j >= 0) (xét i ptu đầu)
 *
 *  - x = n + m
 *  - đpt: O(xlogx + x * (n * c))
**/
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int N = 2000 + 3, NC = N * 50;
int n, m;
struct Data {
    int c, f, v;
    bool operator < (Data o) const {
        if (f != o.f) return f > o.f;
        if (c != o.c) return c > o.c;
        return v > o.v;
    }
} a[N << 1];

ll dp[NC];
int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> n;
    for (int i = 0, c, f, v; i < n; ++i) {
        cin >> c >> f >> v;
        a[i] = { c, f, -v };
    }

    cin >> m;
    for (int i = 0, c, f, v; i < m; ++i) {
        cin >> c >> f >> v;
        a[n + i] = { -c, f, v };
    }

    n += m;
    sort(a, a + n);

    memset(dp, 0x80, sizeof(dp)); dp[0] = 0;
    int sum(0);
    for (int i = 0, v, c; i < n; ++i) {
        v = a[i].v, c = a[i].c;

        if (c > 0) { // machine
            sum += c;
            for (int j = sum; j >= c; --j)
                dp[j] = max(dp[j], dp[j - c] + v);
        }
        else { // order
            c = -c;
            for (int j = 0; j + c <= sum; ++j)
                dp[j] = max(dp[j], dp[j + c] + v);
        }
    }
    cout << *max_element(dp, dp + sum + 1) << '\n';
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 2 ms 1172 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 10 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 43 ms 1168 KB Output is correct
8 Correct 6 ms 1100 KB Output is correct
9 Correct 74 ms 1120 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 5 ms 1100 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 134 ms 1100 KB Output is correct
6 Correct 224 ms 1100 KB Output is correct
7 Correct 237 ms 1176 KB Output is correct
8 Correct 228 ms 1220 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 9 ms 1100 KB Output is correct
4 Correct 4 ms 1100 KB Output is correct
5 Correct 147 ms 1184 KB Output is correct
6 Correct 232 ms 1160 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 2 ms 1100 KB Output is correct
8 Correct 2 ms 1172 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 10 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 43 ms 1168 KB Output is correct
16 Correct 6 ms 1100 KB Output is correct
17 Correct 74 ms 1120 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1100 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct
26 Correct 1 ms 1100 KB Output is correct
27 Correct 1 ms 1100 KB Output is correct
28 Correct 5 ms 1100 KB Output is correct
29 Correct 3 ms 1100 KB Output is correct
30 Correct 134 ms 1100 KB Output is correct
31 Correct 224 ms 1100 KB Output is correct
32 Correct 237 ms 1176 KB Output is correct
33 Correct 228 ms 1220 KB Output is correct
34 Correct 1 ms 1100 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 9 ms 1100 KB Output is correct
37 Correct 4 ms 1100 KB Output is correct
38 Correct 147 ms 1184 KB Output is correct
39 Correct 232 ms 1160 KB Output is correct
40 Correct 11 ms 1132 KB Output is correct
41 Correct 31 ms 1144 KB Output is correct
42 Correct 3 ms 1100 KB Output is correct
43 Correct 250 ms 1180 KB Output is correct
44 Correct 245 ms 1100 KB Output is correct
45 Correct 162 ms 1356 KB Output is correct
46 Correct 2 ms 1100 KB Output is correct
47 Correct 3 ms 1100 KB Output is correct
48 Correct 3 ms 1140 KB Output is correct