제출 #716123

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716123		penguin133	Cloud Computing (CEOI18_clo)	C++17	0 / 100	102 ms	262144 KiB

clo

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
pii A[200005], B[200005];

int memo[2001][251][101];

int dp(int x, int y, int rem){
	if(y == 0)return 0;
	if(memo[x][y][rem] != -1)return memo[x][y][rem];
	int res = dp(x, y-1, rem);
	if(rem >= B[y].se.fi)res = max(res, dp(x, y - 1, rem - B[y].se.fi) + B[y].se.se);
	if(x && A[x].fi >= B[y].fi){
		res = max(res, dp(x-1, y, rem));
		if(rem <= 50)res = max(res, dp(x - 1, y, rem + A[x].se.fi) - A[x].se.se);
	} 
	return memo[x][y][rem] = res;
}

void solve(){
	cin >> n;
	memset(memo, -1, sizeof(memo));
	for(int i=1;i<=n;i++)cin >> A[i].se.fi >> A[i].fi >> A[i].se.se;
	cin >> m;
	for(int i=1;i<=m;i++)cin >> B[i].se.fi >> B[i].fi >> B[i].se.se;
	sort(A+1, A+n+1);
	sort(B+1, B+m+1);
	cout << dp(n, m, 0);
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

clo.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main(){
      | ^~~~

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