Submission #897173

#TimeUsernameProblemLanguageResultExecution timeMemory
897173VMaksimoski008Bali Sculptures (APIO15_sculpture)C++14
9 / 100
1068 ms600 KiB
#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);
    }
}

int32_t main() {
    setIO();
    
    cin >> N >> A >> B;
    v.resize(N+1);

    for(int i=1; i<=N; i++) cin >> v[i];

    f(1, 0, 0);
    cout << ans << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...