# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49910 | kjain_1810 | Bali Sculptures (APIO15_sculpture) | C++14 | 3 ms | 724 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;
const int N=1e2+5;
int arr[N], dp[N][N], n, m, A, B, pref[N];
//dp[i][j]==dividing first i numbers in j parts
int main()
{
scanf("%d%d%d", &n, &A, &B);
for(int a=1; a<=n; a++)
scanf("%d", &arr[a]);
for(int a=1; a<=n; a++)
pref[a]=pref[a-1]+arr[a];
for(int a=1; a<=n; a++)
dp[a][1]=pref[a];
int ans=INT_MAX;
if(A==1)
ans=dp[n][1];
for(int a=2; a<=B; a++)
{
for(int b=a; b<=n; b++)
{
dp[b][a]=INT_MAX;
for(int c=b-1; c>=a-1; c--)
dp[b][a]=min(dp[b][a], dp[c][a-1]|(pref[b]-pref[c]));
}
if(a>=A)
ans=min(ans, dp[n][a]);
}
printf("%d\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... |