# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23424 | rubabredwan | Bali Sculptures (APIO15_sculpture) | C++14 | 129 ms | 2036 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.
/* Bismillahir Rahmanir Rahim */
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const int oo = 1e9;
int n, a, b, y[N];
int dp[N];
long long lst(long long mask){
if(!mask) return -1;
return 63 - __builtin_clzll(mask);
}
bool OK(long long fixed){
dp[0] = 0;
for(int i=1;i<=n;i++){
dp[i] = oo;
long long sum = 0;
for(int j=i;j>=1;j--){
sum += y[j];
if(sum & fixed) continue;
dp[i] = min(dp[i], dp[j-1] + 1);
}
}
if(dp[n] <= b) return true;
else return false;
}
int main(){
scanf("%d %d %d", &n, &a, &b);
for(int i=1;i<=n;i++) scanf("%d", &y[i]);
long long ret = 0, fixed = 0;
for(long long bit=45;bit>=0;bit--){
if(OK(fixed | (1LL << bit))){
fixed |= (1LL << bit);
}
else{
ret |= (1LL << bit);
}
}
cout << ret << endl;
return 0;
}
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... |