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;
int n, a, b; long long ans, A[2005];
int main(){
cin >> n >> a >> b; ans = (1LL << 41) - 1;
for (int i = 1; i <= n; i++)
cin >> A[i], A[i] += A[i - 1];
for (long long x = (1LL << 40); x > 0; x /= 2){
ans -= x; int mn[n + 1], mx[n + 1]; mn[0] = mx[0] = 0;
for (int i = 1; i <= n; i++){
mn[i] = 1e9; mx[i] = -1e9;
for (int j = i - 1; j >= 0; j--){
if (((A[i] - A[j]) & ans) == (A[i] - A[j])){
mn[i] = min(mn[i], mn[j] + 1);
mx[i] = max(mx[i], mx[j] + 1);
}
}
}
if (mn[n] > b or mx[n] < a)
ans += x;
}
cout<<ans<<endl;
}
# | 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... |