oj.uz

답안 #259569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259569 2020-08-08T02:47:26 Z KoD Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 15 ms 1664 KB 
#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.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 9 ms 256 KB Output is correct
9 Correct 10 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 9 ms 256 KB Output is correct
12 Correct 9 ms 256 KB Output is correct
13 Correct 9 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 10 ms 256 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 9 ms 256 KB Output is correct
24 Correct 9 ms 256 KB Output is correct
25 Correct 11 ms 384 KB Output is correct
26 Correct 9 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 6 ms 256 KB Output is correct
31 Correct 9 ms 256 KB Output is correct
32 Correct 9 ms 256 KB Output is correct
33 Correct 10 ms 256 KB Output is correct
34 Correct 9 ms 256 KB Output is correct
35 Correct 9 ms 256 KB Output is correct
36 Correct 9 ms 256 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 256 KB Output is correct
9 Correct 10 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 12 ms 256 KB Output is correct
12 Correct 12 ms 256 KB Output is correct
13 Correct 10 ms 384 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 12 ms 256 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 10 ms 256 KB Output is correct
24 Correct 10 ms 256 KB Output is correct
25 Correct 12 ms 256 KB Output is correct
26 Correct 9 ms 256 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 2 ms 640 KB Output is correct
29 Correct 2 ms 1024 KB Output is correct
30 Correct 3 ms 1280 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 4 ms 1664 KB Output is correct
33 Correct 6 ms 1664 KB Output is correct
34 Correct 4 ms 1664 KB Output is correct
35 Correct 4 ms 1664 KB Output is correct
36 Correct 4 ms 1664 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 11 ms 256 KB Output is correct
9 Correct 11 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 11 ms 256 KB Output is correct
12 Correct 11 ms 256 KB Output is correct
13 Correct 12 ms 256 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 3 ms 1024 KB Output is correct
17 Correct 4 ms 1280 KB Output is correct
18 Correct 5 ms 1664 KB Output is correct
19 Correct 4 ms 1664 KB Output is correct
20 Correct 4 ms 1664 KB Output is correct
21 Correct 5 ms 1664 KB Output is correct
22 Correct 4 ms 1664 KB Output is correct
23 Correct 4 ms 1664 KB Output is correct
24 Correct 1 ms 768 KB Output is correct
25 Correct 2 ms 892 KB Output is correct
26 Correct 2 ms 896 KB Output is correct
27 Correct 2 ms 1024 KB Output is correct
28 Correct 3 ms 1152 KB Output is correct
29 Correct 2 ms 1152 KB Output is correct
30 Correct 1 ms 1152 KB Output is correct
31 Correct 3 ms 1152 KB Output is correct
32 Correct 3 ms 1152 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 11 ms 372 KB Output is correct
9 Correct 11 ms 256 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 11 ms 256 KB Output is correct
12 Correct 10 ms 256 KB Output is correct
13 Correct 10 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 10 ms 256 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 10 ms 256 KB Output is correct
24 Correct 9 ms 256 KB Output is correct
25 Correct 10 ms 256 KB Output is correct
26 Correct 9 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 6 ms 256 KB Output is correct
31 Correct 10 ms 380 KB Output is correct
32 Correct 9 ms 256 KB Output is correct
33 Correct 9 ms 256 KB Output is correct
34 Correct 11 ms 256 KB Output is correct
35 Correct 9 ms 256 KB Output is correct
36 Correct 9 ms 256 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 640 KB Output is correct
39 Correct 2 ms 1024 KB Output is correct
40 Correct 3 ms 1280 KB Output is correct
41 Correct 4 ms 1664 KB Output is correct
42 Correct 4 ms 1664 KB Output is correct
43 Correct 4 ms 1664 KB Output is correct
44 Correct 5 ms 1664 KB Output is correct
45 Correct 4 ms 1664 KB Output is correct
46 Correct 5 ms 1664 KB Output is correct
47 Correct 2 ms 768 KB Output is correct
48 Correct 2 ms 896 KB Output is correct
49 Correct 2 ms 896 KB Output is correct
50 Correct 2 ms 1024 KB Output is correct
51 Correct 4 ms 1152 KB Output is correct
52 Correct 2 ms 1152 KB Output is correct
53 Correct 2 ms 1152 KB Output is correct
54 Correct 3 ms 1152 KB Output is correct
55 Correct 3 ms 1152 KB Output is correct
56 Correct 2 ms 256 KB Output is correct
57 Correct 3 ms 256 KB Output is correct
58 Correct 4 ms 384 KB Output is correct
59 Correct 4 ms 256 KB Output is correct
60 Correct 4 ms 256 KB Output is correct
61 Correct 4 ms 256 KB Output is correct
62 Correct 6 ms 384 KB Output is correct
63 Correct 6 ms 256 KB Output is correct
64 Correct 15 ms 256 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 256 KB Output is correct
67 Correct 2 ms 256 KB Output is correct
68 Correct 3 ms 256 KB Output is correct
69 Correct 4 ms 256 KB Output is correct
70 Correct 4 ms 256 KB Output is correct
71 Correct 4 ms 256 KB Output is correct
72 Correct 5 ms 256 KB Output is correct
73 Correct 6 ms 384 KB Output is correct
74 Correct 5 ms 384 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 9 ms 256 KB Output is correct
9 Correct 13 ms 256 KB Output is correct
10 Correct 10 ms 256 KB Output is correct
11 Correct 9 ms 256 KB Output is correct
12 Correct 11 ms 256 KB Output is correct
13 Correct 9 ms 376 KB Output is correct
14 Correct 1 ms 416 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 6 ms 256 KB Output is correct
18 Correct 9 ms 256 KB Output is correct
19 Correct 10 ms 256 KB Output is correct
20 Correct 9 ms 256 KB Output is correct
21 Correct 10 ms 256 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 11 ms 384 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 2 ms 1024 KB Output is correct
27 Correct 3 ms 1280 KB Output is correct
28 Correct 5 ms 1664 KB Output is correct
29 Correct 4 ms 1664 KB Output is correct
30 Correct 4 ms 1664 KB Output is correct
31 Correct 4 ms 1664 KB Output is correct
32 Correct 4 ms 1664 KB Output is correct
33 Correct 4 ms 1664 KB Output is correct
34 Correct 1 ms 768 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 2 ms 896 KB Output is correct
37 Correct 2 ms 1024 KB Output is correct
38 Correct 2 ms 1152 KB Output is correct
39 Correct 2 ms 1152 KB Output is correct
40 Correct 1 ms 1152 KB Output is correct
41 Correct 3 ms 1152 KB Output is correct
42 Correct 4 ms 1280 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 3 ms 256 KB Output is correct
45 Correct 3 ms 256 KB Output is correct
46 Correct 4 ms 256 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 380 KB Output is correct
49 Correct 5 ms 256 KB Output is correct
50 Correct 6 ms 276 KB Output is correct
51 Incorrect 1 ms 256 KB Output isn't correct
52 Halted 0 ms 0 KB -