Submission #49954

#TimeUsernameProblemLanguageResultExecution timeMemory
49954someone_aaBali Sculptures (APIO15_sculpture)C++17
0 / 100
4 ms664 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll dp[2100][2100]; int main() { ll n, a, b; cin>>n>>a>>b; ll arr[2100], pref[2100]; pref[0] = 0; for(int i=1;i<=n;i++) { cin>>arr[i]; pref[i] = pref[i-1] + arr[i]; } for(int i=1;i<=n;i++) { for(int j=1;j<=b;j++) { dp[i][j] = LLONG_MAX; for(int k=i;k>=1;k--) { if(j==1 && k == 1) dp[i][j] = pref[i] - pref[0]; else { if(i >= j && k >= j-1) { dp[i][j] = min(dp[i][j], dp[k-1][j-1] | (pref[i] - pref[k-1])); } } } } } ll result = LLONG_MAX; for(int i=a;i<=b;i++) { result = min(result, dp[n][i]); } cout<<result<<"\n"; return 0; }
#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...