Submission #2083670

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　  |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/










int N; ll X[20], C[20], V[20];
ll dp[20][1 << 18];
vector<pair<ll, ll>> v;
//---------------------------------------------------------------------------------------------------
ll memo[20][1 << 18];
ll f(int n, int msk) {
    if (0 <= memo[n][msk]) return memo[n][msk];
    if (n == N) return 0;

    // 売却
    ll sold = infl;
    rep(i, 0, N) if (msk & (1 << i)) chmin(sold, f(n + 1, msk - (1 << i)));

    // 購入
    ll buy = dp[n][msk];

    return memo[n][msk] = max(sold, buy);
}
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;
    rep(i, 0, N) cin >> X[i];
    rep(i, 0, N) cin >> C[i];
    rep(i, 0, N) cin >> V[i];

    rep(n, 0, N + 1) {
        ll yen = 0;
        rep(i, 0, n) yen += X[i];
        
        rep(msk, 0, 1 << N) {
            ll co = 0, va = 0;
            rep(i, 0, N) if (msk & (1 << i)) co += C[i], va += V[i];
            if (co <= yen) dp[n][msk] = va;
            else dp[n][msk] = 0;
        }

        rep(msk, 0, 1 << N) rep(i, 0, N) if (msk & (1 << i)) chmax(dp[n][msk], dp[n][msk ^ (1 << i)]);
    }

    rep(i, 0, N + 1) rep(msk, 0, 1 << N) memo[i][msk] = -1;
    cout << f(0, (1 << N) - 1) << endl;
}

Submission Info

Judge Result