Submission #443768

#TimeUsernameProblemLanguageResultExecution timeMemory
443768impriBali Sculptures (APIO15_sculpture)C++14
71 / 100
1082 ms16172 KiB
#include<bits/stdc++.h> using namespace std; int n,a,b; int arr[2001]; int dp[2002][2011]; int place; long long res=0; int get(int cur,int r){ if(cur==n+1){ if(a<=r && r<=b)return 1; return 0; } if(dp[cur][r]!=-1)return dp[cur][r]; long long sum=0; int ok=0; for(int i=cur;i<=n;i++){ sum+=arr[i]; if((res >> (place+1))==((res|sum) >> (place+1))){ if((sum & (1LL << place))==0) ok=max(ok,get(i+1,r+1)); } } return dp[cur][r]=ok; } int main(void){ cin.tie(0); ios_base::sync_with_stdio(false); cin >>n >> a >> b; for(int i=1;i<=n;i++) cin >> arr[i]; for(place=40;place>=0;place--){ memset(dp,-1,sizeof(dp)); if(!get(1,0)){ res+=(1LL << place); } } cout << res; }
#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...