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>
#define all(a) a.begin() , a.end()
#define pb push_back
#define int long long
using namespace std;
const int maxn =2e6+10 , maxq = 1e7 , sq = sqrt(1e9) , N = 1e5 , lg = 20 , mod = 1e9+7 ;
int c[maxn] , dp[maxn] , a2[maxn] ;
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n , a , b;
cin >> n >> a >> b ;
if(a!=1)return 0 ;
for(int i = 1 ; i<= n ; i++){
cin >> c[i] ;
}
a2[0] = 1;
for(int i =1 ; i <= 50 ; i++)a2[i] = a2[i-1] * 2 ;
int ans = a2[36] - 1;
for(int i = 35 ; i >= 0 ; i--){
ans^=a2[i];
for(int i = 1 ; i <= n ; i++){
dp[i] = 1e9 ;
}
dp[0] = 0 ;
for(int j =1 ;j <= n ; j ++){
int s = 0 ;
for(int k = j ; k >= 1 ; k--){
s+=c[k];
if((ans&s) == s){
dp[j] = min(dp[j] , dp[k-1] + 1);
}
}
}
if(dp[n] > b){
ans^=a2[i];
}
}
cout << ans << "\n";
}
# | 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... |