제출 #375834

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375834		fhvirus	Two Dishes (JOI19_dishes)	C++17	5 / 100	220 ms	10220 KiB

dishes

// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) begin(x),end(x)
template<typename I> bool chmax(I &a, I b){ return a < b ? ( a = b, true ) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? ( a = b, true ) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){cerr<<endl;}
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<class I> void DE(I a, I b){ while(a < b) cerr<<*a<<" \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif

const int N = 1e6 + 225;
int n, m;
ll a[N], b[N], s[N], t[N], p[N], q[N];

ll dp[N];

int bs(ll lft){
	int ans = 0;
	for(int l = 1<<30; l > 0; l >>= 1){
		if(ans + l > m) continue;
		if(b[ans + l] <= lft) ans += l;
	}
	return ans;
}

void solve1(){
	FOO(i,1,n) a[i] += a[i-1];
	FOO(i,1,n) p[i] += p[i-1];
	FOO(i,1,m) b[i] += b[i-1];
	FOO(i,1,m) q[i] += q[i-1];
	ll ans = q[bs(s[1])];
	FOO(i,1,n){
		if(a[i] > s[1]) break;
		ll left = s[1] - a[i];
		chmax(ans, p[i] + q[bs(left)]);
	}
	cout << ans;
}

int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> m;
	FOO(i,1,n) cin >> a[i] >> s[i] >> p[i];
	FOO(i,1,m) cin >> b[i] >> t[i] >> q[i];
	solve1();
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 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