# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43649 | top34051 | Bali Sculptures (APIO15_sculpture) | C++14 | 141 ms | 744 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 maxn = 2e3 + 5;
const long long inf = 2e16 + 5;
int n,a,b;
int p[maxn];
int dp[maxn];
bool check(long long bit) {
// printf("check %lld\n",bit);
for(int x=1;x<=n;x++) {
long long cur = 0;
dp[x] = n+1;
for(int y=x;y>=1;y--) {
cur += p[y];
if((cur|bit) == bit) dp[x] = min(dp[x], dp[y-1] + 1);
}
// printf("\tdp %d = %d\n",x,dp[x]);
}
return dp[n]<=b;
}
int main() {
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;i++) scanf("%d",&p[i]);
long long res = (1LL<<41)-1;
for(int i=40;i>=0;i--) {
if(check(res-(1LL<<i))) res -= (1LL<<i);
}
printf("%lld",res);
}
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... |