結果

問題 No.2741 Balanced Choice
ユーザー dyktr_06dyktr_06
提出日時 2024-04-20 16:04:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 368 ms / 2,000 ms
コード長 5,409 bytes
コンパイル時間 2,232 ms
コンパイル使用メモリ 204,572 KB
実行使用メモリ 394,372 KB
最終ジャッジ日時 2024-10-12 11:48:01
合計ジャッジ時間 7,565 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 368 ms
394,292 KB
testcase_01 AC 351 ms
394,284 KB
testcase_02 AC 353 ms
394,372 KB
testcase_03 AC 351 ms
394,312 KB
testcase_04 AC 354 ms
394,168 KB
testcase_05 AC 265 ms
394,080 KB
testcase_06 AC 270 ms
393,956 KB
testcase_07 AC 307 ms
394,256 KB
testcase_08 AC 318 ms
394,268 KB
testcase_09 AC 300 ms
394,284 KB
testcase_10 AC 313 ms
394,156 KB
testcase_11 AC 318 ms
394,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll dp0[5001][5001], dp1[5001][5001];

void input(){
}

void solve(){
    ll n, w, d; in(n, w, d);
    vll w0, v0, w1, v1;
    rep(i, n){
        ll t, wi, vi; in(t, wi, vi);
        if(t == 0){
            w0.push_back(wi);
            v0.push_back(vi);
        }else{
            w1.push_back(wi);
            v1.push_back(vi);
        }
    }
    ll siz0 = w0.size(), siz1 = w1.size();
    rep(i, 5001) rep(j, 5001){
        dp0[i][j] = -INF;
        dp1[i][j] = -INF;
    }
    dp0[0][0] = 0;
    dp1[0][0] = 0;
    rep(i, siz0){
        rep(j, w + 1){
            if(dp0[i][j] == -INF) continue;
            chmax(dp0[i + 1][j], dp0[i][j]);
            if(j + w0[i] <= w){
                chmax(dp0[i + 1][j + w0[i]], dp0[i][j] + v0[i]);
            }
        }
    }
    rep(i, siz1){
        rep(j, w + 1){
            if(dp1[i][j] == -INF) continue;
            chmax(dp1[i + 1][j], dp1[i][j]);
            if(j + w1[i] <= w){
                chmax(dp1[i + 1][j + w1[i]], dp1[i][j] + v1[i]);
            }
        }
    }
    ll ans = 0;
    rep(i, w + 1){
        rep(j, max(0LL, i - d), min(w + 1, i + d + 1)){
            if(i + j <= w){
                chmax(ans, dp0[siz0][i] + dp1[siz1][j]);
            }
        }
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0