Submission #1340505

#TimeUsernameProblemLanguageResultExecution timeMemory
1340505ramzialoulouBali Sculptures (APIO15_sculpture)C++20
0 / 100
6 ms836 KiB
#include <bits/stdc++.h>
 
using namespace std;

const int N = 109;
const int MX = 1030;
const int inf = int(1e9);
int a[N];
int sum[N];
int dp[N][MX];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, A, B;
  cin >> n >> A >> B;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + a[i];
  }
  for (int i = 0; i <= n; i++) {
    for (int OR = 0; OR < MX; OR++) {
      dp[i][OR] = inf;
    }
  }
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < i; j++) {
      int s = sum[i] - sum[j];
      for (int OR = 0; OR < MX; OR++) {
        dp[i][OR | s] = min(dp[i][OR | s], dp[j][OR] + 1);
      }
    }
  }
  for (int OR = 0; OR < MX; OR++) {
    if (A <= dp[n][OR] && dp[n][OR] <= B) {
      cout << OR << '\n';
      return 0;
    }
  }
  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...