//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>
#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;
lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 0, -1, 0, 1, -1, -1, 1, 1, 0 };
int dy[] = { -1, 0, 1, 0, -1, 1, -1, 1, 0 };
const int N = 1e6 + 30;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 238;
const ld e = 1e-13;
lli bp(lli a, lli b = mod - 2LL)
{
lli ret = 1;
while (b)
{
if (b & 1) ret *= a, ret %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return ret;
}
ostream& operator<<(ostream& c, pir a)
{
c << a.fr << " " << a.sc;
return c;
}
struct pt
{
lli x, y;
int ind;
int bl;
bool operator==(const pt& a)
{
return ind == a.ind;
}
bool operator<(const pt& b)
{
if (x == b.x) return y < b.y;
return x < b.x;
}
};
int n, A, B;
lli a[N], dp[N], sm, ans;
bool check(lli sm)
{
lli sum = 0;
for (int i = 1; i <= n; i++) dp[i] = mod;
for (int i = 1; i <= n; i++)
{
sum = 0;
for (int j = i; j > 0; j--)
{
sum += a[j];
if((sum & sm) == 0) dp[i] = min(dp[i], dp[j - 1] + 1);
}
}
return dp[n] <= B;
}
lli dp1[2020][2020];
bool chk(lli sm)
{
lli sum = 0;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
dp1[i][j] = mod;
dp1[0][0] = 0;
for (int i = 1; i <= n; i++)
{
for (int k = 1; k <= n; k++)
{
sum = 0;
for (int j = i; j > 0; j--)
{
sum += a[i];
if ((sum & sm) == 0) dp1[i][k] = min(dp1[i][k], dp1[j - 1][k - 1] + 1);
}
}
}
for (int i = A; i <= B; i++)
{
if (dp1[n][i] < mod) return 1;
}
return 1;
}
int main()
{
fastio;
cin >> n >> A >> B;
for (int i = 1; i <= n; i++)
cin >> a[i];
if (A == 1)
{
for (int i = 50; i >= 0; i--)
{
if (chk(sm + (1LL << i))) sm += (1LL << i);
else ans += (1LL << i);
}
cout << ans << endl;
}
else
{
for (int i = 50; i >= 0; i--)
{
if (check(sm + (1LL << i))) sm += (1LL << i);
else ans += (1LL << i);
}
cout << ans << endl;
}
return 0;
}
/*
__
*(><)*
\/ /
||/
--||
||
/\
/ \
/ \
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
