# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31131 | nibnalin | Bali Sculptures (APIO15_sculpture) | C++14 | 0 ms | 33440 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;
lli n, a, b, A[maxn], memo[maxn][maxn];
lli DP(lli idx, lli p)
{
if(idx == n+1)
{
if(a <= p && p <= b) return 0;
else return inf;
}
else if(p > b) return inf;
else if(memo[idx][p] != -1) return memo[idx][p];
else
{
lli res = inf;
for(lli i = idx;i <= n;i++)
{
res = min(res, DP(i+1, p+1)|(A[i]-A[idx-1]));
}
//cout << idx << " " << p << " " << res << "\n";
return memo[idx][p] = res;
}
}
int main(void)
{
scanf("%lld%lld%lld", &n, &a, &b);
for(lli i = 0;i <= n;i++)
{
for(lli j = 0;j <= n;j++) memo[i][j] = -1;
}
for(lli i = 1;i <= n;i++) scanf("%lld", &A[i]);
for(lli i = 1;i <= n;i++) A[i] += A[i-1];
printf("%lld\n", DP(1, 0));
}
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... |