# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45832 | Extazy | Bali Sculptures (APIO15_sculpture) | C++17 | 7 ms | 1380 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>
#define endl '\n'
using namespace std;
const int N = 2007;
const long long INF = 1000000000000007;
int n,a,b;
long long arr[N],ans;
bool used[N][N];
long long state[N][N];
long long recurse(int pos, int groups) {
if(pos>n) {
if(groups==0) return 0;
return INF;
}
if(used[pos][groups]) return state[pos][groups];
long long ans=INF;
int i;
for(i=pos;i<=n;i++) {
ans=min(ans,(arr[i]-arr[pos-1])|recurse(i+1,groups-1));
}
used[pos][groups]=true;
return state[pos][groups]=ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i;
scanf("%d %d %d", &n, &a, &b);
for(i=1;i<=n;i++) {
scanf("%lld", &arr[i]);
arr[i]+=arr[i-1];
}
ans=INF;
for(i=a;i<=b;i++) {
ans=min(ans,recurse(1,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... |