# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207491 | DystoriaX | Bali Sculptures (APIO15_sculpture) | C++14 | 6 ms | 376 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;
int n, a, b;
int y[100010];
long long dp[1010][1010], pref[1010];
int main(){
scanf("%d%d%d", &n, &a, &b);
for(int i = 1; i <= n; i++){
scanf("%d", &y[i]);
pref[i] = y[i] + pref[i - 1];
}
for(int i = 0; i <= n; i++)
for(int j = 0; j <= n; j++)
dp[i][j] = 1e18;
dp[0][0] = 0;
for(int j = 1; j <= n; j++){
for(int i = j; i <= n; i++){
for(int k = j - 1; k < i; k++){
dp[i][j] = min(dp[i][j], dp[k][j - 1] | (pref[i] - pref[k]));
}
}
}
long long ans = 1e18;
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... |