# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31135 | nibnalin | Bali Sculptures (APIO15_sculpture) | C++14 | 1000 ms | 33476 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 <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long int lli;
const lli maxn = lli(2e3)+5, inf = lli(1e14)+5, maxb = 50;
lli n, a, b, A[maxn], memo[maxn][maxn];
bool DP(lli idx, lli p, lli mask)
{
if(idx == n+1)
{
return (a <= p && p <= b);
}
else if(p > b) return 0;
else if(memo[idx][p] != -1) return memo[idx][p];
else
{
for(lli i = idx;i <= n;i++)
{
lli c = A[i]-A[idx-1];
if((mask|c) == mask && DP(i+1, p+1, mask))
{
memo[idx][p] = 1;
return 1;
}
}
memo[idx][p] = 0;
return 0;
}
}
int main(void)
{
scanf("%lld%lld%lld", &n, &a, &b);
for(lli i = 1;i <= n;i++) scanf("%lld", &A[i]);
for(lli i = 1;i <= n;i++) A[i] += A[i-1];
lli mask = (1ll<<maxb)-1;
for(lli i = maxb-1;i >= 0;i--)
{
for(lli i = 0;i <= n;i++)
{
for(lli j = 0;j <= b;j++) memo[i][j] = -1;
}
if(DP(1, 0, mask-(1ll<<i))) mask -= (1ll<<i);
}
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... |