제출 #1313427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1313427		m.zeeshanrashid	Cloud Computing (CEOI18_clo)	C++20	100 / 100	1160 ms	6916 KiB

clo

// #ifdef __AVX2__
// #pragma GCC target "avx2"
// #endif
// #pragma GCC optimize "O3"
// #pragma GCC optimize "unroll-loops"
#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 int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=4e3+5;

int kn[2][100*N];

int iter=1,itera=1;
void solve(){
	int n,m;
	cin>>n;
	vec<vec<int>>dea;
	for(int i=0;i<n;i++){
		int a,b,c;
		cin>>a>>b>>c;
		dea.append({b,a,-c});
	}
	cin>>m;
	for(int i=0;i<m;i++){
		int a,b,c;
		cin>>a>>b>>c;
		dea.append({b,-a,c});
	}
	sort(rall(dea));
	for(int i=1;i<N*100;i++) kn[0][i]=kn[1][i]=-1e18;
	// int g;
	// cin>>g;
	for(int i=0;i<n+m;i++){
		int ra=dea[i][0],co=dea[i][1],pr=dea[i][2];
		// cout<<pr<<endl;
		for(int c=0;c<=n*50;c++){
			kn[1][c]=kn[0][c];
			if(c-co>=0) kn[1][c]=max(kn[1][c],kn[0][c-co]+pr);
		}
		swap(kn[0],kn[1]);
	}
	int ans=0;
	for(auto i:kn[0]) ans=max(ans,i);
	cout<<ans<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

• Subtask 1: 18 / 18
• Subtask 2: 18 / 18
• Subtask 3: 18 / 18
• Subtask 4: 18 / 18
• Subtask 5: 18 / 18
• Subtask 6: 10 / 10