oj.uz

Submission #573011

# Submission time Handle Problem Language Result Execution time Memory
573011 2022-06-05T15:57:15 Z urosk Cloud Computing (CEOI18_clo) C++14
100 / 100
 1686 ms 1728 KB 
//https://oj.uz/problem/view/CEOI18_clo
#define here cerr<<"===========================================\n"
#include <bits/stdc++.h>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;

#define maxn 2005
#define maxc 55
#define mx 100000
ll n,m;
struct komp{
    ll f,tip,c,v;
};
bool cmp(komp a,komp b){
    if(a.f==b.f) return a.tip<b.tip;
    return a.f<b.f;
}
ll dp[maxc*maxn];
int main(){
	daj_mi_malo_vremena
    vector<komp> a;
    cin >> n;
    for(ll i = 1;i<=n;i++){
        ll f,c,v;
        cin >> c >> f >> v;
        a.pb({f,1,c,v});
    }
    cin >> m;
    for(ll i = 1;i<=m;i++){
        ll f,c,v;
        cin >> c >> f >> v;
        a.pb({f,0,c,v});
    }
    for(ll i = 0;i<=mx;i++) dp[i] = 0;
    sort(all(a),cmp);
    for(komp p : a){
        ll c = p.c;
        ll v = p.v;
        cerr<<c<< " "<<v<<endl;
        if(p.tip==1){
            for(ll i = c;i<=mx;i++){
                dp[i-c] = max(dp[i-c],dp[i] - v);
            }
        }else{
            for(ll i = mx;i>=c;i--){
                dp[i] = max(dp[i],dp[i-c] + v);
            }
        }
        for(ll i = 1;i<=mx;i++) dp[i] = max(dp[i],dp[i-1]);
    }
    cout<<dp[0]<<endl;
	return 0;
}
/*
4
4 2200 700
2 1800 10
20 2550 9999
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
ans: 350
*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 49 ms 1108 KB Output is correct
4 Correct 88 ms 1108 KB Output is correct
5 Correct 795 ms 1516 KB Output is correct
6 Correct 792 ms 1484 KB Output is correct
7 Correct 843 ms 1672 KB Output is correct
8 Correct 831 ms 1280 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1060 KB Output is correct
2 Correct 5 ms 1108 KB Output is correct
3 Correct 46 ms 1108 KB Output is correct
4 Correct 46 ms 1108 KB Output is correct
5 Correct 384 ms 1188 KB Output is correct
6 Correct 379 ms 1180 KB Output is correct
7 Correct 834 ms 1284 KB Output is correct
8 Correct 823 ms 1280 KB Output is correct
9 Correct 800 ms 1252 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1108 KB Output is correct
2 Correct 14 ms 1096 KB Output is correct
3 Correct 76 ms 1116 KB Output is correct
4 Correct 76 ms 1116 KB Output is correct
5 Correct 161 ms 1144 KB Output is correct
6 Correct 155 ms 1136 KB Output is correct
7 Correct 214 ms 1144 KB Output is correct
8 Correct 211 ms 1152 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1108 KB Output is correct
2 Correct 7 ms 1108 KB Output is correct
3 Correct 622 ms 1236 KB Output is correct
4 Correct 760 ms 1244 KB Output is correct
5 Correct 1569 ms 1524 KB Output is correct
6 Correct 1645 ms 1424 KB Output is correct
7 Correct 1686 ms 1548 KB Output is correct
8 Correct 1616 ms 1540 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 69 ms 1108 KB Output is correct
3 Correct 343 ms 1168 KB Output is correct
4 Correct 840 ms 1240 KB Output is correct
5 Correct 1636 ms 1536 KB Output is correct
6 Correct 1636 ms 1400 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 49 ms 1108 KB Output is correct
4 Correct 88 ms 1108 KB Output is correct
5 Correct 795 ms 1516 KB Output is correct
6 Correct 792 ms 1484 KB Output is correct
7 Correct 843 ms 1672 KB Output is correct
8 Correct 831 ms 1280 KB Output is correct
9 Correct 3 ms 1060 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 46 ms 1108 KB Output is correct
12 Correct 46 ms 1108 KB Output is correct
13 Correct 384 ms 1188 KB Output is correct
14 Correct 379 ms 1180 KB Output is correct
15 Correct 834 ms 1284 KB Output is correct
16 Correct 823 ms 1280 KB Output is correct
17 Correct 800 ms 1252 KB Output is correct
18 Correct 13 ms 1108 KB Output is correct
19 Correct 14 ms 1096 KB Output is correct
20 Correct 76 ms 1116 KB Output is correct
21 Correct 76 ms 1116 KB Output is correct
22 Correct 161 ms 1144 KB Output is correct
23 Correct 155 ms 1136 KB Output is correct
24 Correct 214 ms 1144 KB Output is correct
25 Correct 211 ms 1152 KB Output is correct
26 Correct 8 ms 1108 KB Output is correct
27 Correct 7 ms 1108 KB Output is correct
28 Correct 622 ms 1236 KB Output is correct
29 Correct 760 ms 1244 KB Output is correct
30 Correct 1569 ms 1524 KB Output is correct
31 Correct 1645 ms 1424 KB Output is correct
32 Correct 1686 ms 1548 KB Output is correct
33 Correct 1616 ms 1540 KB Output is correct
34 Correct 3 ms 1108 KB Output is correct
35 Correct 69 ms 1108 KB Output is correct
36 Correct 343 ms 1168 KB Output is correct
37 Correct 840 ms 1240 KB Output is correct
38 Correct 1636 ms 1536 KB Output is correct
39 Correct 1636 ms 1400 KB Output is correct
40 Correct 433 ms 1272 KB Output is correct
41 Correct 807 ms 1384 KB Output is correct
42 Correct 1253 ms 1492 KB Output is correct
43 Correct 1648 ms 1408 KB Output is correct
44 Correct 1651 ms 1424 KB Output is correct
45 Correct 1654 ms 1728 KB Output is correct
46 Correct 850 ms 1256 KB Output is correct
47 Correct 1255 ms 1380 KB Output is correct
48 Correct 1226 ms 1364 KB Output is correct