oj.uz

답안 #259526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259526 2020-08-08T01:21:35 Z KoD Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 1000 ms 508 KB 
#line 1 "main.cpp"

/**
 * @title Template
 */

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

#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 18 "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);
  for (auto &x: Y) {
    std::cin >> x;
  }
  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;
}

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 0 ms 256 KB Output is correct
4 Correct 1 ms 384 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 11 ms 256 KB Output is correct
10 Correct 10 ms 256 KB Output is correct
11 Correct 15 ms 256 KB Output is correct
12 Correct 14 ms 256 KB Output is correct
13 Correct 10 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 1 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 11 ms 368 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 11 ms 256 KB Output is correct
24 Correct 10 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 0 ms 372 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 9 ms 256 KB Output is correct
32 Correct 10 ms 256 KB Output is correct
33 Correct 10 ms 256 KB Output is correct
34 Correct 10 ms 256 KB Output is correct
35 Correct 10 ms 256 KB Output is correct
36 Correct 10 ms 384 KB Output is correct

Subtask #2
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 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 10 ms 256 KB Output is correct
9 Correct 10 ms 256 KB Output is correct
10 Correct 10 ms 256 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 12 ms 256 KB Output is correct
13 Correct 13 ms 384 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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 9 ms 256 KB Output is correct
22 Correct 9 ms 256 KB Output is correct
23 Correct 11 ms 256 KB Output is correct
24 Correct 10 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 22 ms 256 KB Output is correct
28 Correct 339 ms 508 KB Output is correct
29 Execution timed out 1090 ms 256 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 21.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 1 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 9 ms 256 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Correct 10 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 23 ms 256 KB Output is correct
15 Correct 341 ms 364 KB Output is correct
16 Execution timed out 1033 ms 256 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 25.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 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 9 ms 256 KB Output is correct
9 Correct 9 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 9 ms 256 KB Output is correct
13 Correct 10 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 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 11 ms 256 KB Output is correct
22 Correct 13 ms 256 KB Output is correct
23 Correct 10 ms 256 KB Output is correct
24 Correct 12 ms 256 KB Output is correct
25 Correct 9 ms 256 KB Output is correct
26 Correct 10 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 256 KB Output is correct
32 Correct 10 ms 256 KB Output is correct
33 Correct 9 ms 256 KB Output is correct
34 Correct 9 ms 256 KB Output is correct
35 Correct 10 ms 256 KB Output is correct
36 Correct 9 ms 256 KB Output is correct
37 Correct 21 ms 256 KB Output is correct
38 Correct 337 ms 256 KB Output is correct
39 Execution timed out 1087 ms 256 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 29.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 9 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 1 ms 256 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 10 ms 372 KB Output is correct
23 Correct 9 ms 256 KB Output is correct
24 Correct 21 ms 256 KB Output is correct
25 Correct 338 ms 256 KB Output is correct
26 Execution timed out 1093 ms 256 KB Time limit exceeded
27 Halted 0 ms 0 KB -