Submission #362696

# Submission time Handle Problem Language Result Execution time Memory
362696 2021-02-04T06:32:23 Z wind_reaper Cloud Computing (CEOI18_clo) C++17
100 / 100
476 ms 1408 KB
#include <bits/stdc++.h>

using namespace std;

int32_t main(){
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL); 
	
	int n;
	cin >> n; 

	vector<array<int, 4>> o; 

	for(int i = 0; i < n; i++){
		int c, f, v;
		cin >> c >> f >> v;
		o.push_back({f, c, v, 0}); 
	}
	
	int m;
	cin >> m; 

	for(int i = 0; i < m; i++){
		int c, f, v;
		cin >> c >> f >> v;
		o.push_back({f, c, v, 1}); 
	}

	sort(o.begin(), o.end(), [](array<int, 4> a, array<int, 4> b){
		if(a[0] == b[0]){
			if(a[3] < b[3])
				return true; 
		}
		if(a[0] > b[0])
			return true; 
		return false;
	}); 

	vector<int64_t> dp(100001, -1e18);
	dp[0] = 0; 
	for(auto& [f, c, v, w] : o){
		if(w == 0){
			for(int i = 100000 - c; i >= 0; --i)
				dp[i+c] = max(dp[i+c], dp[i] - int64_t(v));
		}	
		else{
			for(int i = c; i < 100001; i++)
				dp[i-c] = max(dp[i-c], dp[i] + int64_t(v));
		}
	}

	int64_t ans = 0; 

	for(int i = 0; i < 100001; i++)
		ans = max(ans, dp[i]);

	cout << ans << '\n';
	return 0; 
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 13 ms 1132 KB Output is correct
4 Correct 23 ms 1132 KB Output is correct
5 Correct 230 ms 1260 KB Output is correct
6 Correct 204 ms 1260 KB Output is correct
7 Correct 219 ms 1260 KB Output is correct
8 Correct 213 ms 1280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 2 ms 1132 KB Output is correct
3 Correct 12 ms 1132 KB Output is correct
4 Correct 12 ms 1132 KB Output is correct
5 Correct 97 ms 1132 KB Output is correct
6 Correct 97 ms 1132 KB Output is correct
7 Correct 215 ms 1260 KB Output is correct
8 Correct 211 ms 1260 KB Output is correct
9 Correct 232 ms 1132 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 1132 KB Output is correct
2 Correct 4 ms 1132 KB Output is correct
3 Correct 27 ms 1132 KB Output is correct
4 Correct 20 ms 1132 KB Output is correct
5 Correct 39 ms 1132 KB Output is correct
6 Correct 39 ms 1132 KB Output is correct
7 Correct 54 ms 1132 KB Output is correct
8 Correct 56 ms 1132 KB Output is correct
# 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 175 ms 1132 KB Output is correct
4 Correct 191 ms 1132 KB Output is correct
5 Correct 395 ms 1260 KB Output is correct
6 Correct 437 ms 1260 KB Output is correct
7 Correct 422 ms 1260 KB Output is correct
8 Correct 417 ms 1408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1260 KB Output is correct
2 Correct 18 ms 1132 KB Output is correct
3 Correct 90 ms 1132 KB Output is correct
4 Correct 211 ms 1260 KB Output is correct
5 Correct 425 ms 1260 KB Output is correct
6 Correct 450 ms 1388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 13 ms 1132 KB Output is correct
4 Correct 23 ms 1132 KB Output is correct
5 Correct 230 ms 1260 KB Output is correct
6 Correct 204 ms 1260 KB Output is correct
7 Correct 219 ms 1260 KB Output is correct
8 Correct 213 ms 1280 KB Output is correct
9 Correct 2 ms 1132 KB Output is correct
10 Correct 2 ms 1132 KB Output is correct
11 Correct 12 ms 1132 KB Output is correct
12 Correct 12 ms 1132 KB Output is correct
13 Correct 97 ms 1132 KB Output is correct
14 Correct 97 ms 1132 KB Output is correct
15 Correct 215 ms 1260 KB Output is correct
16 Correct 211 ms 1260 KB Output is correct
17 Correct 232 ms 1132 KB Output is correct
18 Correct 4 ms 1132 KB Output is correct
19 Correct 4 ms 1132 KB Output is correct
20 Correct 27 ms 1132 KB Output is correct
21 Correct 20 ms 1132 KB Output is correct
22 Correct 39 ms 1132 KB Output is correct
23 Correct 39 ms 1132 KB Output is correct
24 Correct 54 ms 1132 KB Output is correct
25 Correct 56 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 175 ms 1132 KB Output is correct
29 Correct 191 ms 1132 KB Output is correct
30 Correct 395 ms 1260 KB Output is correct
31 Correct 437 ms 1260 KB Output is correct
32 Correct 422 ms 1260 KB Output is correct
33 Correct 417 ms 1408 KB Output is correct
34 Correct 2 ms 1260 KB Output is correct
35 Correct 18 ms 1132 KB Output is correct
36 Correct 90 ms 1132 KB Output is correct
37 Correct 211 ms 1260 KB Output is correct
38 Correct 425 ms 1260 KB Output is correct
39 Correct 450 ms 1388 KB Output is correct
40 Correct 112 ms 1132 KB Output is correct
41 Correct 216 ms 1260 KB Output is correct
42 Correct 334 ms 1260 KB Output is correct
43 Correct 428 ms 1260 KB Output is correct
44 Correct 437 ms 1260 KB Output is correct
45 Correct 476 ms 1388 KB Output is correct
46 Correct 209 ms 1260 KB Output is correct
47 Correct 323 ms 1260 KB Output is correct
48 Correct 309 ms 1260 KB Output is correct