# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74278 | Vardanyan | Bali Sculptures (APIO15_sculpture) | C++14 | 86 ms | 94996 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.
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int A[N];
int K;
int n;
vector<long long> dp[N][N];
int main()
{
int a,b;
scanf("%d%d%d",&n,&a,&b);
for(int i = 1;i<=n;i++) scanf("%d",&A[i]);
long long c = 0;
for(int i = 1;i<=n;i++){
c+=A[i];
dp[i][1].push_back(c);
}
long long ans = 10000000000000007;
for(int k = 2;k<=b;k++){
for(int i = k;i<=n;i++){
c = A[i];
for(int j = i-1;j>=1;j--){
for(int q = 0;q<dp[j][k-1].size();q++){
dp[i][k].push_back(dp[j][k-1][q]|c);
if(k>=a && i == n) ans = min(ans,dp[j][k-1][q]|c);
}
c+=A[j];
}
}
}
cout<<ans<<endl;
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... |