제출 #425500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425500		Kevin_Zhang_TW	Two Dishes (JOI19_dishes)	C++17	10 / 100	999 ms	192316 KiB

dishes

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(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 debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 1000010, MAX_M = 2005;
const ll inf = 1ll << 59;

int n, m;

ll a[MAX_N], s[MAX_N], p[MAX_N], c[MAX_N];
ll b[MAX_N], t[MAX_N], q[MAX_N], d[MAX_N];

ll dp[MAX_M][MAX_M];

bool ok[MAX_N];
ll dp_diff[MAX_N];

int32_t 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];
	for (int i = 1;i <= m;++i) cin >> b[i] >> t[i] >> q[i];
	for (int i = 1;i <= n;++i) a[i] += a[i-1];
	for (int i = 1;i <= m;++i) b[i] += b[i-1];
	for (int i = 1;i <= n;++i) 
		c[i] = upper_bound(b, b + m + 1, s[i] - a[i]) - b - 1;
	for (int i = 1;i <= m;++i)
		d[i] = upper_bound(a, a + n + 1, t[i] - b[i]) - a - 1;
	
//	dp_diff[0] = 0;
//	for (int i = 1;i <= m;++i) dp_diff[i] = -inf;
//
//	vector<int> id(m); iota(AI(id), 1);
//	sort(AI(id), [&](int x, int y) {
//		return d[x] < d[y];
//	});



	for (int i = 0;i <= n;++i) for (int j = 0;j <= m;++j)
		dp[i][j] = -inf;

	dp[0][0] = 0;
	for (int j = 1;j <= m;++j) dp[0][0] += q[j];

	for (int i = 0;i <= n;++i) for (int j = 0;j <= m;++j) {
		// done
		chmax(dp[i+1][j], dp[i][j] + (j <= c[i+1] ? p[i+1] : 0));
		//
		chmax(dp[i][j+1], dp[i][j] + (i > d[j+1] ? -q[j+1] : 0));
		//chmax(dp[i][j+1], dp[i][j] + (i <= d[j+1] ? q[j+1] : 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