제출 #1130769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130769		Champ_Naman	Bali Sculptures (APIO15_sculpture)	C++17	9 / 100	375 ms	327680 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define nl '\n'

vector<int> dp[101][101];

inline void solve(){
   int n, a, b;
   cin>>n>>a>>b;

   int c[n+1], sum = 0;
   for(int i=1; i<=n; i++){
      cin>>c[i];
      sum += c[i];

      dp[i][1].push_back(sum);
   }

   for(int k=2; k<=b; k++){
      for(int i=1; i<=n; i++){
         int sm = 0;
         for(int j=i; j>0; j--){
            sm += c[j];

            for(int x : dp[j-1][k-1]){
               dp[i][k].push_back(sm | x);
            }
         }
      }
   }

   int ans = 1e18;
   for(int i=a; i<=b; i++) ans = min(ans, *min_element(dp[n][i].begin(), dp[n][i].end()));
   cout<<ans;
}

signed main(){
   ios_base::sync_with_stdio(0);
   cin.tie(NULL);cout.tie(NULL);

   int t = 1;
   //cin>>t;
   while(t--) solve();

   return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29