Submission #425547

#	Time	Username	Problem	Language	Result	Execution time	Memory
425547		Kevin_Zhang_TW	Two Dishes (JOI19_dishes)	C++17	3 / 100	18 ms	524 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 = 1e16;

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];

ll dp_diff[MAX_N];

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;

	assert(n < MAX_M && m < MAX_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;
	}

	for (int i = 0;i <= n;++i) {
		auto upd = [&](int j) {
			ll e = (i <= d[j] ? q[j] : 0) - dp_diff[j];
			if (e > 0) dp_diff[j] += e, dp_diff[j+1] -= e;
			//chmax(dp_diff[j], (i <= d[j] ? q[j] : 0));
		};
		for (int j = 1;j <= m;++j) upd(j);

		DE(i);
		debug(dp_diff, dp_diff + m + 1);
		if (i == n) break;

		int v = c[i+1];
		dp_diff[0] += p[i+1];
		dp_diff[v+1] -= p[i+1];
	}
	ll res = 0;
	for (int i = 0;i <= m;++i) res += dp_diff[i];

	cout << res << '\n';

//	//return 0;
//
//	for (int i = 0;i <= n;++i) for (int j = 0;j <= m;++j)
//		dp[i][j] = -inf;
//
//	dp[0][0] = 0;
//
//	for (int i = 0;i <= n;++i) {
//
//		for (int j = 1;j <= m;++j) {
//			chmax(dp[i][j], dp[i][j-1] + (i <= d[j] ? q[j] : 0));
//		}
//
//		for (int j = 0;j <= c[i+1];++j)
//			dp[i+1][j] = dp[i][j] + p[i+1];
//		for (int j = c[i+1]+1;j <= m;++j)
//			dp[i+1][j] = dp[i][j];
//
//		DE(i);
//		vector<ll> mdf {dp[i][0]};
//		for (int j = 1;j <= m;++j) mdf.pb(dp[i][j] - dp[i][j-1]);
//		debug(AI(mdf));
//	}
//
//	cout << dp[n][m] << '\n';

}

Compilation message (stderr)

dishes.cpp: In function 'int32_t main()':
dishes.cpp:14:17: warning: statement has no effect [-Wunused-value]
   14 | #define DE(...) 0
      |                 ^
dishes.cpp:59:3: note: in expansion of macro 'DE'
   59 |   DE(i);
      |   ^~
dishes.cpp:15:20: warning: statement has no effect [-Wunused-value]
   15 | #define debug(...) 0
      |                    ^
dishes.cpp:60:3: note: in expansion of macro 'debug'
   60 |   debug(dp_diff, dp_diff + m + 1);
      |   ^~~~~

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