# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
33731 | sinhriv | Bali Sculptures (APIO15_sculpture) | C++14 | 93 ms | 10120 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;
const int N = 2030;
int n, a, b;
int f[N];
int arr[N];
long long sum[N];
void small(){
long long ans = sum[n];
for(int mask = 0; mask < (1 << (n - 1)); ++mask){
int cnt = __builtin_popcount(mask) + 1;
if(cnt < a || cnt > b) continue;
long long curr = 0, now = 0;
for(int i = 1; i <= n; ++i){
curr += arr[i];
if(mask & (1 << (i - 1))){
now |= curr;
curr = 0;
}
}
now |= curr;
ans = min(ans, now);
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... |