oj.uz

Submission #698283

# Submission time Handle Problem Language Result Execution time Memory
698283 2023-02-13T03:57:10 Z Duy_e Cloud Computing (CEOI18_clo) C++14
100 / 100
 706 ms 2100 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair <ll, ll>
#define st first
#define nd second
#define rep(i, n, m) for (ll i = n; i <= m; i ++)
#define rrep(i, n, m) for (ll i = n; i >= m; i --)
#define file "test"
using namespace std;

const long long N = 2e5 + 7;
const long long INF = 1e18;
const long long MOD = 2e9 + 11;
const long long base = 311;

ll n, m, dp[2][N];
struct clo {
    ll c, f, v, t;
    bool operator <(clo other) {
        if (f == other.f) {
            if (t == other.t)
                return v < other.v;
            return t < other.t;
        }
        return f > other.f;
    }
} a[N];

void maximize(ll &x, ll y) {
    if (y > x) x = y;
}

int main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
        //freopen(file".inp", "r", stdin);
        //freopen(file".out", "w", stdout);
    #endif // ONLINE_JUDGE

    cin >> n;
    ll mx = 0;
    rep(i, 1, n) {
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].t = 0;
        mx += a[i].c;
    }
    cin >> m;
    rep(i, n + 1, m + n) {
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].t = 1;
    }

    sort(a + 1, a + 1 + n + m);
    rep(i, 0, mx) dp[1][i] = dp[0][i] = -INF;
    dp[0][0] = 0;
    rep(i, 1, n + m) {
        ll val = 0, add = 0;
        if (a[i].t == 0)
            val = -a[i].v, add = a[i].c;
        else
            val = a[i].v, add = -a[i].c;

        rep(j, 0, mx) dp[1][j] = dp[0][j];
        rep(j, 0, mx)
            if (j + add <= mx && j + add >= 0)
                maximize(dp[1][j + add], dp[0][j] + val);
        rep(j, 0, mx) dp[0][j] = dp[1][j];
    }

    ll ans = 0;
    rep(i, 0, mx) ans = max(ans, dp[1][i]);
    cout << ans;
    return 0;
}

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 36 ms 724 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 166 ms 1240 KB Output is correct
8 Correct 29 ms 596 KB Output is correct
9 Correct 263 ms 1760 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 12 ms 464 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 322 ms 1240 KB Output is correct
6 Correct 575 ms 1904 KB Output is correct
7 Correct 560 ms 1900 KB Output is correct
8 Correct 515 ms 1868 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 36 ms 724 KB Output is correct
4 Correct 6 ms 452 KB Output is correct
5 Correct 596 ms 1900 KB Output is correct
6 Correct 597 ms 1884 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 36 ms 724 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 166 ms 1240 KB Output is correct
16 Correct 29 ms 596 KB Output is correct
17 Correct 263 ms 1760 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 12 ms 464 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 322 ms 1240 KB Output is correct
31 Correct 575 ms 1904 KB Output is correct
32 Correct 560 ms 1900 KB Output is correct
33 Correct 515 ms 1868 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 36 ms 724 KB Output is correct
37 Correct 6 ms 452 KB Output is correct
38 Correct 596 ms 1900 KB Output is correct
39 Correct 597 ms 1884 KB Output is correct
40 Correct 40 ms 724 KB Output is correct
41 Correct 112 ms 960 KB Output is correct
42 Correct 7 ms 500 KB Output is correct
43 Correct 619 ms 2060 KB Output is correct
44 Correct 638 ms 2068 KB Output is correct
45 Correct 706 ms 2100 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 8 ms 384 KB Output is correct
48 Correct 7 ms 472 KB Output is correct