# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469966 | luciocf | Bali Sculptures (APIO15_sculpture) | C++14 | 1092 ms | 1356 KiB |
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;
typedef long long ll;
const int maxn = 2e3+10;
const ll inf = 1e18;
int n;
int a[maxn];
ll pref[maxn];
bool dp[maxn][maxn];
bool bad(ll s, ll mask, int pos)
{
for (int i = 60; i >= pos; i--)
if ((!(mask&(1ll<<i))) && (s&(1ll<<i)))
return 1;
return 0;
}
int main(void)
{
int A, B;
scanf("%d %d %d", &n, &A, &B);
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
pref[i] = pref[i-1] + 1ll*a[i];
}
ll mask = 0;
for (int b = 60; b >= 0; b--)
{
dp[0][0] = 1;
for (int i = 0; i <= n; i++)
for (int j = 1; j <= n; j++)
dp[i][j] = 0;
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = i; j >= 1; j--)
{
ll s = pref[i] - pref[j-1];
if (dp[k-1][j-1] && !bad(s, mask, b))
dp[k][i] = 1;
}
}
}
bool ok = 0;
for (int i = A; i <= B; i++)
if (dp[i][n])
ok = 1;
if (!ok) mask += (1ll<<b);
}
printf("%lld\n", mask);
}
Compilation message (stderr)
# | 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... |