제출 #362888

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

clo

#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define ppb pop_back
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
#define cl(a,s) memset((a),0,sizeof((a)[0])*(s))
#define all(x) (x).begin() , (x).end()
#define fi first
#define se second
#define int long long
using pii = pair<int,int>;
using ll = long long;
const int maxn = 2005;
const int inf = 1e9;
const int mod = 1e9+7;

int n,m;
int dp[maxn][maxn],c1[maxn],f1[maxn],cost1[maxn],c2[maxn],f2[maxn],cost2[maxn];

int32_t main () {
	//freopen("in","r",stdin); freopen("out","w",stdout);
	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
	cin >> n;
	for(int i=1;i<=n;i++) cin >> c1[i] >> f1[i] >> cost1[i];
	cin >> m;
	for(int i=1;i<=n;i++) cin >> c2[i] >> f2[i] >> cost2[i];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++) {
			dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
			if(cost1[i] < cost2[j] and f1[i] >= f2[j] and c1[i] >= c2[j])
				dp[i][j] = max(dp[i][j],cost2[j]-cost1[i]+dp[i-1][j-1]);
		}
	cout << dp[n][m] << endl;
}	

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