제출 #259569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259569		KoD	Bali Sculptures (APIO15_sculpture)	C++17	71 / 100	15 ms	1664 KiB

sculpture

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <queue>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"

template <class Func>
struct fix_point_impl: private Func {
  explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { }
  template <class... Args>
  constexpr decltype(auto) operator () (Args &&... args) const {
    return Func::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class Func>
constexpr decltype(auto) fix_point(Func &&func) {
  return fix_point_impl<Func>(std::forward<Func>(func));
}

/**
 * @title Lambda Recursion
 */
#line 19 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  i32 N, A, B;
  std::cin >> N >> A >> B;
  std::vector<i32> Y(N);
  i32 max_y = 0;
  for (auto &x: Y) {
    std::cin >> x;
    chmax(max_y, x);
  }
  if (N <= 20) {
    i64 ans = inf64;
    fix_point([&](auto dfs, i32 idx, i32 group, i64 sum, i64 acc) -> void {
      if (idx == N) {
        if (sum == 0 && A <= group && group <= B) {
          chmin(ans, acc);
        }
        return;
      }
      sum += Y[idx];
      dfs(idx + 1, group + 1, 0, acc | sum);
      dfs(idx + 1, group, sum, acc);
    })(0, 0, 0, 0);
    std::cout << ans << '\n';
    return 0;
  }
  if (N <= 50 && max_y <= 10) {
    std::vector<std::vector<std::array<bool, 501>>> dp(N + 1, std::vector<std::array<bool, 501>>(N + 1));
    for (auto i: range(0, N + 1)) {
      for (auto j: range(0, N + 1)) {
        dp[i][j].fill(false);
      }
    }
    dp[0][0][0] = true;
    for (auto i: range(0, N)) {
      for (auto k: range(0, N)) {
        for (auto acc: range(0, 501)) {
          if (!dp[i][k][acc]) {
            continue;
          }
          i32 sum = 0;
          for (auto j: range(i, N)) {
            sum += Y[j];
            dp[j + 1][k + 1][acc | sum] = true;
          }
        }
      }
    }
    i32 ans = inf32;
    for (auto k: range(A, B + 1)) {
      for (auto acc: range(0, 501)) {
        if (dp[N][k][acc]) {
          chmin(ans, acc);
        }
      }
    }
    std::cout << ans << '\n';
    return 0;
  }
  if (N <= 100 && max_y <= 20 && A == 1) {
    std::vector<std::array<i32, 2001>> dp(N + 1);
    for (auto &arr: dp) {
      arr.fill(inf32);
    }
    dp[0][0] = 0;
    for (auto i: range(0, N)) {
      for (auto acc: range(0, 2001)) {
        if (dp[i][acc] > B) continue;
        i32 sum = 0;
        for (auto j: range(i, N)) {
          sum += Y[j];
          chmin(dp[j + 1][acc | sum], dp[i][acc] + 1);
        }
      }
    }
    i32 ans = inf32;
    for (auto acc: range(0, 2001)) {
      if (dp[N][acc] <= B) {
        chmin(ans, acc);
      }
    }
    std::cout << ans << '\n';
    return 0;
  }
  if (N <= 100) {
    i64 make = 0;
    for (auto digit: rev(range(0, 37))) {
      std::vector<std::vector<bool>> dp(N + 1, std::vector<bool>(N + 1));
      dp[0][0] = true;
      for (auto i: range(0, N)) {
        for (auto k: range(0, N)) {
          if (!dp[i][k]) {
            continue;
          }
          i64 sum = 0;
          for (auto j: range(i, N)) {
            sum += Y[j];
            i64 tmp = sum & ~((i64(1) << digit) - 1);
            if ((make & tmp) == tmp) {
              dp[j + 1][k + 1] = true;
            }
          }
        }
      }
      bool ok = false;
      for (auto k: range(A, B + 1)) {
        if (dp[N][k]) {
          ok = true;
          break;
        }
      }
      if (!ok) {
        make |= i64(1) << digit;
      }
    }
    std::cout << make << '\n';
  }
  if (N <= 2000 && A == 1) {

  }
  return 0;
}

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