oj.uz

Submission #599706

# Submission time Handle Problem Language Result Execution time Memory
599706 2022-07-19T19:15:50 Z CSQ31 Cloud Computing (CEOI18_clo) C++17
100 / 100
 528 ms 1556 KB 
#pragma GCC optimization ("O3")
#include <bits/stdc++.h>
using namespace std;
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
typedef long long int ll;
const int MAXN = 1e5+5;
ll dp1[MAXN];
int c[2][2000],f[2][2000],v[2][2000];
vector<int>buy[4000],sell[4000];
int main()
{
	owo
	int n;
	cin>>n;
	vector<int>crd;
	bool ok = 1;
	int mx = 0;
	for(int i=0;i<n;i++){
		cin>>c[0][i]>>f[0][i]>>v[0][i];
		crd.push_back(f[0][i]);
		mx = max(c[0][i],mx);
		if(f[0][i] != 1)ok = 0;
	}
	int m;cin>>m;
	for(int i=0;i<m;i++){
		cin>>c[1][i]>>f[1][i]>>v[1][i];
		crd.push_back(f[1][i]);
		mx = max(c[1][i],mx);
		if(f[1][i] != 1)ok = 0;
	}
	int mxx = mx*n;
	for(int i=1;i<=mxx;i++)dp1[i] = -1e13;
	dp1[0] = 0;
	if(ok){
		for(int i=0;i<n;i++){
			for(int j=mxx;j>=c[0][i];j--){
				if(dp1[j-c[0][i]] != -1e13)dp1[j] = max(dp1[j],dp1[j-c[0][i]] - v[0][i]);
				
			}
		}
		for(int i=0;i<m;i++){
			for(int j=0;j + c[1][i]<=mxx;j++){
				if(dp1[j + c[1][i]] != -1e13)dp1[j] = max(dp1[j + c[1][i]] + v[1][i],dp1[j]);
			}	
			
		}
		ll ans = 0;
		for(int i=0;i<=mxx;i++)ans = max(dp1[i],ans);
		cout<<ans<<'\n';
		
	}else{
		sort(crd.begin(),crd.end());
	    crd.resize(unique(crd.begin(),crd.end()) - crd.begin());
		for(int i=0;i<n;i++){
			f[0][i] = lower_bound(crd.begin(),crd.end(),f[0][i]) - crd.begin();
			buy[f[0][i]].push_back(i);
		}
		for(int i=0;i<m;i++){
			f[1][i] = lower_bound(crd.begin(),crd.end(),f[1][i]) - crd.begin();
			sell[f[1][i]].push_back(i);
			
		}
		for(int i=3999;i>=0;i--){
			if(buy[i].empty() && sell[i].empty())continue;
			for(int x:buy[i]){
				for(int i=mxx;i>=c[0][x];i--){
					if(dp1[i - c[0][x]] != -1e13)dp1[i] = max(dp1[i-c[0][x]] - v[0][x],dp1[i]);
				}	
			}
			for(int x:sell[i]){
				for(int i=0;i + c[1][x]<=mxx;i++){
					if(dp1[i + c[1][x]] != -1e13)dp1[i] = max(dp1[i + c[1][x]] + v[1][x],dp1[i]);
				}	
			}
		}
		ll ans = 0;
		for(int i=0;i<=mxx;i++)ans = max(ans,dp1[i]);
			cout<<ans<<'\n';
	}
	
	
	
}

Compilation message

clo.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      |

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 520 KB Output is correct
2 Correct 1 ms 536 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 54 ms 852 KB Output is correct
6 Correct 37 ms 852 KB Output is correct
7 Correct 238 ms 1428 KB Output is correct
8 Correct 196 ms 1308 KB Output is correct
9 Correct 231 ms 1320 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 121 ms 1136 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 433 ms 1408 KB Output is correct
6 Correct 528 ms 1396 KB Output is correct
7 Correct 510 ms 1416 KB Output is correct
8 Correct 508 ms 1376 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 516 KB Output is correct
3 Correct 29 ms 724 KB Output is correct
4 Correct 13 ms 664 KB Output is correct
5 Correct 474 ms 1516 KB Output is correct
6 Correct 523 ms 1492 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 660 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 520 KB Output is correct
10 Correct 1 ms 536 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 54 ms 852 KB Output is correct
14 Correct 37 ms 852 KB Output is correct
15 Correct 238 ms 1428 KB Output is correct
16 Correct 196 ms 1308 KB Output is correct
17 Correct 231 ms 1320 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 520 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 516 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 520 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 121 ms 1136 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 433 ms 1408 KB Output is correct
31 Correct 528 ms 1396 KB Output is correct
32 Correct 510 ms 1416 KB Output is correct
33 Correct 508 ms 1376 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 516 KB Output is correct
36 Correct 29 ms 724 KB Output is correct
37 Correct 13 ms 664 KB Output is correct
38 Correct 474 ms 1516 KB Output is correct
39 Correct 523 ms 1492 KB Output is correct
40 Correct 32 ms 724 KB Output is correct
41 Correct 89 ms 852 KB Output is correct
42 Correct 8 ms 728 KB Output is correct
43 Correct 501 ms 1484 KB Output is correct
44 Correct 488 ms 1364 KB Output is correct
45 Correct 471 ms 1556 KB Output is correct
46 Correct 4 ms 596 KB Output is correct
47 Correct 9 ms 728 KB Output is correct
48 Correct 8 ms 724 KB Output is correct