oj.uz

Submission #417175

# Submission time Handle Problem Language Result Execution time Memory
417175 2021-06-03T12:36:23 Z egekabas Cloud Computing (CEOI18_clo) C++14
100 / 100
 423 ms 1348 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
const ll inf = 1e17;
struct st{
    ll c, f, v;
};

ll sf(st a, st b){
    return a.f > b.f;
}
ll n, m;
st a[2009];
st b[2009];
ll dp[2000*50+1];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(ll i = 0; i < n; ++i)
        cin >> a[i].c >> a[i].f >> a[i].v;
    cin >> m;
    for(ll i = 0; i < m; ++i)
        cin >> b[i].c >> b[i].f >> b[i].v;
    
    sort(a, a+n, sf);
    sort(b, b+m, sf);
    
    for(ll i = 1; i <= 2000*50; ++i)
        dp[i] = -inf;

    ll i = 0, j = 0;
    while(i < n || j < m){
        if(i < n && (j == m || a[i].f >= b[j].f)){
            for(ll k = 2000*50-a[i].c; k >= 0; --k)
                dp[k+a[i].c] = max(dp[k+a[i].c], dp[k]-a[i].v);
            ++i;
        }
        else{
            for(ll k = b[j].c; k <= 2000*50; ++k)
                dp[k-b[j].c] = max(dp[k-b[j].c], dp[k]+b[j].v);
            ++j;
        }
    }
    ll ans = 0;
    for(ll i = 0; i <= 2000*50; ++i)
        ans = max(ans, dp[i]);
    cout << ans << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 11 ms 1108 KB Output is correct
4 Correct 21 ms 1108 KB Output is correct
5 Correct 197 ms 1176 KB Output is correct
6 Correct 197 ms 1100 KB Output is correct
7 Correct 200 ms 1176 KB Output is correct
8 Correct 199 ms 1220 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 2 ms 1100 KB Output is correct
3 Correct 12 ms 1100 KB Output is correct
4 Correct 14 ms 1100 KB Output is correct
5 Correct 95 ms 1100 KB Output is correct
6 Correct 120 ms 1120 KB Output is correct
7 Correct 229 ms 1176 KB Output is correct
8 Correct 211 ms 1168 KB Output is correct
9 Correct 203 ms 1140 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1100 KB Output is correct
2 Correct 8 ms 1100 KB Output is correct
3 Correct 20 ms 1100 KB Output is correct
4 Correct 22 ms 1100 KB Output is correct
5 Correct 52 ms 1100 KB Output is correct
6 Correct 38 ms 1100 KB Output is correct
7 Correct 51 ms 1104 KB Output is correct
8 Correct 51 ms 1100 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 972 KB Output is correct
2 Correct 3 ms 1100 KB Output is correct
3 Correct 161 ms 1128 KB Output is correct
4 Correct 179 ms 1144 KB Output is correct
5 Correct 383 ms 1236 KB Output is correct
6 Correct 416 ms 1228 KB Output is correct
7 Correct 411 ms 1228 KB Output is correct
8 Correct 400 ms 1228 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 17 ms 1100 KB Output is correct
3 Correct 85 ms 1100 KB Output is correct
4 Correct 201 ms 1100 KB Output is correct
5 Correct 423 ms 1232 KB Output is correct
6 Correct 419 ms 1196 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 11 ms 1108 KB Output is correct
4 Correct 21 ms 1108 KB Output is correct
5 Correct 197 ms 1176 KB Output is correct
6 Correct 197 ms 1100 KB Output is correct
7 Correct 200 ms 1176 KB Output is correct
8 Correct 199 ms 1220 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 12 ms 1100 KB Output is correct
12 Correct 14 ms 1100 KB Output is correct
13 Correct 95 ms 1100 KB Output is correct
14 Correct 120 ms 1120 KB Output is correct
15 Correct 229 ms 1176 KB Output is correct
16 Correct 211 ms 1168 KB Output is correct
17 Correct 203 ms 1140 KB Output is correct
18 Correct 4 ms 1100 KB Output is correct
19 Correct 8 ms 1100 KB Output is correct
20 Correct 20 ms 1100 KB Output is correct
21 Correct 22 ms 1100 KB Output is correct
22 Correct 52 ms 1100 KB Output is correct
23 Correct 38 ms 1100 KB Output is correct
24 Correct 51 ms 1104 KB Output is correct
25 Correct 51 ms 1100 KB Output is correct
26 Correct 4 ms 972 KB Output is correct
27 Correct 3 ms 1100 KB Output is correct
28 Correct 161 ms 1128 KB Output is correct
29 Correct 179 ms 1144 KB Output is correct
30 Correct 383 ms 1236 KB Output is correct
31 Correct 416 ms 1228 KB Output is correct
32 Correct 411 ms 1228 KB Output is correct
33 Correct 400 ms 1228 KB Output is correct
34 Correct 2 ms 972 KB Output is correct
35 Correct 17 ms 1100 KB Output is correct
36 Correct 85 ms 1100 KB Output is correct
37 Correct 201 ms 1100 KB Output is correct
38 Correct 423 ms 1232 KB Output is correct
39 Correct 419 ms 1196 KB Output is correct
40 Correct 111 ms 1120 KB Output is correct
41 Correct 220 ms 1160 KB Output is correct
42 Correct 306 ms 1200 KB Output is correct
43 Correct 415 ms 1224 KB Output is correct
44 Correct 406 ms 1348 KB Output is correct
45 Correct 405 ms 1228 KB Output is correct
46 Correct 202 ms 1100 KB Output is correct
47 Correct 307 ms 1196 KB Output is correct
48 Correct 305 ms 1100 KB Output is correct