oj.uz

Submission #455263

# Submission time Handle Problem Language Result Execution time Memory
455263 2021-08-05T18:26:24 Z mnair797 Cloud Computing (CEOI18_clo) C++14
100 / 100
 533 ms 1484 KB 
#include <bits/stdc++.h>
 
typedef long long ll;
 
const ll maxn = 4e3 + 1e2;
const ll maxsum = 1e5 + 1e2;
ll n, m;
ll val[maxn];
std::vector<int> v[maxn];
ll dp[maxsum];
 
int main(){
    std::ios::sync_with_stdio(false);
	    
	    std::cin >> n;
		    
		    for(ll i = 0; i < n; i++){
			        v[i].resize(3);
					        std::cin >> v[i][1] >> v[i][0] >> v[i][2];
							        v[i][2] *= -1;
									    }
			    
			    std::cin >> m;
				    
				    for(ll i = 0; i < m; i++){
					        v[n + i].resize(3);
							        std::cin >> v[n + i][1] >> v[n + i][0] >> v[n + i][2];
									        v[n + i][1] *= -1;
											    }
 
					    std::stable_sort(v, v + n + m, std::greater<std::vector<int>>());
						    
						    for(int i = n + m - 1; i >= 0; i--){
							        if(v[i][2] < 0){
									            for(int j = 0; j <= 100000; j++){               
												                if(j + v[i][1] >= 0 and j + v[i][1] <= 100000){
																                    dp[j] = std::max(dp[j], dp[j + v[i][1]] + v[i][2]);
																					                }
																            }
												        } else {
														            for(int j = 100000; j >= 0; j--){
																	                if(j + v[i][1] >= 0 and j + v[i][1] <= 100000){
																					                    dp[j] = std::max(dp[j], dp[j + v[i][1]] + v[i][2]);
																										                }
																					            }
																	        }
									    }    
 
							    std::cout << dp[0] << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1192 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 14 ms 1204 KB Output is correct
4 Correct 26 ms 1212 KB Output is correct
5 Correct 234 ms 1332 KB Output is correct
6 Correct 237 ms 1320 KB Output is correct
7 Correct 268 ms 1336 KB Output is correct
8 Correct 243 ms 1332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 2 ms 1100 KB Output is correct
3 Correct 14 ms 1100 KB Output is correct
4 Correct 14 ms 1100 KB Output is correct
5 Correct 110 ms 1252 KB Output is correct
6 Correct 112 ms 1248 KB Output is correct
7 Correct 260 ms 1356 KB Output is correct
8 Correct 279 ms 1336 KB Output is correct
9 Correct 234 ms 1228 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1100 KB Output is correct
2 Correct 5 ms 1204 KB Output is correct
3 Correct 23 ms 1208 KB Output is correct
4 Correct 23 ms 1212 KB Output is correct
5 Correct 44 ms 1100 KB Output is correct
6 Correct 45 ms 1100 KB Output is correct
7 Correct 61 ms 1228 KB Output is correct
8 Correct 61 ms 1228 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1100 KB Output is correct
2 Correct 3 ms 1100 KB Output is correct
3 Correct 208 ms 1228 KB Output is correct
4 Correct 218 ms 1228 KB Output is correct
5 Correct 449 ms 1436 KB Output is correct
6 Correct 508 ms 1448 KB Output is correct
7 Correct 482 ms 1476 KB Output is correct
8 Correct 529 ms 1444 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 20 ms 1228 KB Output is correct
3 Correct 99 ms 1236 KB Output is correct
4 Correct 246 ms 1312 KB Output is correct
5 Correct 533 ms 1456 KB Output is correct
6 Correct 502 ms 1428 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1192 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 14 ms 1204 KB Output is correct
4 Correct 26 ms 1212 KB Output is correct
5 Correct 234 ms 1332 KB Output is correct
6 Correct 237 ms 1320 KB Output is correct
7 Correct 268 ms 1336 KB Output is correct
8 Correct 243 ms 1332 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 14 ms 1100 KB Output is correct
12 Correct 14 ms 1100 KB Output is correct
13 Correct 110 ms 1252 KB Output is correct
14 Correct 112 ms 1248 KB Output is correct
15 Correct 260 ms 1356 KB Output is correct
16 Correct 279 ms 1336 KB Output is correct
17 Correct 234 ms 1228 KB Output is correct
18 Correct 5 ms 1100 KB Output is correct
19 Correct 5 ms 1204 KB Output is correct
20 Correct 23 ms 1208 KB Output is correct
21 Correct 23 ms 1212 KB Output is correct
22 Correct 44 ms 1100 KB Output is correct
23 Correct 45 ms 1100 KB Output is correct
24 Correct 61 ms 1228 KB Output is correct
25 Correct 61 ms 1228 KB Output is correct
26 Correct 3 ms 1100 KB Output is correct
27 Correct 3 ms 1100 KB Output is correct
28 Correct 208 ms 1228 KB Output is correct
29 Correct 218 ms 1228 KB Output is correct
30 Correct 449 ms 1436 KB Output is correct
31 Correct 508 ms 1448 KB Output is correct
32 Correct 482 ms 1476 KB Output is correct
33 Correct 529 ms 1444 KB Output is correct
34 Correct 2 ms 1100 KB Output is correct
35 Correct 20 ms 1228 KB Output is correct
36 Correct 99 ms 1236 KB Output is correct
37 Correct 246 ms 1312 KB Output is correct
38 Correct 533 ms 1456 KB Output is correct
39 Correct 502 ms 1428 KB Output is correct
40 Correct 131 ms 1252 KB Output is correct
41 Correct 234 ms 1304 KB Output is correct
42 Correct 393 ms 1380 KB Output is correct
43 Correct 482 ms 1456 KB Output is correct
44 Correct 484 ms 1460 KB Output is correct
45 Correct 480 ms 1484 KB Output is correct
46 Correct 245 ms 1312 KB Output is correct
47 Correct 357 ms 1388 KB Output is correct
48 Correct 374 ms 1476 KB Output is correct