Submission #1110435

#TimeUsernameProblemLanguageResultExecution timeMemory
1110435simona1230Bali Sculptures (APIO15_sculpture)C++17
0 / 100
1 ms508 KiB
#include <bits/stdc++.h> using namespace std; int n,a,b; int c[2001],p[2001]; int dp[2001][2001]; bool check(int x) { //cout<<"! "<<x<<endl; dp[0][0]=1; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { dp[i][j]=0; for(int k=0;k<i;k++) { if(((p[i]-p[k])|x)<=x) { //cout<<p[i]-p[k]<<endl; dp[i][j]=max(dp[i][j],dp[k][j-1]); } } //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl; if(i==n&&j>=a&&j<=b&&dp[i][j]) { return 1; } } } return 0; } void read() { cin>>n>>a>>b; for(int i=1;i<=n;i++) { cin>>c[i]; p[i]=p[i-1]+c[i]; } } void solve() { int ans=0; for(int i=3;i>=0;i--) { int curr=ans; for(int j=i-1;j>=0;j--) curr+=(1<<j); //cout<<curr<<endl; if(!check(curr))ans+=(1<<i); } cout<<ans<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); read(); solve(); return 0; } /* 6 1 3 8 1 2 1 5 4 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...