oj.uz

Submission #398782

# Submission time Handle Problem Language Result Execution time Memory
398782 2021-05-04T20:05:20 Z Victor Cloud Computing (CEOI18_clo) C++17
100 / 100
 1130 ms 2920 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {

    int n, m, c;
    vector<pair<ii, pair<ll, int>>> dpvec;
    ll f, v, sumc = 1, ans = 0;

    cin >> n;
    rep(i, 0, n) {
        scanf("%d %lld %lld",&c,&f,&v);
        dpvec.push_back({{f, 1}, {v, c}});
        sumc += c;
    }

    cin >> m;
    rep(i, 0, m) {
        scanf("%d %lld %lld",&c,&f,&v);
        dpvec.push_back({{f, 0}, {v, c}});
    }

    sort(all(dpvec), greater<>());
    vector<ll> dummy(sumc, -1e15), dp = dummy, dp2 = dp;
    dp[0] = 0;

    trav(item, dpvec) {
        int query;
        tie(f, query) = item.first;
        tie(v, c) = item.second;

        rep(i, 0, sumc) {

            if (dp[i] == -1e15) continue;

            dp2[i] = max(dp2[i], dp[i]);
            if (query)
                dp2[i + c] = max(dp2[i + c], dp[i] - v);
            else if (!query && c <= i)
                dp2[i - c] = max(dp2[i - c], dp[i] + v);
        }

        dp.swap(dp2);
        dp2 = dummy;
    }

    trav(val, dp) ans = max(ans, val);

    printf("%lld\n",ans);
    return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |         scanf("%d %lld %lld",&c,&f,&v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |         scanf("%d %lld %lld",&c,&f,&v);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 19 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 65 ms 844 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 266 ms 1648 KB Output is correct
8 Correct 42 ms 632 KB Output is correct
9 Correct 430 ms 2448 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 18 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 594 ms 1736 KB Output is correct
6 Correct 1130 ms 2648 KB Output is correct
7 Correct 1129 ms 2652 KB Output is correct
8 Correct 1055 ms 2556 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 55 ms 844 KB Output is correct
4 Correct 14 ms 420 KB Output is correct
5 Correct 900 ms 2756 KB Output is correct
6 Correct 1120 ms 2628 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 19 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 65 ms 844 KB Output is correct
14 Correct 3 ms 332 KB Output is correct
15 Correct 266 ms 1648 KB Output is correct
16 Correct 42 ms 632 KB Output is correct
17 Correct 430 ms 2448 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 288 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 18 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 594 ms 1736 KB Output is correct
31 Correct 1130 ms 2648 KB Output is correct
32 Correct 1129 ms 2652 KB Output is correct
33 Correct 1055 ms 2556 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 2 ms 336 KB Output is correct
36 Correct 55 ms 844 KB Output is correct
37 Correct 14 ms 420 KB Output is correct
38 Correct 900 ms 2756 KB Output is correct
39 Correct 1120 ms 2628 KB Output is correct
40 Correct 59 ms 844 KB Output is correct
41 Correct 169 ms 1100 KB Output is correct
42 Correct 14 ms 500 KB Output is correct
43 Correct 674 ms 2892 KB Output is correct
44 Correct 669 ms 2892 KB Output is correct
45 Correct 659 ms 2920 KB Output is correct
46 Correct 7 ms 332 KB Output is correct
47 Correct 13 ms 460 KB Output is correct
48 Correct 13 ms 460 KB Output is correct