結果

問題 No.1267 Stop and Coin Game
ユーザー stoqstoq
提出日時 2020-10-11 16:56:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 99 ms / 2,000 ms
コード長 3,253 bytes
コンパイル時間 1,968 ms
コンパイル使用メモリ 204,764 KB
実行使用メモリ 46,380 KB
最終ジャッジ日時 2023-09-28 00:23:18
合計ジャッジ時間 6,175 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
38,124 KB
testcase_01 AC 10 ms
38,124 KB
testcase_02 AC 10 ms
38,180 KB
testcase_03 AC 10 ms
38,312 KB
testcase_04 AC 11 ms
38,164 KB
testcase_05 AC 11 ms
38,276 KB
testcase_06 AC 10 ms
38,128 KB
testcase_07 AC 11 ms
38,148 KB
testcase_08 AC 19 ms
38,116 KB
testcase_09 AC 10 ms
38,172 KB
testcase_10 AC 97 ms
46,372 KB
testcase_11 AC 32 ms
40,184 KB
testcase_12 AC 13 ms
38,276 KB
testcase_13 AC 10 ms
38,172 KB
testcase_14 AC 11 ms
38,088 KB
testcase_15 AC 10 ms
38,140 KB
testcase_16 AC 99 ms
46,368 KB
testcase_17 AC 10 ms
38,200 KB
testcase_18 AC 10 ms
38,164 KB
testcase_19 AC 9 ms
38,120 KB
testcase_20 AC 10 ms
38,364 KB
testcase_21 AC 10 ms
38,172 KB
testcase_22 AC 10 ms
38,252 KB
testcase_23 AC 10 ms
38,128 KB
testcase_24 AC 46 ms
42,276 KB
testcase_25 AC 69 ms
42,340 KB
testcase_26 AC 10 ms
38,396 KB
testcase_27 AC 11 ms
38,312 KB
testcase_28 AC 10 ms
38,132 KB
testcase_29 AC 11 ms
38,136 KB
testcase_30 AC 80 ms
46,280 KB
testcase_31 AC 11 ms
38,188 KB
testcase_32 AC 19 ms
38,228 KB
testcase_33 AC 46 ms
42,432 KB
testcase_34 AC 65 ms
42,276 KB
testcase_35 AC 80 ms
46,380 KB
testcase_36 AC 10 ms
38,236 KB
testcase_37 AC 23 ms
38,180 KB
testcase_38 AC 85 ms
46,284 KB
testcase_39 AC 15 ms
38,272 KB
testcase_40 AC 10 ms
38,136 KB
testcase_41 AC 14 ms
38,112 KB
testcase_42 AC 10 ms
38,180 KB
testcase_43 AC 19 ms
38,172 KB
testcase_44 AC 10 ms
38,280 KB
testcase_45 AC 9 ms
38,188 KB
testcase_46 AC 10 ms
38,092 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#define MOD_TYPE 1

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-9;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init
{
  io_init()
  {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

int n;
ll V, a[20];
ll sum[1 << 22] = {};
int dp[1 << 22][2];

// turn(先手or後手)の必勝か
bool f(int msk, int turn)
{
  if (sum[msk] > V)
    return true;
  assert(msk != (1 << n) - 1);
  if (dp[msk][turn] != -1)
    return dp[msk][turn];
  rep(i, n)
  {
    if (msk & (1 << i))
      continue;
    if (!f(msk | (1 << i), !turn))
      return dp[msk][turn] = true;
  }
  return dp[msk][turn] = false;
}

void solve()
{
  Fill(dp, -1);
  cin >> n >> V;
  rep(i, n) cin >> a[i];
  if (accumulate(a, a + n, 0LL) <= V)
  {
    cout << "Draw\n";
    return;
  }
  rep(msk, 1 << n)
  {
    rep(i, n)
    {
      if (msk & (1 << i))
        sum[msk] += a[i];
    }
  }
  cout << (f(0, 0) ? "First\n" : "Second\n");
}

int main()
{
  solve();
}
0