Submission #58477629

---

Source Code Expand

#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
#include <atcoder/modint>
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    int N; cin >> N;
    vector<i64> A, B;
    rep(i,N){
        i64 a; cin >> a;
        A.push_back(a);
        swap(A, B);
    }
    vector<i64> PA, PB;
    rep(t,2){
        PA.push_back(0);
        rep(i,A.size()) rep(b,1<<i) PA.push_back(PA[b] + A[i]);
        swap(A, B); swap(PA, PB);
    }
    sort(PA.begin(), PA.end());
    i64 sum = PA.back() + PB.back();
    i64 ans = sum;
    for(i64 pb : PB){
        i64 lbi = lower_bound(PA.begin(), PA.end(), (sum+1) / 2 - pb) - PA.begin();
        if(lbi != 0) chmin(ans, sum - (PA[lbi-1] + pb));
        if(lbi != i64(PA.size())) chmin(ans, (PA[lbi] + pb));
    }
    cout << ans << '\n';
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}

Submission Info

Judge Result