#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define bug cout << "bug" << endl
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pll pair <ll, ll>
#define pii pair <int, int>
#define triple pair <pair <ll, ll> , ll>
#define ull unsigned long long
#define ld long double
#define pinode pair <node*, node*>
const ll INF = 9e18 + 5;
const ll inf = 1e9 + 5;
const ll N = 100 + 5;
const ll shift = 2e6;
const ll mod = 998244353;
const ll mod2 = 1e9 + 9;
const ll M = 1e3 + 5;
const ll LOG = 21;
const ll sp = 263;
const ll sp2 = 9973;
const int block = 100;
const double eps = 1e-10;
ll n, a, b, Y[N], pref[N], max_value, ans = INF, mxY = 0, dp[N][N], dp2[2005];
bool match(ll bit, ll prefix, ll cur){
if((cur >> bit) & ((prefix >> bit) ^ (cur >> bit)) != 0)
return false;
return true;
}
int main(){
speed;
cin >> n >> a >> b;
for(int i = 1; i <= n; i++){
cin >> Y[i];
pref[i] = pref[i - 1] + Y[i];
}
ll current_bit_prefix = 0;
if(a == 1){
for(ll bit = 40; bit >= 0; bit--){
for(int i = 0; i <= n; i++){
dp2[i] = INF;
}
dp2[0] = 0;
for(int i = 1; i <= n; i++){
for(int j = 0; j < i; j++){
ll sum = pref[i] - pref[j];
if((1ll << bit) & sum)
continue;
if(!match(bit + 1, current_bit_prefix, sum))
continue;
dp2[i] = min(dp2[i], dp2[j] + 1);
}
}
if(dp2[n] <= b){
continue;
}else{
current_bit_prefix ^= (1ll << bit);
}
}
cout << current_bit_prefix << endl;
return 0;
}for(ll bit = 50; bit >= 0; bit--){
for(int i = 0; i <= n; i++){
for(int j = 0; j <= n; j++){
dp[i][j] = 0;
}
}
dp[0][0] = 1;
for(int i = 1; i <= n; i++){
for(int part = 0; part < n; part++){
for(int j = 0; j < i; j++){
ll sum = pref[i] - pref[j];
if(dp[j][part] == 0)
continue;
if(!match(bit + 1, current_bit_prefix, sum))
continue;
if((sum & (1ll << bit)))
continue;
dp[i][part + 1] = 1;
}
// if(bit == 0)
// cout << i << " " << part + 1 << " " << dp[i][part + 1] << endl;
}
}
// return 0;
int fl = 0;
for(int part = a; part <= b; part++){
if(dp[n][part]){
fl = 1;
break;
}
}
// cout << "F " << bit << " " << fl << endl;
if(fl)
continue;
current_bit_prefix ^= (1ll << bit);
}
cout << current_bit_prefix << endl;
}
Compilation message
sculpture.cpp: In function 'bool match(long long int, long long int, long long int)':
sculpture.cpp:35:53: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
35 | if((cur >> bit) & ((prefix >> bit) ^ (cur >> bit)) != 0)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
