Submission #540492

#	Time	Username	Problem	Language	Result	Execution time	Memory
540492		fcw	Cloud Computing (CEOI18_clo)	C++17	54 / 100	486 ms	1236 KiB

clo

#include <bits/stdc++.h>
#define st first
#define nd second
using lint = int64_t;
constexpr int mod = int(1e9) + 7;
constexpr int inf = 0x3f3f3f3f;
constexpr int ninf = 0xcfcfcfcf;
constexpr lint linf = 0x3f3f3f3f3f3f3f3f;
const long double pi = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int cmp_double(double a, double b = 0, double eps = 1e-9) {
	return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
using namespace std;


int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin>>n;
	vector<int>c(n), f(n), v(n);
	for(int i=0;i<n;i++) cin>>c[i]>>f[i]>>v[i];
	int q;
	cin>>q;
	c.resize(n+q);
	f.resize(n+q);
	v.resize(n+q);
	for(int i=n;i<n+q;i++) cin>>c[i]>>f[i]>>v[i];
	vector<pair<int, int>>e(n+q);
	for(int i=0;i<n+q;i++) e[i] = {f[i], i};
	sort(e.rbegin(), e.rend());
	const int ms = 100000;
	vector<lint>dp(ms+2, -linf);
	dp[0] = 0;
	for(auto [_, i] : e){
		if(i < n){
			for(int j=ms-c[i];j>=0;j--){
				if(dp[j] == -linf) continue;
				dp[j+c[i]] = max(dp[j+c[i]], dp[j] - v[i]);
			}
		}
		else{
			for(int j=c[i];j<=ms;j++){
				if(dp[j] == -linf) continue;
				dp[j-c[i]] = max(dp[j-c[i]], dp[j] + v[i]);
			}
		}
	}
	lint ans = 0;
	for(int j=0;j<=ms;j++) ans = max(ans, dp[j]);
	cout<<ans<<"\n";







	return 0;
}
/*
[  ]Leu o problema certo???
[  ]Ver se precisa de long long
[  ]Viu o limite dos fors (é n? é m?)
[  ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[  ]Testar sample
[  ]Testar casos de  borda
[  ]1LL no 1LL << i
[  ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/

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