#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<(int)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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
288 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |