# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019815 | KasymK | Bali Sculptures (APIO15_sculpture) | C++17 | 1018 ms | 440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
int main(){
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
vector<int> v(n);
for(int &i : v)
scanf("%d", &i);
ll ans = INT_MAX;
for(int mk = 0; mk < (1<<n); ++mk){
ll sm = 0, cur = 0;
int x = 1;
for(int i = 0; i < n; ++i){
sm += v[i];
if(mk>>i&1)
cur |= sm, sm = 0, x++;
}
cur |= sm;
if(a <= x and x <= b)
ans = min(ans, cur);
}
printf("%lld", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |