제출 #674081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
674081		beaconmc	Cloud Computing (CEOI18_clo)	C++14	100 / 100	1748 ms	2172 KiB

clo

#include <bits/stdc++.h>

typedef long long ll;

#define FOR(i,x,y) for(ll i=x; i<y; i++)


using namespace std;

vector<ll> stuff[4001];

ll dp[2][100001];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	ll n;
	cin >> n;
	ll cur = 0;

	FOR(i,0,n){
		ll c,f,v;
		cin >> c >> f >> v;
		stuff[cur] = {-f, -v, c};
		cur++;
	}
	ll m;
	cin >> m;

	FOR(i,0,m){
		ll c,f,v;
		cin >> c >> f >> v;
		stuff[cur] = {-f, v, c};
		cur++;
	}
	sort(stuff, stuff+n+m);

	FOR(i,0,2){
		FOR(j,0,100001) dp[i][j] = -1000000000000000000;
	}
	dp[0][0] = 0;

	FOR(i,0,n+m){
		FOR(j,0,100001){
			if (stuff[i][1]<0){
				if (j+stuff[i][2] <= 100000 ) dp[1][j+stuff[i][2]] = max(dp[1][j+stuff[i][2]], dp[0][j] + stuff[i][1]);
			}else{
				if (j-stuff[i][2]>=0 ) dp[1][j-stuff[i][2]] = max(dp[1][j-stuff[i][2]] , dp[0][j] + stuff[i][1]);
			}
			dp[1][j] = max(dp[1][j], dp[0][j]);
		}
		FOR(j,0,100001) dp[0][j] = dp[1][j], dp[1][j] = -1000000000000000000;
	}
	ll maxi = 0;

	FOR(i,0,100001){
		maxi = max(maxi, dp[0][i]);

	}
	cout << maxi << endl;

}

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