提出 #70773236

---

ソースコード 拡げる

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>w(n), h(n), b(n);
	rep(i, n)cin >> w[i] >> h[i] >> b[i];
	// h-b
	int offset = 500 * n;
	vector<long long>dp(offset * 2 + 1, -LINF);//
	int sz = dp.size();
	dp[offset] = 0;
	rep(i, n) {
		vector<long long>ndp(offset * 2 + 1, -LINF);
		rep(j, sz) {
			{//h
				int nj = j + w[i];
				if (nj < sz) {
					chmax(ndp[nj], dp[j] + h[i]);
				}
			}
			{//b
				int nj = j - w[i];
				if (0 <= nj) {
					chmax(ndp[nj], dp[j] + b[i]);
				}
			}
		}
		swap(ndp, dp);
	}
	long long ans = -LINF;
	rep(i, offset + 1)chmax(ans, dp[i]);
	cout << ans << endl;
	return 0;
}

提出情報

ジャッジ結果