# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111022 | _demon_ | Bali Sculptures (APIO15_sculpture) | C++14 | 3 ms | 384 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,x,y;
int a[109];
int inf=1000000009;
int dp[109][2100];
void memo(){
for(int i=1;i<=n;i++){
for(int j=0;j<=2100;j++){
dp[i][j]=inf;
}
}
dp[0][0]=0;
}
int main(){
cin>>n>>x>>y;
for(int i=1;i<=n;i++) cin>>a[i];
memo();
for(int i=1;i<=n;i++){
int sum=0;
for(int j=i;j>=1;j--){
sum+=a[j];
for(int k=0;k<=2050;k++){
if(dp[j-1][k]==inf) continue;
dp[i][sum|k]=min(dp[i][sum|k],dp[j-1][k]+1);
}
}
}
int ans=inf;
for(int i=1;i<=2050;i++){
if(dp[n][i]!=inf && dp[n][i]<=y){
cout<<i<<endl;
exit(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... |