# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866815 | 1075508020060209tc | Bali Sculptures (APIO15_sculpture) | C++14 | 1042 ms | 17496 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;
#define int long long
int dp[2010][2010];
int ar[2010];
int ps[2010];
int A;int B;
int n;
int ok(int msk){
dp[0][0]=1;
for(int k=1;k<=B;k++){
for(int i=1;i<=n;i++){
dp[k][i]=0;
}
vector<int>vc;
if(dp[k-1][0]){vc.push_back(0);}
for(int i=1;i<=n;i++){
for(int j=0;j<vc.size();j++){
int v=ps[i]-ps[vc[j]];
if( ((v|msk)==msk) ){
dp[k][i]=1;break;
}
}
if(dp[k-1][i]){
vc.push_back(i);
}
}
if(dp[k][n]==1&&k>=A){return 1;}
}
return 0;
}
signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>A>>B;
for(int i=1;i<=n;i++){
cin>>ar[i];
ps[i]=ar[i]+ps[i-1];
}
int msk=(1ll<<46)-1;
for(int bt=45;bt>=0;bt--){
if(ok(msk^(1ll<<bt))){
msk^=(1ll<<bt);
}
}
cout<<msk;
}
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... |