oj.uz

답안 #205701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
205701 2020-02-29T14:09:12 Z dolphingarlic Cloud Computing (CEOI18_clo) C++14
90 / 100
 833 ms 2172 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

const ll INF = LLONG_MIN / 2;

struct Object {
    int c;
    ll f, v;
    bool operator<(Object B) {
        if (f == B.f) return v < B.v;
        return f > B.f;
    }
} obj[4001];

ll dp[2][100001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n;
    FOR(i, 0, n) {
        cin >> obj[i].c >> obj[i].f >> obj[i].v;
        obj[i].v *= -1;
    }
    cin >> m;
    FOR(i, n, n + m) {
        cin >> obj[i].c >> obj[i].f >> obj[i].v;
        obj[i].c *= -1;
    }
    sort(obj, obj + n + m);

    FOR(i, 0, 2) FOR(j, 0, 100001) dp[i][j] = INF;
    dp[1][0] = 0;
    FOR(i, 0, n + m) {
        FOR(j, 0, 99951) {
            if (j >= obj[i].c)
                dp[i & 1][j] = max(dp[1 - i & 1][j],
                                   dp[1 - i & 1][j - obj[i].c] + obj[i].v);
            else
                dp[i & 1][j] = dp[1 - i & 1][j];
        }
        FOR(j, 0, 100001) dp[1 - i & 1][j] = INF;
    }

    cout << *max_element(dp[1 - (n + m) & 1], dp[1 - (n + m) & 1] + 100001);
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:41:41: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                 dp[i & 1][j] = max(dp[1 - i & 1][j],
                                       ~~^~~
clo.cpp:42:41: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                                    dp[1 - i & 1][j - obj[i].c] + obj[i].v);
                                       ~~^~~
clo.cpp:44:37: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
                 dp[i & 1][j] = dp[1 - i & 1][j];
                                   ~~^~~
clo.cpp:46:32: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
         FOR(j, 0, 100001) dp[1 - i & 1][j] = INF;
                              ~~^~~
clo.cpp:49:31: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
     cout << *max_element(dp[1 - (n + m) & 1], dp[1 - (n + m) & 1] + 100001);
                             ~~^~~~~~~~~
clo.cpp:49:52: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
     cout << *max_element(dp[1 - (n + m) & 1], dp[1 - (n + m) & 1] + 100001);
                                                  ~~^~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 1912 KB Output is correct
3 Correct 28 ms 1912 KB Output is correct
4 Correct 48 ms 1912 KB Output is correct
5 Correct 410 ms 2040 KB Output is correct
6 Correct 407 ms 2040 KB Output is correct
7 Correct 431 ms 2040 KB Output is correct
8 Correct 422 ms 2000 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 1912 KB Output is correct
3 Correct 28 ms 1916 KB Output is correct
4 Correct 28 ms 2040 KB Output is correct
5 Correct 196 ms 2040 KB Output is correct
6 Correct 191 ms 1912 KB Output is correct
7 Correct 422 ms 2040 KB Output is correct
8 Correct 419 ms 2044 KB Output is correct
9 Correct 409 ms 2040 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1912 KB Output is correct
2 Correct 12 ms 1912 KB Output is correct
3 Correct 42 ms 1912 KB Output is correct
4 Correct 43 ms 1916 KB Output is correct
5 Correct 88 ms 2040 KB Output is correct
6 Correct 81 ms 1912 KB Output is correct
7 Correct 110 ms 1912 KB Output is correct
8 Correct 107 ms 1912 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1912 KB Output is correct
2 Correct 9 ms 1912 KB Output is correct
3 Correct 313 ms 1992 KB Output is correct
4 Correct 378 ms 1912 KB Output is correct
5 Correct 769 ms 2168 KB Output is correct
6 Correct 833 ms 2088 KB Output is correct
7 Correct 826 ms 2168 KB Output is correct
8 Correct 813 ms 2172 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1912 KB Output is correct
2 Correct 38 ms 1912 KB Output is correct
3 Correct 176 ms 2040 KB Output is correct
4 Correct 414 ms 2028 KB Output is correct
5 Correct 813 ms 2168 KB Output is correct
6 Correct 832 ms 2040 KB Output is correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 8 ms 1912 KB Output is correct
3 Correct 28 ms 1912 KB Output is correct
4 Correct 48 ms 1912 KB Output is correct
5 Correct 410 ms 2040 KB Output is correct
6 Correct 407 ms 2040 KB Output is correct
7 Correct 431 ms 2040 KB Output is correct
8 Correct 422 ms 2000 KB Output is correct
9 Correct 6 ms 1912 KB Output is correct
10 Correct 8 ms 1912 KB Output is correct
11 Correct 28 ms 1916 KB Output is correct
12 Correct 28 ms 2040 KB Output is correct
13 Correct 196 ms 2040 KB Output is correct
14 Correct 191 ms 1912 KB Output is correct
15 Correct 422 ms 2040 KB Output is correct
16 Correct 419 ms 2044 KB Output is correct
17 Correct 409 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 42 ms 1912 KB Output is correct
21 Correct 43 ms 1916 KB Output is correct
22 Correct 88 ms 2040 KB Output is correct
23 Correct 81 ms 1912 KB Output is correct
24 Correct 110 ms 1912 KB Output is correct
25 Correct 107 ms 1912 KB Output is correct
26 Correct 10 ms 1912 KB Output is correct
27 Correct 9 ms 1912 KB Output is correct
28 Correct 313 ms 1992 KB Output is correct
29 Correct 378 ms 1912 KB Output is correct
30 Correct 769 ms 2168 KB Output is correct
31 Correct 833 ms 2088 KB Output is correct
32 Correct 826 ms 2168 KB Output is correct
33 Correct 813 ms 2172 KB Output is correct
34 Correct 7 ms 1912 KB Output is correct
35 Correct 38 ms 1912 KB Output is correct
36 Correct 176 ms 2040 KB Output is correct
37 Correct 414 ms 2028 KB Output is correct
38 Correct 813 ms 2168 KB Output is correct
39 Correct 832 ms 2040 KB Output is correct
40 Correct 215 ms 2040 KB Output is correct
41 Correct 406 ms 1912 KB Output is correct
42 Correct 637 ms 2168 KB Output is correct
43 Incorrect 823 ms 2168 KB Output isn't correct
44 Halted 0 ms 0 KB -