結果

問題 No.1267 Stop and Coin Game
ユーザー KoDKoD
提出日時 2020-10-23 22:35:36
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 91 ms / 2,000 ms
コード長 3,779 bytes
コンパイル時間 739 ms
コンパイル使用メモリ 80,700 KB
実行使用メモリ 11,704 KB
最終ジャッジ日時 2023-09-28 16:42:52
合計ジャッジ時間 3,263 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 10 ms
4,376 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 84 ms
11,644 KB
testcase_11 AC 23 ms
5,444 KB
testcase_12 AC 5 ms
4,380 KB
testcase_13 AC 1 ms
4,380 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 91 ms
11,704 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 2 ms
4,376 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 2 ms
4,376 KB
testcase_21 AC 1 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 2 ms
4,380 KB
testcase_24 AC 36 ms
7,216 KB
testcase_25 AC 66 ms
7,352 KB
testcase_26 AC 2 ms
4,380 KB
testcase_27 AC 4 ms
4,380 KB
testcase_28 AC 3 ms
4,376 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 68 ms
11,512 KB
testcase_31 AC 2 ms
4,376 KB
testcase_32 AC 10 ms
4,380 KB
testcase_33 AC 34 ms
7,164 KB
testcase_34 AC 60 ms
7,268 KB
testcase_35 AC 68 ms
11,560 KB
testcase_36 AC 3 ms
4,380 KB
testcase_37 AC 16 ms
4,376 KB
testcase_38 AC 76 ms
11,520 KB
testcase_39 AC 8 ms
4,376 KB
testcase_40 AC 3 ms
4,380 KB
testcase_41 AC 7 ms
4,376 KB
testcase_42 AC 2 ms
4,376 KB
testcase_43 AC 11 ms
4,376 KB
testcase_44 AC 68 ms
11,436 KB
testcase_45 AC 2 ms
4,380 KB
testcase_46 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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/cpp_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/cpp_programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_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/cpp_programming/Library/other/fix_point.cpp"

#line 4 "/Users/kodamankod/Desktop/cpp_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 17 "main.cpp"

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

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

int main() {
  usize N;
  i64 V;
  std::cin >> N >> V;
  std::vector<i64> A(N);
  for (auto &x: A) {
    std::cin >> x;
  }
  std::vector<i64> sum(1 << N);
  for (auto set: range(0, 1 << N)) {
    for (auto i: range(0, N)) {
      if (set >> i & 1) {
        sum[set] += A[i];
      }
    }
  }
  if (sum.back() <= V) {
    std::cout << "Draw\n";
    return 0;
  }
  std::vector<bool> dp(1 << N);
  std::vector<bool> done(1 << N);
  std::cout << (fix_point([&](auto dfs, const usize set) -> bool {
    if (done[set]) {
      return dp[set];
    }
    done[set] = true;
    for (auto i: range(0, N)) {
      if (!(set >> i & 1)) {
        if (sum[set] + A[i] <= V && !dfs(set | (1 << i))) {
          return dp[set] = true;
        }
      }
    }
    return false;
  })(0) ? "First" : "Second") << '\n';
  return 0;
}
0