# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48254 | arman_ferdous | Bali Sculptures (APIO15_sculpture) | C++17 | 24 ms | 32112 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 N = 2010;
const ll INF = 1e18+7e17;
int n, k, A, B;
ll arr[N], sum[N], dp[N][N];
int main() {
for(int i = 0; i < N; i++)
for(int j = 0; j < N; j++)
dp[i][j] = INF;
scanf("%d %d %d", &n, &A, &B);
for(int i = 1; i <= n; i++) {
scanf("%lld", &arr[i]);
sum[i] = sum[i-1] + arr[i];
dp[i][1] = sum[i];
}
for(int j = 2; j <= B; j++)
for(int i = 1; i <= n; i++)
for(int p = 1; p < i; p++)
dp[i][j] = min((dp[p][j-1]|(sum[i] - sum[p])),dp[i][j]);
ll ans = INF;
for(int i = A; i <= B; i++)
ans = min(ans, dp[n][i]);
printf("%lld\n", ans);
return 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... |