oj.uz

Submission #77314

# Submission time Handle Problem Language Result Execution time Memory
77314 2018-09-25T14:12:24 Z tmwilliamlin168 Cloud Computing (CEOI18_clo) C++14
100 / 100
 1289 ms 3636 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int mxN=2e3, mxC=50;
int n, m, ci, fi, vi;
ll dp[mxN+1][mxC*2+1], ans;
vector<array<int, 3>> v1, v2;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i=0; i<n; ++i) {
		cin >> ci >> fi >> vi;
		v1.push_back({fi, ci, vi});
	}
	sort(v1.begin(), v1.end(), greater<array<int, 3>>());
	cin >> m;
	for(int i=0; i<m; ++i) {
		cin >> ci >> fi >> vi;
		v2.push_back({fi, ci, vi});
	}
	sort(v2.begin(), v2.end(), greater<array<int, 3>>());
	memset(dp, 0x96, sizeof(dp));
	dp[0][50]=0;
	for(int i=0; i<=n; ++i) {
		for(int j=0; j<=m; ++j) {
			for(int k=2*mxC; k>=0; --k) {
				if(k<mxC&&i<n&&j&&v1[i][0]>=v2[j-1][0])
					dp[j][k+v1[i][1]]=max(dp[j][k]-v1[i][2], dp[j][k+v1[i][1]]);
				if(k>=mxC&&j<m) {
					dp[j+1][k-v2[j][1]]=max(dp[j][k]+v2[j][2], dp[j+1][k-v2[j][1]]);
					dp[j+1][k]=max(dp[j][k], dp[j+1][k]);
				}
			}
		}
	}
	for(int i=mxC; i<=2*mxC; ++i)
		ans=max(dp[m][i], ans);//, cout << i << " " << dp[m][i] << endl;
	cout << ans;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 2048 KB Output is correct
3 Correct 4 ms 2048 KB Output is correct
4 Correct 4 ms 2092 KB Output is correct
5 Correct 13 ms 2312 KB Output is correct
6 Correct 14 ms 2312 KB Output is correct
7 Correct 15 ms 2336 KB Output is correct
8 Correct 13 ms 2572 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2572 KB Output is correct
2 Correct 3 ms 2572 KB Output is correct
3 Correct 4 ms 2572 KB Output is correct
4 Correct 4 ms 2572 KB Output is correct
5 Correct 7 ms 2572 KB Output is correct
6 Correct 6 ms 2572 KB Output is correct
7 Correct 19 ms 2572 KB Output is correct
8 Correct 13 ms 2608 KB Output is correct
9 Correct 14 ms 2608 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2608 KB Output is correct
2 Correct 3 ms 2684 KB Output is correct
3 Correct 5 ms 2684 KB Output is correct
4 Correct 5 ms 2684 KB Output is correct
5 Correct 13 ms 2684 KB Output is correct
6 Correct 13 ms 2684 KB Output is correct
7 Correct 22 ms 2684 KB Output is correct
8 Correct 21 ms 2684 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2684 KB Output is correct
2 Correct 3 ms 2684 KB Output is correct
3 Correct 8 ms 2688 KB Output is correct
4 Correct 12 ms 2688 KB Output is correct
5 Correct 1095 ms 2824 KB Output is correct
6 Correct 1249 ms 2964 KB Output is correct
7 Correct 1246 ms 2964 KB Output is correct
8 Correct 1219 ms 3052 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3052 KB Output is correct
2 Correct 4 ms 3052 KB Output is correct
3 Correct 43 ms 3052 KB Output is correct
4 Correct 301 ms 3052 KB Output is correct
5 Correct 1074 ms 3120 KB Output is correct
6 Correct 1241 ms 3152 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 2048 KB Output is correct
3 Correct 4 ms 2048 KB Output is correct
4 Correct 4 ms 2092 KB Output is correct
5 Correct 13 ms 2312 KB Output is correct
6 Correct 14 ms 2312 KB Output is correct
7 Correct 15 ms 2336 KB Output is correct
8 Correct 13 ms 2572 KB Output is correct
9 Correct 3 ms 2572 KB Output is correct
10 Correct 3 ms 2572 KB Output is correct
11 Correct 4 ms 2572 KB Output is correct
12 Correct 4 ms 2572 KB Output is correct
13 Correct 7 ms 2572 KB Output is correct
14 Correct 6 ms 2572 KB Output is correct
15 Correct 19 ms 2572 KB Output is correct
16 Correct 13 ms 2608 KB Output is correct
17 Correct 14 ms 2608 KB Output is correct
18 Correct 3 ms 2608 KB Output is correct
19 Correct 3 ms 2684 KB Output is correct
20 Correct 5 ms 2684 KB Output is correct
21 Correct 5 ms 2684 KB Output is correct
22 Correct 13 ms 2684 KB Output is correct
23 Correct 13 ms 2684 KB Output is correct
24 Correct 22 ms 2684 KB Output is correct
25 Correct 21 ms 2684 KB Output is correct
26 Correct 4 ms 2684 KB Output is correct
27 Correct 3 ms 2684 KB Output is correct
28 Correct 8 ms 2688 KB Output is correct
29 Correct 12 ms 2688 KB Output is correct
30 Correct 1095 ms 2824 KB Output is correct
31 Correct 1249 ms 2964 KB Output is correct
32 Correct 1246 ms 2964 KB Output is correct
33 Correct 1219 ms 3052 KB Output is correct
34 Correct 3 ms 3052 KB Output is correct
35 Correct 4 ms 3052 KB Output is correct
36 Correct 43 ms 3052 KB Output is correct
37 Correct 301 ms 3052 KB Output is correct
38 Correct 1074 ms 3120 KB Output is correct
39 Correct 1241 ms 3152 KB Output is correct
40 Correct 73 ms 3152 KB Output is correct
41 Correct 277 ms 3172 KB Output is correct
42 Correct 648 ms 3196 KB Output is correct
43 Correct 1235 ms 3364 KB Output is correct
44 Correct 1289 ms 3364 KB Output is correct
45 Correct 1114 ms 3480 KB Output is correct
46 Correct 295 ms 3484 KB Output is correct
47 Correct 653 ms 3636 KB Output is correct
48 Correct 614 ms 3636 KB Output is correct