# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597250 | Belphegor | Bali Sculptures (APIO15_sculpture) | C++14 | 268 ms | 3912 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;
int n,a,b;
ll arr[105];
ll subtask1(){
ll ans = INT64_MAX;
for(int i=1; i<(1<<n); i++){
vector<int>v;
for(int j=0; j<n; j++) if(i&(1<<j)) v.emplace_back(j);
if(v.back()!=n-1) continue;
if(v.size()<a || v.size()>b) continue;
ll ret = 0;
for(int j=0; j<=v[0]; j++) ret+=arr[j];
for(int j=1; j<v.size(); j++){
ll sum = 0;
for(int k=v[j-1]+1; k<=v[j]; k++) sum+=arr[k];
ret|=sum;
}
ans = min(ans,ret);
}
return ans;
}
int dp[55][22][1005];
int subtask2(){
for(int i=n; i>=1; i--) arr[i] = arr[i-1];
arr[0] = 0;
for(int i=1; i<=n; i++) arr[i]+=arr[i-1];
dp[0][0][0] = 1;
int ret = arr[n];
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
for(int val = 0; val<=1000; val++){
if(!dp[j][i][val]) continue;
for(int k=j+1; k<=n; k++){
int v = val | (arr[k]-arr[j]);
dp[k][i+1][v] = 1;
}
}
}
if(a<=i && i<=b){
for(int j=0; j<=1000; j++){
if(dp[n][i][j]) ret = min(ret,j);
}
}
}
return ret;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>n>>a>>b;
for(int i=0; i<n; i++) cin>>arr[i];
if(n<=20) cout<<subtask1();
else cout<<subtask2();
}
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... |