Submission #1350604

#TimeUsernameProblemLanguageResultExecution timeMemory
1350604bakhtiyarnBali Sculptures (APIO15_sculpture)C++20
9 / 100
186 ms327680 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 100+5;
int a[N];
vector<int> dp[N][N];

// for(int i=1; i<=n; i++) 
void solve(){
  int n, L, R; cin >> n >> L >> R;
  for(int i=1; i<=n; i++) cin >> a[i];
  
  dp[0][0].push_back(0);
  for(int i=1; i<=n; i++) {
    for(int g=1; g<=R; g++){
      int sm = 0;
      for(int j=i; j>=1; j--){
        sm += a[j];
        for(int OR: dp[j-1][g-1]){
          dp[i][g].push_back(sm | OR);
        }
      }
    }
  }
  
  int mn = 1e18;
  for(int g=L; g<=R; g++){
    for(int OR: dp[n][g]) mn = min(mn, OR);
  }
  cout << mn;
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
#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...