Submission #1190388

#TimeUsernameProblemLanguageResultExecution timeMemory
1190388julia_08Bali Sculptures (APIO15_sculpture)C++20
9 / 100
1096 ms436 KiB
#include <bits/stdc++.h> #define int long long using namespace std; const int MAXN = 21; int y[MAXN]; int32_t main(){ cin.tie(0)->sync_with_stdio(0); int n, a, b; cin >> n >> a >> b; for(int i=0; i<n; i++){ cin >> y[i]; } int ans = 1e18; for(int mask=0; mask<(1 << (n - 1)); mask++){ int cur_or = 0, sum = 0, sz = 1; for(int i=0; i<n; i++){ sum += y[i]; if(mask & (1 << i)){ cur_or |= sum; sz ++; sum = 0; } } cur_or |= sum; if(a <= sz && sz <= b) ans = min(ans, cur_or); } cout << ans << "\n"; return 0; }
#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...