Submission #532056

#	Time	Username	Problem	Language	Result	Execution time	Memory
532056		8e7	Two Dishes (JOI19_dishes)	C++17	10 / 100	34 ms	16184 KiB

dishes

//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 2005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
struct obj{
	ll t, lim;
	int val;
	obj(){t = lim = val = 0;}
} a[maxn], b[maxn];
const ll inf = 1LL<<60;
int dp[maxn][maxn];
int main() {
	io
	int n, m;
	cin >> n >> m;
	for (int i = 1;i <= n;i++) {
		cin >> a[i].t >> a[i].lim >> a[i].val;	
		if (i) a[i].t += a[i-1].t;
	}
	for (int i = 1;i <= m;i++) {
		cin >> b[i].t >> b[i].lim >> b[i].val;
		if (i) b[i].t += b[i-1].t;
	}
	for (int i = 0;i <= n;i++) {
		for (int j = 0;j <= m;j++) {
			if (i) dp[i][j] = max(dp[i][j], dp[i-1][j] + (a[i].t + b[j].t <= a[i].lim ? a[i].val : 0));
			if (j) dp[i][j] = max(dp[i][j], dp[i][j-1] + (a[i].t + b[j].t <= b[j].lim ? b[j].val : 0));
		}
	}
	cout << dp[n][m] << "\n";	
}

• Subtask 1: 0 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 0 / 39
• Subtask 5: 0 / 11
• Subtask 6: 0 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9