제출 #897205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897205		VMaksimoski008	Bali Sculptures (APIO15_sculpture)	C++14	9 / 100	10 ms	856 KiB

sculpture

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int N, A, B;
ll ans = 1e18;
vector<int> v;

void f(int pos, ll res, int groups) {
    if(pos == N + 1 && A <= groups && groups <= B) {
        ans = min(ans, res);
        return ;
    }
 
    ll sum = 0;
    for(int i=pos; i<=N; i++) {
        sum += v[i];
        f(i+1, res | sum, groups + 1);
    }
}

bool dp[51][21][1<<5];
int32_t main() {
    setIO();
    
    cin >> N >> A >> B;
    v.resize(N+1);
    for(int i=1; i<=N; i++) cin >> v[i];

    if(N <= 21) {
        f(1, 0, 0);
        cout << ans << '\n';
        return 0;
    }

    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for(int i=0; i<N; i++) {
        for(int j=0; j<=min(B-1, i); j++) {
            for(int k=0; k<16; k++) {
                if(!dp[i][j][k]) continue;
                int sum = 0;
                for(int l=i+1; l<=N; l++) {
                    sum += v[l];
                    dp[l][j+1][k|sum] |= dp[i][j][k];
                }
            }
        }
    }

    for(int j=1; j<(1<<5); j++) {
        for(int i=A; i<=B; i++) {
            if(dp[N][i][j]) {
                cout << j << '\n';
                return 0;
            }
        }
    }
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29