# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349902 | denkendoemeer | Bali Sculptures (APIO15_sculpture) | C++14 | 120 ms | 512 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>
#define ll long long
const ll inf=2e9;
using namespace std;
ll dp[2005],dp2[2005],v[2005];
int main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
ll n,st,dr,i,last=0,j,e;
scanf("%lld%lld%lld",&n,&st,&dr);
for(i=1;i<=n;i++)
scanf("%lld",&v[i]);
for(i=41;i>=0;i--){
for(j=1;j<=n;j++){
dp[j]=inf;
dp2[j]=0;
ll sum=0;
for(e=j;e>=1;e--){
sum+=v[e];
if (sum-(sum&last)<(1LL<<i) && dp[e-1]+1<=dr)
dp[j]=min(dp[j],dp[e-1]+1),dp2[j]=max(dp2[j],dp2[e-1]+1);
}
}
if (dp[n]==inf || dp2[n]<st)
last=last|(1ll<<i);
}
printf("%lld\n",last);
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... |