답안 #161231

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161231 2019-11-01T14:06:18 Z rama_pang Cloud Computing (CEOI18_clo) C++14
100 / 100
1012 ms 2168 KB
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint INF = 1e15;

struct item {   // standard DP Knapsack by reducing the problem to:
    int core;   // customer negative, shop positive - must be >= 0
    int clock;  // sort by this descendingly - then we can forget it
    int price;  // customer positive, shop negative - maximize this
    int type;   // 1 = shop, 2 = customer
};

int N, M;
item A[5005];
lint DP[2][100005]; // pos and current cores available

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> N; for (int i = 0; i < N; i++) cin >> A[i].core >> A[i].clock >> A[i].price;
    cin >> M; for (int i = N; i < N + M; i++) cin >> A[i].core >> A[i].clock >> A[i].price;
    for (int i = 0; i < N; i++) A[i].type = 1;
    for (int i = N; i < N + M; i++) A[i].type = 2;

    sort(A, A + N + M, [&](item l, item r) { return l.clock > r.clock || (l.clock == r.clock && l.type < r.type); });
    for (int i = 0; i < N + M; i++) {
        if (A[i].type == 1) A[i].price *= -1;
        if (A[i].type == 2) A[i].core *= -1;
    }

    /* Base Case */
    for (int pos = 0; pos < 2; pos++) for (int core = 0; core <= 100000; core++) DP[pos][core] = -INF;
    DP[0][0] = 0;
    /* DP Knapsack */
    for (int pos = 0; pos < N + M; pos++) {
        for (int core = 0; core <= 100000; core++) {
            int nxt_core = core + A[pos].core;
            if (nxt_core >= 0) DP[(pos + 1) % 2][nxt_core] = max(DP[(pos + 1) % 2][nxt_core], DP[pos % 2][core] + A[pos].price);
            DP[(pos + 1) % 2][core] = max(DP[(pos + 1) % 2][core], DP[pos % 2][core]);
            DP[pos % 2][core] = -INF;
        }
        lint ans = -INF;
    }

    lint ans = 0;
    for (int core = 0; core <= 100000; core++) ans = max(ans, DP[(N + M) % 2][core]);
    cout << ans << "\n";
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:43:14: warning: unused variable 'ans' [-Wunused-variable]
         lint ans = -INF;
              ^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 4 ms 1916 KB Output is correct
3 Correct 30 ms 1912 KB Output is correct
4 Correct 56 ms 2040 KB Output is correct
5 Correct 487 ms 2168 KB Output is correct
6 Correct 499 ms 2044 KB Output is correct
7 Correct 501 ms 2028 KB Output is correct
8 Correct 498 ms 2024 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 6 ms 1912 KB Output is correct
3 Correct 29 ms 1912 KB Output is correct
4 Correct 32 ms 1948 KB Output is correct
5 Correct 229 ms 1912 KB Output is correct
6 Correct 238 ms 1980 KB Output is correct
7 Correct 499 ms 2028 KB Output is correct
8 Correct 499 ms 1912 KB Output is correct
9 Correct 481 ms 2040 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1912 KB Output is correct
2 Correct 12 ms 1912 KB Output is correct
3 Correct 59 ms 1960 KB Output is correct
4 Correct 48 ms 1912 KB Output is correct
5 Correct 99 ms 1912 KB Output is correct
6 Correct 93 ms 2040 KB Output is correct
7 Correct 127 ms 2040 KB Output is correct
8 Correct 135 ms 1912 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1912 KB Output is correct
2 Correct 7 ms 1912 KB Output is correct
3 Correct 378 ms 2088 KB Output is correct
4 Correct 456 ms 2040 KB Output is correct
5 Correct 954 ms 2060 KB Output is correct
6 Correct 996 ms 2040 KB Output is correct
7 Correct 1010 ms 2092 KB Output is correct
8 Correct 994 ms 2092 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1912 KB Output is correct
2 Correct 44 ms 1948 KB Output is correct
3 Correct 207 ms 1964 KB Output is correct
4 Correct 510 ms 2012 KB Output is correct
5 Correct 979 ms 2168 KB Output is correct
6 Correct 998 ms 2140 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 4 ms 1916 KB Output is correct
3 Correct 30 ms 1912 KB Output is correct
4 Correct 56 ms 2040 KB Output is correct
5 Correct 487 ms 2168 KB Output is correct
6 Correct 499 ms 2044 KB Output is correct
7 Correct 501 ms 2028 KB Output is correct
8 Correct 498 ms 2024 KB Output is correct
9 Correct 4 ms 1912 KB Output is correct
10 Correct 6 ms 1912 KB Output is correct
11 Correct 29 ms 1912 KB Output is correct
12 Correct 32 ms 1948 KB Output is correct
13 Correct 229 ms 1912 KB Output is correct
14 Correct 238 ms 1980 KB Output is correct
15 Correct 499 ms 2028 KB Output is correct
16 Correct 499 ms 1912 KB Output is correct
17 Correct 481 ms 2040 KB Output is correct
18 Correct 12 ms 1912 KB Output is correct
19 Correct 12 ms 1912 KB Output is correct
20 Correct 59 ms 1960 KB Output is correct
21 Correct 48 ms 1912 KB Output is correct
22 Correct 99 ms 1912 KB Output is correct
23 Correct 93 ms 2040 KB Output is correct
24 Correct 127 ms 2040 KB Output is correct
25 Correct 135 ms 1912 KB Output is correct
26 Correct 8 ms 1912 KB Output is correct
27 Correct 7 ms 1912 KB Output is correct
28 Correct 378 ms 2088 KB Output is correct
29 Correct 456 ms 2040 KB Output is correct
30 Correct 954 ms 2060 KB Output is correct
31 Correct 996 ms 2040 KB Output is correct
32 Correct 1010 ms 2092 KB Output is correct
33 Correct 994 ms 2092 KB Output is correct
34 Correct 5 ms 1912 KB Output is correct
35 Correct 44 ms 1948 KB Output is correct
36 Correct 207 ms 1964 KB Output is correct
37 Correct 510 ms 2012 KB Output is correct
38 Correct 979 ms 2168 KB Output is correct
39 Correct 998 ms 2140 KB Output is correct
40 Correct 257 ms 1912 KB Output is correct
41 Correct 499 ms 2008 KB Output is correct
42 Correct 758 ms 2040 KB Output is correct
43 Correct 1012 ms 2040 KB Output is correct
44 Correct 1002 ms 2068 KB Output is correct
45 Correct 994 ms 2040 KB Output is correct
46 Correct 518 ms 2040 KB Output is correct
47 Correct 756 ms 2076 KB Output is correct
48 Correct 750 ms 2040 KB Output is correct