oj.uz

답안 #848434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848434 2023-09-12T15:29:25 Z LOLOLO Cloud Computing (CEOI18_clo) C++17
100 / 100
 547 ms 3164 KB 
#include <bits/stdc++.h>
typedef long long ll;

using namespace std;
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 2e4 + 10;

bool cmp(vector <ll> a, vector <ll> b) {
    if (a[1] == b[1]) {
        return a[3] > b[3]; 
    }

    return a[1] > b[1];
}

void maximize(ll &a, ll b) {
    if (a < b)
        a = b;
}

ll solve() {
    int n;
    cin >> n;
    vector < vector <ll>> a(n);
    for (auto &x : a) {
        x.resize(4);
        cin >> x[0] >> x[1] >> x[2];
        x[3] = 1;
    }

    int m;
    cin >> m;

    vector < vector <ll>> b(m);
    for (auto &x : b) {
        x.resize(4);
        cin >> x[0] >> x[1] >> x[2];
        x[3] = -1;
    }

    for (auto x : b)
        a.pb(x);

    sort(all(a), cmp);

    vector < vector <ll>> dp(2, vector <ll> (n * 50 + 10, -1e16));
    dp[0][0] = 0;
    ll ans = 0;

    for (int i = 1; i <= n + m; i++) {
        int t = (i % 2);
        for (int j = 0; j <= n * 50; j++) {
            dp[t][j] = dp[1 - t][j];
            if (a[i - 1][3] == 1) {
                if (j >= a[i - 1][0]) {
                    maximize(dp[t][j], dp[1 - t][j - a[i - 1][0]] - a[i - 1][2]);
                }
            } else {
                if (a[i - 1][0] + j <= n * 50) {
                    maximize(dp[t][j], dp[1 - t][j + a[i - 1][0]] + a[i - 1][2]);
                }
            }
            maximize(ans, dp[t][j]);
        }
    }

    return ans;
}

int main(){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);
    cout.tie(NULL);

    int t = 1;
    //cin >> t;

    while (t--) {
        //solve();
        cout << solve() << "\n";
    }

    return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 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 4 ms 600 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 600 KB Output is correct
8 Correct 4 ms 604 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 57 ms 1628 KB Output is correct
6 Correct 53 ms 1372 KB Output is correct
7 Correct 281 ms 2908 KB Output is correct
8 Correct 258 ms 2904 KB Output is correct
9 Correct 260 ms 2908 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 6 ms 752 KB Output is correct
7 Correct 10 ms 600 KB Output is correct
8 Correct 9 ms 800 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 143 ms 2140 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 520 ms 3164 KB Output is correct
6 Correct 501 ms 3160 KB Output is correct
7 Correct 547 ms 3160 KB Output is correct
8 Correct 500 ms 3164 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 544 KB Output is correct
3 Correct 32 ms 1116 KB Output is correct
4 Correct 110 ms 1628 KB Output is correct
5 Correct 512 ms 3164 KB Output is correct
6 Correct 487 ms 3164 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 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 4 ms 600 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 600 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 57 ms 1628 KB Output is correct
14 Correct 53 ms 1372 KB Output is correct
15 Correct 281 ms 2908 KB Output is correct
16 Correct 258 ms 2904 KB Output is correct
17 Correct 260 ms 2908 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 576 KB Output is correct
22 Correct 6 ms 604 KB Output is correct
23 Correct 6 ms 752 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 9 ms 800 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 143 ms 2140 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 520 ms 3164 KB Output is correct
31 Correct 501 ms 3160 KB Output is correct
32 Correct 547 ms 3160 KB Output is correct
33 Correct 500 ms 3164 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 544 KB Output is correct
36 Correct 32 ms 1116 KB Output is correct
37 Correct 110 ms 1628 KB Output is correct
38 Correct 512 ms 3164 KB Output is correct
39 Correct 487 ms 3164 KB Output is correct
40 Correct 35 ms 1116 KB Output is correct
41 Correct 100 ms 1368 KB Output is correct
42 Correct 298 ms 2396 KB Output is correct
43 Correct 507 ms 3160 KB Output is correct
44 Correct 499 ms 3160 KB Output is correct
45 Correct 518 ms 3164 KB Output is correct
46 Correct 130 ms 1628 KB Output is correct
47 Correct 292 ms 2396 KB Output is correct
48 Correct 288 ms 2396 KB Output is correct