oj.uz

Submission #1105717

# Submission time Handle Problem Language Result Execution time Memory
1105717 2024-10-27T12:46:31 Z Lakshya108 Cloud Computing (CEOI18_clo) C++14
100 / 100
 1264 ms 5968 KB 
#include <bits/stdc++.h>

using namespace std;

// Macros
#define pb push_back
#define pf push_front
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define up(v) upper_bound(v)
#define low(v) lower_bound(v)

// Read and Print
#define read(a, n) for (ll i = 0; i < n; ++i) cin >> a[i];
#define print(a, n) for (ll i = 0; i < n; ++i) {cout << a[i] << " ";} cout << "\n";
#define endl "\n"
#define sp " "

// Typedefs
typedef long long ll;
typedef long double ld;
typedef long long int lli;
typedef pair < ll, ll > pll;
typedef pair < lli, lli > plli;
typedef pair < int, int > pii;
typedef vector < ll > vi;
typedef vector < vector < lli >> vvi;
using vec = vector < int > ;

// Constants
const ll mxn = 1e6 + 5;
const ll mod = 1e9 + 7;

// Solve
const ll N = 1e5 + 5;
const ll INF = 1e18 + 6;

struct data {
    ll c, f, p;
};

void solve() {
    ll n, m, sum = 0;
    vector < struct data > a;
    cin >> n;
    for (ll i = 1; i <= n; i++) {
        ll c, f, p;
        cin >> c >> f >> p;
        a.pb({
            c,
            f,
            -p
        });
        sum += c;
    }
    cin >> m;
    for (ll j = 0; j < m; j++) {
        ll c, f, p;
        cin >> c >> f >> p;
        a.pb({
            -c,
            f,
            p
        });
    }
    vector < vi > dp(sum + 1, vi(2, -INF));
    dp[0][0] = 0;

    auto comp = [ & ](struct data & a, struct data & b) -> bool {
        return a.f != b.f ? a.f > b.f : a.p < b.p;
    };
    sort(all(a), comp);
    for (ll i = 0; i < a.size(); i++) {
        for (ll j = 0; j <= sum; j++)
            dp[j][1] = dp[j][0];
        for (ll j = 0; j <= sum; j++) {
            ll pre = j - a[i].c;
            if (pre >= 0 && pre <= sum && dp[pre][0] != -INF)
                dp[j][1] = max(dp[j][1], dp[pre][0] + a[i].p);
        }
        for (ll j = 0; j <= sum; j++)
            dp[j][0] = dp[j][1];
    }
    ll ans = -INF;
    for (ll i = 0; i <= sum; i++)
        ans = max(ans, dp[i][0]);
    cout << ans << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:75:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<data>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for (ll i = 0; i < a.size(); i++) {
      |                    ~~^~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 83 ms 1616 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 399 ms 3152 KB Output is correct
8 Correct 55 ms 848 KB Output is correct
9 Correct 603 ms 5200 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 20 ms 748 KB Output is correct
4 Correct 4 ms 336 KB Output is correct
5 Correct 612 ms 3152 KB Output is correct
6 Correct 1170 ms 5456 KB Output is correct
7 Correct 1228 ms 5456 KB Output is correct
8 Correct 1255 ms 5200 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 70 ms 1872 KB Output is correct
4 Correct 12 ms 592 KB Output is correct
5 Correct 1040 ms 5200 KB Output is correct
6 Correct 1168 ms 5456 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 5 ms 336 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 83 ms 1616 KB Output is correct
14 Correct 4 ms 336 KB Output is correct
15 Correct 399 ms 3152 KB Output is correct
16 Correct 55 ms 848 KB Output is correct
17 Correct 603 ms 5200 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 2 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 20 ms 748 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 612 ms 3152 KB Output is correct
31 Correct 1170 ms 5456 KB Output is correct
32 Correct 1228 ms 5456 KB Output is correct
33 Correct 1255 ms 5200 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 2 ms 592 KB Output is correct
36 Correct 70 ms 1872 KB Output is correct
37 Correct 12 ms 592 KB Output is correct
38 Correct 1040 ms 5200 KB Output is correct
39 Correct 1168 ms 5456 KB Output is correct
40 Correct 82 ms 1616 KB Output is correct
41 Correct 230 ms 2128 KB Output is correct
42 Correct 15 ms 592 KB Output is correct
43 Correct 1264 ms 5968 KB Output is correct
44 Correct 1221 ms 5968 KB Output is correct
45 Correct 1098 ms 5968 KB Output is correct
46 Correct 7 ms 336 KB Output is correct
47 Correct 14 ms 592 KB Output is correct
48 Correct 14 ms 592 KB Output is correct