oj.uz

Submission #444597

# Submission time Handle Problem Language Result Execution time Memory
444597 2021-07-14T10:44:42 Z keta_tsimakuridze Cloud Computing (CEOI18_clo) C++14
100 / 100
 325 ms 1228 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int N=4005,mod=1e9+7;
ll dp[N*25];
int n,m;
pair< pair<int,int> ,pair<int,int > > p[N];
 main(){
 	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n;
	int sum = 0;
	for(int i=1;i<=n;i++) {
		cin >> p[i].s.f >>p[i].f.f>>p[i].s.s;
		p[i].f.s = 1;
		sum += p[i].s.f;
	}
	for(int i=1;i<=sum;i++) dp[i] = -1e14;
	sum = 0;
	cin>>m;
	for(int i=1+n;i<=n+m;i++) {
		cin>>p[i].s.f>>p[i].f.f>>p[i].s.s;
		p[i].f.s = 0;
	}
	
	n+=m;
	
	sort(p+1,p+n+1);
	reverse(p+1,p+n+1);
	for(int i=1; i<=n; i++) {
		if(p[i].f.s) {
			for(int j = sum; j >= 0; j--) {
				dp[j + p[i].s.f] = max(dp[j] - p[i].s.s,dp[j + p[i].s.f]);
			}
			sum += p[i].s.f;
			continue;
		}
		for(int j = p[i].s.f; j <= sum; j++) {
			dp[j - p[i].s.f] = max(dp[j] + p[i].s.s,dp[j - p[i].s.f]);
		}
	}
	ll ans = 0;
	for(int i=0; i<=sum; i++) ans = max(ans,dp[i]);
	cout<<ans;
}

Compilation message

clo.cpp:10:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   10 |  main(){
      |  ^~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 352 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 13 ms 540 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 56 ms 788 KB Output is correct
8 Correct 10 ms 460 KB Output is correct
9 Correct 105 ms 1024 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 8 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 162 ms 816 KB Output is correct
6 Correct 283 ms 1116 KB Output is correct
7 Correct 281 ms 1120 KB Output is correct
8 Correct 310 ms 1100 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 11 ms 460 KB Output is correct
4 Correct 7 ms 332 KB Output is correct
5 Correct 183 ms 1112 KB Output is correct
6 Correct 292 ms 1100 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 352 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 13 ms 540 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 56 ms 788 KB Output is correct
16 Correct 10 ms 460 KB Output is correct
17 Correct 105 ms 1024 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 8 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 162 ms 816 KB Output is correct
31 Correct 283 ms 1116 KB Output is correct
32 Correct 281 ms 1120 KB Output is correct
33 Correct 310 ms 1100 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 11 ms 460 KB Output is correct
37 Correct 7 ms 332 KB Output is correct
38 Correct 183 ms 1112 KB Output is correct
39 Correct 292 ms 1100 KB Output is correct
40 Correct 13 ms 460 KB Output is correct
41 Correct 35 ms 620 KB Output is correct
42 Correct 4 ms 332 KB Output is correct
43 Correct 325 ms 1192 KB Output is correct
44 Correct 312 ms 1196 KB Output is correct
45 Correct 208 ms 1228 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 4 ms 332 KB Output is correct
48 Correct 4 ms 332 KB Output is correct