# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629753 | aebov | Bali Sculptures (APIO15_sculpture) | C++17 | 1 ms | 324 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<iostream>
#include<algorithm>
#include<bitset>
#include<vector>
#define pb push_back
using namespace std;
int n,a,b,y[21];
int ans=1000000000+7;
int f(int x)
{
if(__builtin_popcount(x)<a-1)return 1000000000+7;
vector<int> pos;
for(int i=0;i<b;i++)if((x>>i)%2==1)pos.pb(i);
pos.pb(n-1);
int ret=0;
int tm2=0;
for(int i=0;i<=pos[0];i++)tm2+=y[i];
ret|=tm2;
for(int i=1;i<pos.size();i++){
tm2=0;
for(int j=pos[i-1]+1;j<=pos[i];j++)tm2+=y[j];
ret|=tm2;
}
//bitset<5> tb = x;
//cout<<tb<< " "<<ret<<endl;
return ret;
}
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>a>>b;
for(int i=0;i<n;i++)cin>>y[i];
for(int i=0;i<(1<<b);i++){
ans=min(ans,f(i));
}
cout<<ans<<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... |