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 lint = long long;
int N, A, B;
vector<lint> sum{0};
lint notbit = 0;
lint dp[105][105];
bool minimum(int now, int cnt){
if(now == N){
return (A <= cnt && cnt <= B);
}else if(dp[now][cnt] != -1){
return dp[now][cnt];
}
int ans = false;
for(int i = now + 1; i <= N; i++){
if(((sum[i] - sum[now]) & notbit) == 0){
ans |= minimum(i, cnt + 1);
}
}
return dp[now][cnt] = ans;
}
int dp2[2020];
int minimum2(int now){
if(now == N){
return 0;
}else if(dp2[now] != -1){
return dp2[now];
}
int ans = 1e9;
for(int i = now + 1; i <= N; i++){
if(((sum[i] - sum[now]) & notbit) == 0){
ans = min(ans, minimum2(i));
}
}
return dp2[now] = ans + 1;
}
int main(){
cin >> N >> A >> B;
for(int i = 0; i < N; i++){
lint Y;
cin >> Y;
lint item = sum.back() + Y;
sum.push_back(item);
}
for(int i = 59; i >= 0; i--){
notbit += (1l << i);
if(N <= 100){
memset(dp, -1, sizeof(dp));
if(!minimum(0, 0)){
notbit -= (1l << i);
}
}else{
memset(dp2, -1, sizeof(dp2));
if(minimum2(0) > B){
notbit -= (1l << i);
}
}
}
cout << (1l << 60) - 1 - notbit << endl;
}
Compilation message (stderr)
sculpture.cpp: In function 'bool minimum(int, int)':
sculpture.cpp:24:25: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
return dp[now][cnt] = 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... |