oj.uz

Submission #580402

# Submission time Handle Problem Language Result Execution time Memory
580402 2022-06-21T07:59:25 Z amunduzbaev Cloud Computing (CEOI18_clo) C++17
100 / 100
 2629 ms 3640 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;
#define int ll

const int inf = -1e18;
const int N = 2005;
const int M = 51;
const int H = 103;
int dp[2][N][H];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	vector<ar<int, 3>> a(n);
	for(int i=0;i<n;i++){
		cin>>a[i][0]>>a[i][1]>>a[i][2];
	} sort(a.begin(), a.end(), [&](auto& a, auto& b){
		return a[1] < b[1];
	});
	int m; cin>>m;
	vector<ar<int, 3>> b(m);
	for(int i=0;i<m;i++){
		cin>>b[i][0]>>b[i][1]>>b[i][2];
	} sort(b.begin(), b.end(), [&](auto& a, auto& b){
		return a[1] < b[1];
	});
	
	memset(dp, -63, sizeof dp);
	dp[0][0][M] = 0;
	
	for(int i=0;i<=n;i++){
		int cur = i & 1, nxt = !cur;
		memset(dp[nxt], -63, sizeof dp[nxt]);
		for(int j=0;j<=m;j++){
			if(dp[cur][j][M] > inf){
				//~ cout<<i<<" "<<j<<" "<<0<<" "<<dp[cur][j][M]<<endl;
				if(i < n) dp[nxt][j][M] = max(dp[nxt][j][M], dp[cur][j][M]);
				if(j < m) dp[cur][j + 1][M] = max(dp[cur][j + 1][M], dp[cur][j][M]);
				if(i < n){
					//~ cout<<dp[cur][j][M + a[i][0]]<<endl;
					dp[cur][j][M + a[i][0]] = max(dp[cur][j][M + a[i][0]], dp[cur][j][M] - a[i][2]);
					//~ cout<<dp[cur][j][M + a[i][0]]<<endl;
				} if(j < m){
					assert(j < m);
					dp[cur][j][M - b[j][0]] = max(dp[cur][j][M - b[j][0]], dp[cur][j][M] + b[j][2]);
				}
			}
			
			for(int k=-M;k<=M;k++){
				if(dp[cur][j][k + M] <= inf || !k) continue;
				//~ cout<<i<<" "<<j<<" "<<k<<" "<<dp[cur][j][k + M]<<endl;
				if(k < 0 && i < n){
					assert(j < m);
					dp[nxt][j][k + M] = max(dp[nxt][j][k + M], dp[cur][j][k + M]);
					if(b[j][1] <= a[i][1]){
						if(k + a[i][0] < 0){
							dp[nxt][j][k + a[i][0] + M] = max(dp[nxt][j][k + a[i][0] + M], dp[cur][j][k + M] - a[i][2]);
						} else if(k + a[i][0] == 0){
							dp[nxt][j + 1][M] = max(dp[nxt][j + 1][M], dp[cur][j][k + M] - a[i][2]);
						} else {
							dp[cur][j + 1][k + a[i][0] + M] = max(dp[cur][j + 1][k + a[i][0] + M], dp[cur][j][k + M] - a[i][2]);
						}
					}
				} if(k > 0){
					assert(i < n);
					if(j < m) dp[cur][j + 1][k + M] = max(dp[cur][j + 1][k + M], dp[cur][j][k + M]);
					dp[nxt][j][M] = max(dp[nxt][j][M], dp[cur][j][k + M]);
					if(j < m && b[j][1] <= a[i][1]){
						if(k - b[j][0] < 0){
							//~ cout<<i + 1<<" "<<j<<" "<<k - b[j][0]<<endl;
							dp[nxt][j][k - b[j][0] + M] = max(dp[nxt][j][k - b[j][0] + M], dp[cur][j][k + M] + b[j][2]);
						} else if(k - b[j][0] == 0){
							dp[nxt][j + 1][M] = max(dp[nxt][j + 1][M], dp[cur][j][k + M] + b[j][2]);
						} else {
							dp[cur][j + 1][k - b[j][0] + M] = max(dp[cur][j + 1][k - b[j][0] + M], dp[cur][j][k + M] + b[j][2]);
						}
					}
				} 
			}
			
		}
	}
	
	int res = inf;
	for(int i=M;i<H;i++){
		res = max(res, dp[n&1][m][i]);
	}
	
	cout<<res<<"\n";
}

/*

5
6 1 6
4 1 12
5 1 5
4 1 9
6 1 12
4
6 1 9
5 1 12
6 1 6
5 1 7

3
6 1 8
6 1 5
6 1 11
3
6 1 9
6 1 4
4 1 12

*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 12 ms 3600 KB Output is correct
6 Correct 8 ms 3600 KB Output is correct
7 Correct 17 ms 3604 KB Output is correct
8 Correct 17 ms 3604 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 3 ms 3540 KB Output is correct
3 Correct 6 ms 3540 KB Output is correct
4 Correct 8 ms 3540 KB Output is correct
5 Correct 44 ms 3540 KB Output is correct
6 Correct 42 ms 3540 KB Output is correct
7 Correct 111 ms 3584 KB Output is correct
8 Correct 116 ms 3596 KB Output is correct
9 Correct 95 ms 3540 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 6 ms 3540 KB Output is correct
4 Correct 8 ms 3560 KB Output is correct
5 Correct 18 ms 3560 KB Output is correct
6 Correct 19 ms 3564 KB Output is correct
7 Correct 22 ms 3572 KB Output is correct
8 Correct 22 ms 3540 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 74 ms 3568 KB Output is correct
4 Correct 10 ms 3540 KB Output is correct
5 Correct 1596 ms 3628 KB Output is correct
6 Correct 2561 ms 3632 KB Output is correct
7 Correct 2553 ms 3628 KB Output is correct
8 Correct 2459 ms 3624 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 6 ms 3552 KB Output is correct
3 Correct 68 ms 3568 KB Output is correct
4 Correct 237 ms 3584 KB Output is correct
5 Correct 1819 ms 3640 KB Output is correct
6 Correct 2629 ms 3628 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 3 ms 3540 KB Output is correct
5 Correct 12 ms 3600 KB Output is correct
6 Correct 8 ms 3600 KB Output is correct
7 Correct 17 ms 3604 KB Output is correct
8 Correct 17 ms 3604 KB Output is correct
9 Correct 2 ms 3540 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct
11 Correct 6 ms 3540 KB Output is correct
12 Correct 8 ms 3540 KB Output is correct
13 Correct 44 ms 3540 KB Output is correct
14 Correct 42 ms 3540 KB Output is correct
15 Correct 111 ms 3584 KB Output is correct
16 Correct 116 ms 3596 KB Output is correct
17 Correct 95 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 6 ms 3540 KB Output is correct
21 Correct 8 ms 3560 KB Output is correct
22 Correct 18 ms 3560 KB Output is correct
23 Correct 19 ms 3564 KB Output is correct
24 Correct 22 ms 3572 KB Output is correct
25 Correct 22 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 74 ms 3568 KB Output is correct
29 Correct 10 ms 3540 KB Output is correct
30 Correct 1596 ms 3628 KB Output is correct
31 Correct 2561 ms 3632 KB Output is correct
32 Correct 2553 ms 3628 KB Output is correct
33 Correct 2459 ms 3624 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 6 ms 3552 KB Output is correct
36 Correct 68 ms 3568 KB Output is correct
37 Correct 237 ms 3584 KB Output is correct
38 Correct 1819 ms 3640 KB Output is correct
39 Correct 2629 ms 3628 KB Output is correct
40 Correct 149 ms 3564 KB Output is correct
41 Correct 426 ms 3588 KB Output is correct
42 Correct 416 ms 3608 KB Output is correct
43 Correct 639 ms 3624 KB Output is correct
44 Correct 640 ms 3624 KB Output is correct
45 Correct 700 ms 3628 KB Output is correct
46 Correct 242 ms 3584 KB Output is correct
47 Correct 369 ms 3540 KB Output is correct
48 Correct 390 ms 3604 KB Output is correct