# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31129 | nibnalin | Bali Sculptures (APIO15_sculpture) | C++14 | 0 ms | 17728 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;
const int maxn = int(2e3)+5, inf = int(1e9)+5;
int n, A[maxn], memo[maxn][maxn];
int DP(int idx, int p)
{
if(idx == n+1 && !p) return 0;
else if(p < 0) return inf;
else if(memo[idx][p] != -1) return memo[idx][p];
else
{
int res = inf;
for(int 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)
{
int a, b;
scanf("%d%d%d", &n, &a, &b);
for(int i = 0;i <= n;i++)
{
for(int j = 0;j <= n;j++) memo[i][j] = -1;
}
for(int i = 1;i <= n;i++) scanf("%d", &A[i]);
for(int i = 1;i <= n;i++) A[i] += A[i-1];
printf("%d\n", DP(1, b));
}
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... |