oj.uz

Submission #617168

# Submission time Handle Problem Language Result Execution time Memory
617168 2022-08-01T09:19:04 Z FatihSolak Cloud Computing (CEOI18_clo) C++17
100 / 100
 371 ms 1528 KB 
#include <bits/stdc++.h>
#define N 2005
#define C 55
using namespace std;
void solve(){
	int n;
	cin >> n;
	map<int,vector<pair<int,int>>> events;
	int sum = 0;
	for(int i = 1;i<=n;i++){
		int c,f,v;
		cin >> c >> f >> v;
		sum += c;	
		events[-2*f - 1].push_back({c,v});
	}
	int m;
	cin >> m;
	for(int i = 1;i<=m;i++){
		int c,f,v;
		cin >> c >> f >> v;
		events[-2*f].push_back({c,v});
	}
	vector<long long> dp(sum+1,-2e18);
	dp[0] = 0;
	int nowsum = 0;
	for(auto c:events){
		//cout << -c.first << endl;
		for(auto u:c.second){
			//cout << u.first << " " << u.second << endl;
			int num = -c.first;
			if(num % 2){
				for(int i = nowsum;i>=0;i--){
					dp[i+u.first] = max(dp[i+u.first],dp[i] - u.second);
				}
				nowsum += u.first;
			}
			else{
				for(int i = 0;i<=nowsum;i++){
					if(i+u.first > sum)break;
					dp[i] = max(dp[i],dp[i+u.first] + u.second);
				}
			}
		}
	}
	long long ans = 0;
	for(int i = 0;i<=sum;i++){
		ans = max(ans,dp[i]);
	}
	cout << ans;
}	
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	#ifdef Local
		freopen("in.txt","r",stdin);
		freopen("out.txt","w",stdout);
	#endif
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	#ifdef Local
		cout << endl << fixed << setprecision(2) << 1000.0*clock()/CLOCKS_PER_SEC << " milliseconds";
	#endif
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 584 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 12 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 56 ms 980 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 84 ms 976 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 324 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 2 ms 328 KB Output is correct
5 Correct 179 ms 848 KB Output is correct
6 Correct 267 ms 1148 KB Output is correct
7 Correct 299 ms 1040 KB Output is correct
8 Correct 254 ms 1108 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 10 ms 596 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 179 ms 1488 KB Output is correct
6 Correct 262 ms 1108 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 508 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 584 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 12 ms 596 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 56 ms 980 KB Output is correct
16 Correct 6 ms 596 KB Output is correct
17 Correct 84 ms 976 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 2 ms 328 KB Output is correct
30 Correct 179 ms 848 KB Output is correct
31 Correct 267 ms 1148 KB Output is correct
32 Correct 299 ms 1040 KB Output is correct
33 Correct 254 ms 1108 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 10 ms 596 KB Output is correct
37 Correct 5 ms 460 KB Output is correct
38 Correct 179 ms 1488 KB Output is correct
39 Correct 262 ms 1108 KB Output is correct
40 Correct 12 ms 596 KB Output is correct
41 Correct 33 ms 724 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 371 ms 1364 KB Output is correct
44 Correct 313 ms 1360 KB Output is correct
45 Correct 292 ms 1528 KB Output is correct
46 Correct 4 ms 472 KB Output is correct
47 Correct 5 ms 596 KB Output is correct
48 Correct 7 ms 596 KB Output is correct