提出 #69839656

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, j, k) for(int i = (j); i <= (k); i++)
#define per(i, j, k) for(int i = (j); i >= (k); i--)
#define pb emplace_back
#define fi first
#define se second
using vi = vector<int>;
using pi = pair<int, int>;

template<typename T0, typename T1> bool chmin(T0 &x, const T1 &y){
	if(y < x){x = y; return true;} return false;
}
template<typename T0, typename T1> bool chmax(T0 &x, const T1 &y){
	if(x < y){x = y; return true;} return false;
}

template<typename T> void debug(char *s, T x){
	cerr << s <<" = "<< x <<endl;
}
template<typename T, typename ...Ar> void debug(char *s, T x, Ar... y){
	int dep = 0;
	while(!(*s == ',' && dep == 0)){
		if(*s == '(') dep++;
		if(*s == ')') dep--;
		cerr << *s++;
	}
	cerr <<" = "<< x <<",";
	debug(s + 1, y...);
}
#define gdb(...) debug((char*)#__VA_ARGS__, __VA_ARGS__)

const int V = 500;

signed main(){
	#ifdef LOCAL
	assert( freopen(".in", "r", stdin) );
	assert( freopen(".out", "w", stdout) );
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	vi w(n), v(n);
	rep(i, 0, n - 1){
		cin >> v[i] >> w[i];
	}
	int q;
	cin >> q;
	vector< array<int, 4> > Q(q);
	vi ans(q);
	int tmp = 0;
	for(auto &[l, r, c, id]:Q){
		cin >> l >> r >> c;
		l --, r --;
		id = tmp ++;
	}
	vector<vi> f(n, vi(V + 1)), g(n, vi(V + 1));
	auto dfs = [&](auto &self, int l, int r, vector< array<int, 4> > Q)->void {
		if(l + 1 == r){
			for(auto [l, r, c, id]:Q){
				ans[id] = (v[l] <= c? w[l]: 0);
			}
			return;
		}
		int mid = (l + r) / 2;
		fill(f[mid].begin(), f[mid].end(), 0);
		per(i, mid - 1, l){
			f[i] = f[i + 1];
			rep(j, 0, V - v[i]){
				chmax(f[i][j + v[i]], f[i + 1][j] + w[i]);
			}
		}
		fill(g[mid - 1].begin(), g[mid - 1].end(), 0);
		rep(i, mid, r - 1){
			g[i] = g[i - 1];
			rep(j, 0, V - v[i]){
				chmax(g[i][j + v[i]], g[i - 1][j] + w[i]);
			}
		}
		
		vector< array<int, 4> > L, R;
		for(auto [l, r, c, id]:Q){
			if(l < mid && r >= mid){
				rep(i, 0, c){
					chmax(ans[id], f[l][i] + g[r][c - i]);
				}
			} else if(r < mid){
				L.push_back({l, r, c, id});
			} else if(l >= mid){
				R.push_back({l, r, c, id});
			}
		}
		self(self, l, mid, L);
		self(self, mid, r, R);
	};
	dfs(dfs, 0, n, Q);
	rep(i, 0, q - 1){
		cout << ans[i] <<'\n';
	}
}

提出情報

ジャッジ結果