oj.uz

Submission #376129

# Submission time Handle Problem Language Result Execution time Memory
376129 2021-03-11T01:16:27 Z YJU Cloud Computing (CEOI18_clo) C++14
100 / 100
 432 ms 1644 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll N=1e5+5;
const ll MOD=1e9+7;
const ll INF=(1LL<<61);
const ld pi=acos(-1);
#define REP(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

struct ob{
	ll c,f,val,type;
};
vector<ob>a;
ll n,dp[N],m;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	REP(i,n){
        ob tmp;
        cin>>tmp.c>>tmp.f>>tmp.val;
        tmp.type=0;
        a.pb(tmp);
	}
	cin>>m;
	REP(i,m){
		ob tmp;
		cin>>tmp.c>>tmp.f>>tmp.val;
		tmp.type=1;
		a.pb(tmp);
	}
	sort(a.begin(),a.end(),[](ob A,ob B){
		if(A.f!=B.f)return A.f>B.f;
		return (A.type<B.type);
	});
	REP(i,N)dp[i]=-INF;
	dp[0]=0;
	for(auto t:a){
        if(t.type==0){
			for(int i=N-1;i>=0;i--){
				if(i+t.c<N)dp[i+t.c]=max(dp[i+t.c],dp[i]-t.val);
			}
        }else{
			for(int i=0;i<N;i++){
				if(i-t.c>=0)dp[i-t.c]=max(dp[i-t.c],dp[i]+t.val);
			}
        }
	}
	ll ans=0;
	REP(i,N)ans=max(ans,dp[i]);
	cout<<ans<<"\n";
	return 0;
}
/*
7 1
5 0
5 0
7 0
3 0
4 0
4 3 0
2 1 0


*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 12 ms 1132 KB Output is correct
4 Correct 23 ms 1132 KB Output is correct
5 Correct 197 ms 1260 KB Output is correct
6 Correct 204 ms 1388 KB Output is correct
7 Correct 211 ms 1388 KB Output is correct
8 Correct 261 ms 1260 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 11 ms 1132 KB Output is correct
4 Correct 11 ms 1132 KB Output is correct
5 Correct 91 ms 1260 KB Output is correct
6 Correct 90 ms 1260 KB Output is correct
7 Correct 203 ms 1260 KB Output is correct
8 Correct 200 ms 1388 KB Output is correct
9 Correct 195 ms 1260 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1132 KB Output is correct
2 Correct 6 ms 1172 KB Output is correct
3 Correct 19 ms 1132 KB Output is correct
4 Correct 19 ms 1132 KB Output is correct
5 Correct 37 ms 1260 KB Output is correct
6 Correct 37 ms 1132 KB Output is correct
7 Correct 55 ms 1260 KB Output is correct
8 Correct 53 ms 1132 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1132 KB Output is correct
2 Correct 3 ms 1132 KB Output is correct
3 Correct 154 ms 1388 KB Output is correct
4 Correct 193 ms 1260 KB Output is correct
5 Correct 380 ms 1516 KB Output is correct
6 Correct 416 ms 1536 KB Output is correct
7 Correct 405 ms 1608 KB Output is correct
8 Correct 404 ms 1516 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 18 ms 1132 KB Output is correct
3 Correct 81 ms 1132 KB Output is correct
4 Correct 200 ms 1388 KB Output is correct
5 Correct 407 ms 1516 KB Output is correct
6 Correct 425 ms 1516 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 12 ms 1132 KB Output is correct
4 Correct 23 ms 1132 KB Output is correct
5 Correct 197 ms 1260 KB Output is correct
6 Correct 204 ms 1388 KB Output is correct
7 Correct 211 ms 1388 KB Output is correct
8 Correct 261 ms 1260 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 11 ms 1132 KB Output is correct
12 Correct 11 ms 1132 KB Output is correct
13 Correct 91 ms 1260 KB Output is correct
14 Correct 90 ms 1260 KB Output is correct
15 Correct 203 ms 1260 KB Output is correct
16 Correct 200 ms 1388 KB Output is correct
17 Correct 195 ms 1260 KB Output is correct
18 Correct 4 ms 1132 KB Output is correct
19 Correct 6 ms 1172 KB Output is correct
20 Correct 19 ms 1132 KB Output is correct
21 Correct 19 ms 1132 KB Output is correct
22 Correct 37 ms 1260 KB Output is correct
23 Correct 37 ms 1132 KB Output is correct
24 Correct 55 ms 1260 KB Output is correct
25 Correct 53 ms 1132 KB Output is correct
26 Correct 3 ms 1132 KB Output is correct
27 Correct 3 ms 1132 KB Output is correct
28 Correct 154 ms 1388 KB Output is correct
29 Correct 193 ms 1260 KB Output is correct
30 Correct 380 ms 1516 KB Output is correct
31 Correct 416 ms 1536 KB Output is correct
32 Correct 405 ms 1608 KB Output is correct
33 Correct 404 ms 1516 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 18 ms 1132 KB Output is correct
36 Correct 81 ms 1132 KB Output is correct
37 Correct 200 ms 1388 KB Output is correct
38 Correct 407 ms 1516 KB Output is correct
39 Correct 425 ms 1516 KB Output is correct
40 Correct 103 ms 1260 KB Output is correct
41 Correct 219 ms 1388 KB Output is correct
42 Correct 308 ms 1516 KB Output is correct
43 Correct 432 ms 1388 KB Output is correct
44 Correct 411 ms 1388 KB Output is correct
45 Correct 411 ms 1644 KB Output is correct
46 Correct 237 ms 1388 KB Output is correct
47 Correct 300 ms 1516 KB Output is correct
48 Correct 305 ms 1516 KB Output is correct