Submission #1294426

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294426		blackscreen1	Cloud Computing (CEOI18_clo)	C++20	100 / 100	242 ms	1408 KiB

clo

#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n;
	cin >> n;
	vector<pair<ll, pll>> v;
	ll t1, t2, t3, cs = 0;
	iloop(0, n) {
		cin >> t1 >> t2 >> t3;
		v.push_back({t2, {t1, -t3}});
		cs += t1;
	}
	ll m;
	cin >> m;
	iloop(0, m) {
		cin >> t1 >> t2 >> t3;
		v.push_back({t2, {-t1, t3}});
	}
	sort(v.begin(), v.end(), greater<pair<ll, pll>>());
	ll dp[cs+1];
	iloop(1, cs+1) dp[i] = -INF;
	dp[0] = 0;
	for (auto it : v) {
		pll tmp = it.second;
		if (tmp.first > 0) {
			iloop(cs, tmp.first - 1) dp[i] = max(dp[i], dp[i-tmp.first] + tmp.second);
		}
		else {
			iloop(0, max(cs + 1 + tmp.first, 0LL)) dp[i] = max(dp[i], dp[i-tmp.first] + tmp.second);
		}
	}
	cout << *max_element(dp, dp + cs + 1);
}

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