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 "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define de(x,y) cout<<#x<<" :"<<x<<y;
#define int long long
typedef pair<int,int> pii;
const int maxn = 1e2+5;
int arr[2005], ans = 0, n, A, B;
int pre[2005];
int two[60];
const int INF = 1e18;
void solve() {
int dp[maxn][maxn];
int digit = __lg(pre[n]);
for(int x=digit; x>=0; x--) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for(int i=1; i<=n; i++) {
for(int j=1; j<=i; j++) {
for(int k=0; k<i; k++) {
if(dp[k][j-1]) {
int tmp = pre[i] - pre[k];
if((tmp & (two[x])) == 0 &&((tmp>>(int)(x+1))|ans)==ans ) {
dp[i][j] = 1;
}
}
}
}
}
ans<<=1;
ans++;
for(int i=A; i<=B; i++) {
if(dp[n][i]) {
ans--;
break;
}
}
}
}
void solve2() {
int dp[2005];
dp[0] = 0;
int digit = __lg(pre[n]);
for(int x=digit; x>=0; x--) {
for(int i=1; i<=n; i++) {
dp[i] = INF;
}
dp[0] = 0;
for(int i=1; i<=n; i++) {
for(int j=0; j<i; j++) {
if(dp[j] < B) {
int tmp = pre[i] - pre[j];
if((tmp & (two[x])) == 0 &&((tmp>>(int)(x+1))|ans)==ans) {
dp[i] = min(dp[i], dp[j]+1);
}
}
}
}
ans <<= 1;
ans++;
if(dp[n] <= B)ans--;
}
}
main() {
// int n, A, B;
cin >> n >> A >> B;
two[0] = 1;
for(int i=1; i<60; i++) {
two[i] = two[i-1] * 2;
}
pre[0] = 0;
for(int i=1; i<=n; i++) {
cin >> arr[i];
pre[i] = pre[i-1] + arr[i];
}
if(n>100)solve2();
else
solve();
cout << ans << "\n";
}
Compilation message (stderr)
sculpture.cpp:70:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main() {
^
# | 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... |