| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 478220 | PiejanVDC | Bali Sculptures (APIO15_sculpture) | C++17 | 1081 ms | 300 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;
int n,a,b;
vector<int>v;
vector<int>pref;
int ans = INT_MAX;
void dfs(int i, int cnt, int curr, int prev) {
if(i == n) {
if(cnt >= a && cnt <= b)
curr|=(pref[i]-pref[prev]);
ans=min(ans,curr);
return;
}
if(cnt < b) {
if(i != 0)
dfs(i+1,cnt+1,(curr|(pref[i]-pref[prev])),i);
}
dfs(i+1,cnt,curr,prev);
}
signed main() {
cin>>n>>a>>b;
v.resize(n);
for(auto &z : v)
cin>>z;
pref.resize(n+1);
pref[0]=0;
for(int i = 0 ; i < n ; i++)
pref[i+1] = pref[i] + v[i];
dfs(0,1,0,0);
cout << ans;
}
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... | ||||
