# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110278 | _demon_ | Bali Sculptures (APIO15_sculpture) | C++14 | 864 ms | 512 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;
long long n,a,b;
long long arr[29];
vector<int>vv;
long long bt(int id,vector<int>v){
if(v.size()+1>b) return 100000000000009ll;
if(id==n-1){
if(v.size()+1>b || v.size()+1<a) return 1000000000009ll;
bool done[29]={0};
for(int i=0;i<v.size();i++){
done[v[i]]=1;
}
long long all=0;
long long sum=0;
for(int i=0;i<n;i++){
sum+=arr[i];
if(done[i]){
all|=sum;
sum=0;
}
}
all|=sum;
/*if(all==11){
for(int i=0;i<v.size();i++){
cout<<v[i]<<" ";
}
cout<<endl;
}*/
return all;
}
long long ans=1000000000009ll;
ans=min(ans,bt(id+1,v));
v.push_back(id);
ans=min(ans,bt(id+1,v));
return ans;
}
int main(){
cin>>n>>a>>b;
for(int i=0;i<n;i++)cin>>arr[i];
cout<<bt(0,vv)<<endl;
}
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... |