# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145981 | str0ct | Bali Sculptures (APIO15_sculpture) | C++14 | 4 ms | 404 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;
using ll=long long;
ll N,A,B;
ll arr[2020];
ll ans;
void sol2(){
ll k=24;
ans=(1LL<<k)-1;
k--;
ll dp[2020];
while(k>=0){
ans-=(1LL<<k);
fill(dp+1,dp+2020,10101010);
for(ll i=1;i<=N;i++){
for(ll j=0;j<i;j++)if(((arr[i]-arr[j])|ans)==ans)dp[i]=min(dp[i],dp[j]+1);
}
if(dp[N]>B)ans+=(1<<k);
k--;
}
}
int main(){
scanf("%lld%lld%lld",&N,&A,&B);
for(ll i=1;i<=N;i++){
scanf("%lld",arr+i);
arr[i]+=arr[i-1];
}
//if(A-1)sol1();
sol2();
printf("%lld",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... |