Submission #1327570

#TimeUsernameProblemLanguageResultExecution timeMemory
1327570tuncay_pashaBali Sculptures (APIO15_sculpture)C++20
9 / 100
1096 ms440 KiB
/**
 * author:  tuncypasha
 * file:    c.cpp
 * created: 22.02.2026 10:26
**/
#include <bits/stdc++.h>
#define pasha ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(v) begin(v), end(v)
using namespace std;

// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

constexpr int N = 1e+7 + 5, oo = 1e+16;

void _() {
  int n, l, r;
  cin >> n >> l >> r;
  vector<int> a(n);
  for (int i = 0; i < n; ++i)
    cin >> a[i];
  int ans = oo;
  for (int mask = 0; mask < (1LL << (n - 1)); ++mask) {
    int parts = __builtin_popcount(mask) + 1;
    if (parts > r || parts < l)
      continue;
    int sum = 0, cost = 0;
    for (int i = 0; i < n; ++i) {
      sum += a[i];
      if (i < n - 1 && (mask & (1LL << i))) {
        cost |= sum;
        sum = 0;
      }
    }
    cost |= sum;
    ans = min(ans, cost);
  }
  cout << ans << '\n';
}

signed main() {
  pasha
  int t = 1;
  // cin >> t;
  for (int cs = 1; cs <= t; ++cs) {
    _();
    // cout << '\n';
  }
}
#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...