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;
const int maxn=2e3+5;
int n,A,B;
int a[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> A >> B;
for(int i = 1;i <= n;i++) cin >> a[i];
ll ans = 0;
for(int i = 30;i >= 0;i--){
ll now = ans + (1 << i) - 1;
vector<int>dp(n + 1,1e9);
dp[0] = 0;
for(int j = 1;j <= n;j++){
ll sum = 0;
for(int k = j;k >= 1;k--){
sum += a[k];
if((sum & now) == sum) dp[j] = min(dp[j],dp[k - 1] + 1);
}
}
if(dp[n] > B) ans += (1ll << i);
}
cout<<ans;
}
| # | 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... |