Submission #404554

#TimeUsernameProblemLanguageResultExecution timeMemory
404554sadBali Sculptures (APIO15_sculpture)C++14
16 / 100
36 ms16960 KiB
#include <bits/stdc++.h> #define ll long long #define fi first #define se second #define pb push_back using namespace std; const int N=100; int n,a,b;const int OR=1030; int vis[N][N][OR],aa[N]; void d(int ind,int o,int orr) { if(vis[ind][o][orr]==1)return; vis[ind][o][orr]=1; if(ind==n)return ;ll sum=0; for(int j=ind;j<n;j++) { sum+=aa[j]; d(j+1,o+1,orr|sum); } return; } int main() { cin>>n>>a>>b; for(int i=0;i<n;i++)cin>>aa[i]; d(0,0,0);int mn=1e9; for(int i=a;i<b+1;i++) { for(int j=OR;j>-1;j--) { if(vis[n][i][j]) { mn=min(mn,j); } } } cout<<mn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...