結果
問題 | No.1267 Stop and Coin Game |
ユーザー |
![]() |
提出日時 | 2020-10-23 22:35:36 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 92 ms / 2,000 ms |
コード長 | 3,779 bytes |
コンパイル時間 | 2,772 ms |
コンパイル使用メモリ | 114,628 KB |
最終ジャッジ日時 | 2025-01-15 13:32:45 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 43 |
ソースコード
#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;}