oj.uz

Submission #947517

# Submission time Handle Problem Language Result Execution time Memory
947517 2024-03-16T10:30:53 Z Minbaev Cloud Computing (CEOI18_clo) C++17
100 / 100
 285 ms 1624 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define int long long
#define s second
#define pii pair<int,int>

template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
 
const int N=1e6 + 5	;
const int inf = 1e18 + 7;
const int mod = 998244353;
 
int cnt = 0;
int n,m,k;

bool comp(array<int,4>a,array<int,4>b){	
	if(a[1] == b[1])return a[3] > b[3];
	return a[1] > b[1];
}

void solve(){
	
	cin >> n;
	
	vector<array<int,4>>v;
	
	for(int i = 1;i<=n;i++){
		int a,b,c,d;
		cin >>a >> b >> c;
		d = 1;
		v.pb({a,b,c,d});
	}
	
	cin >> m;
	
	for(int i = 1;i<=m;i++){
		int a,b,c,d;
		cin >> a >> b >> c;
		d = 0;
		v.pb({a,b,c,d});
	}
	
	sort(all(v),comp);
	
	vector<int>dp(100005,-inf);
	dp[0] = 0;
	//~ cout<<v[1][0]<<" "<<v[1][1]<<" "<<v[1][2]<<" "<<v[1][3]<<"\n";
	
	int cnt = 0;
	
	for(auto to:v){
		if(to[3] == 0){
			for(int i = 0;i + to[0] <=100000;i++){
				umax(dp[i],dp[i+to[0]]+to[2]);
			}
		}
		else {
			for(int i = 100000;i>=to[0];i--){
				umax(dp[i],dp[i-to[0]]-to[2]);
			}
		}
	}
	int ans = 0;
	
	for(int i = 0;i<=100000;i++){
		umax(ans, dp[i]);
	}
	
	cout<<ans<<"\n";
}
/*
 
*/
signed main()
{	
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt>>n;
	while(tt--)solve();
 
}

Compilation message

clo.cpp: In function 'void solve()':
clo.cpp:61:6: warning: unused variable 'cnt' [-Wunused-variable]
   61 |  int cnt = 0;
      |      ^~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 13 ms 1116 KB Output is correct
5 Correct 120 ms 1368 KB Output is correct
6 Correct 117 ms 1372 KB Output is correct
7 Correct 130 ms 1372 KB Output is correct
8 Correct 125 ms 1372 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 59 ms 1116 KB Output is correct
6 Correct 59 ms 1116 KB Output is correct
7 Correct 132 ms 1372 KB Output is correct
8 Correct 137 ms 1372 KB Output is correct
9 Correct 132 ms 1368 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 12 ms 1116 KB Output is correct
4 Correct 12 ms 1116 KB Output is correct
5 Correct 24 ms 1116 KB Output is correct
6 Correct 23 ms 1116 KB Output is correct
7 Correct 32 ms 1368 KB Output is correct
8 Correct 31 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 94 ms 1372 KB Output is correct
4 Correct 111 ms 1624 KB Output is correct
5 Correct 244 ms 1368 KB Output is correct
6 Correct 285 ms 1372 KB Output is correct
7 Correct 273 ms 1372 KB Output is correct
8 Correct 255 ms 1368 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 11 ms 1116 KB Output is correct
3 Correct 54 ms 1116 KB Output is correct
4 Correct 124 ms 1372 KB Output is correct
5 Correct 279 ms 1368 KB Output is correct
6 Correct 266 ms 1368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 13 ms 1116 KB Output is correct
5 Correct 120 ms 1368 KB Output is correct
6 Correct 117 ms 1372 KB Output is correct
7 Correct 130 ms 1372 KB Output is correct
8 Correct 125 ms 1372 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 7 ms 1116 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 59 ms 1116 KB Output is correct
14 Correct 59 ms 1116 KB Output is correct
15 Correct 132 ms 1372 KB Output is correct
16 Correct 137 ms 1372 KB Output is correct
17 Correct 132 ms 1368 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 12 ms 1116 KB Output is correct
21 Correct 12 ms 1116 KB Output is correct
22 Correct 24 ms 1116 KB Output is correct
23 Correct 23 ms 1116 KB Output is correct
24 Correct 32 ms 1368 KB Output is correct
25 Correct 31 ms 1116 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 94 ms 1372 KB Output is correct
29 Correct 111 ms 1624 KB Output is correct
30 Correct 244 ms 1368 KB Output is correct
31 Correct 285 ms 1372 KB Output is correct
32 Correct 273 ms 1372 KB Output is correct
33 Correct 255 ms 1368 KB Output is correct
34 Correct 1 ms 1368 KB Output is correct
35 Correct 11 ms 1116 KB Output is correct
36 Correct 54 ms 1116 KB Output is correct
37 Correct 124 ms 1372 KB Output is correct
38 Correct 279 ms 1368 KB Output is correct
39 Correct 266 ms 1368 KB Output is correct
40 Correct 64 ms 1112 KB Output is correct
41 Correct 124 ms 1368 KB Output is correct
42 Correct 185 ms 1372 KB Output is correct
43 Correct 263 ms 1372 KB Output is correct
44 Correct 253 ms 1372 KB Output is correct
45 Correct 265 ms 1372 KB Output is correct
46 Correct 122 ms 1372 KB Output is correct
47 Correct 185 ms 1368 KB Output is correct
48 Correct 182 ms 1372 KB Output is correct