제출 #1327578

#제출 시각아이디문제언어결과실행 시간메모리
1327578ElayV13Bali Sculptures (APIO15_sculpture)C++20
9 / 100
1096 ms416 KiB
//g++ -o sol sol.cpp
//cd C:\Users\Asus-1\OneDrive\Desktop
#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define int long long
const int INF=1e18;
#define S(a) a.begin(),a.end()
#define pb push_back
#define READ(l,r,a) for(int i=l;i<=r;i++) cin>>a[i]
#define printV(l,r,a) for(int i=l;i<=r;i++) cout<<a[i]<<' ';
#define pii pair <int,int>
#define FOR(i,l,r) for(int i=l;i<=r;i++)
int n,A,B;
int a[101];
void solve(){
	cin>>n>>A>>B;
	for(int i=1;i<=n;i++) cin>>a[i];
	int res=INF;
	for(int bit=0;bit<(1<<n);bit++){
		int sum=0;
		int OR=0;
		int cnt=1;
		bool ok=0;
		for(int i=1;i<=n;i++){
			sum+=a[i];
			if((1<<(i-1))&bit){
				if(i!=n)cnt++;
				OR|=sum;
				sum=0;
			}
		}
		if(!(cnt>=A&&cnt<=B)) continue;
		OR|=sum;
		res=min(res,OR);
	}	
	cout<<res<<endl;
}
signed main(){
        ios_base::sync_with_stdio();
        cin.tie(0);
	cout.tie(0);
	int T=1;//cin>>T;
	while(T--) solve();
}
#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...