Submission #375788

#	Time	Username	Problem	Language	Result	Execution time	Memory
375788		casperwang	Two Dishes (JOI19_dishes)	C++14	10 / 100	51 ms	63136 KiB

dishes

#include <bits/stdc++.h>
#define int long long
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 2000;
int n, m;
int a[MAXN+1], b[MAXN+1];
int s[MAXN+1], t[MAXN+1];
int p[MAXN+1], q[MAXN+1];
int ti[MAXN+1][MAXN+1];
int dp[MAXN+1][MAXN+1];

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> s[i] >> p[i];
		ti[i][0] = ti[i-1][0] + a[i];
	}
	for (int i = 1; i <= m; i++) {
		cin >> b[i] >> t[i] >> q[i];
	}
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= m; j++) {
			if (j) ti[i][j] = ti[i][j-1] + b[j];
			dp[i][j] = max((i?dp[i-1][j]:0) + (ti[i][j] <= s[i]) * p[i],
										 (j?dp[i][j-1]:0) + (ti[i][j] <= t[j]) * q[j]);
		}
	}
	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