結果
問題 | No.1267 Stop and Coin Game |
ユーザー |
![]() |
提出日時 | 2020-10-23 22:15:14 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 4,517 bytes |
コンパイル時間 | 12,082 ms |
コンパイル使用メモリ | 286,248 KB |
最終ジャッジ日時 | 2025-01-15 13:14:21 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 43 |
ソースコード
#ifdef ONLINE_JUDGE#pragma GCC target("avx2,avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using i128 = __int128_t;using pii = pair<int, int>;using pll = pair<long long, long long>;#define rep(i, n) for (int i = 0; i < (n); i++)#define all(x) (x).begin(), (x).end()constexpr char ln = '\n';istream& operator>>(istream& is, __int128_t& x) {x = 0;string s;is >> s;int n = int(s.size()), it = 0;if (s[0] == '-') it++;for (; it < n; it++) x = (x * 10 + s[it] - '0');if (s[0] == '-') x = -x;return is;}ostream& operator<<(ostream& os, __int128_t x) {if (x == 0) return os << 0;if (x < 0) os << '-', x = -x;deque<int> deq;while (x) deq.emplace_front(x % 10), x /= 10;for (int e : deq) os << e;return os;}template<class T1, class T2>ostream& operator<<(ostream& os, const pair<T1, T2>& p) {return os << "(" << p.first << ", " << p.second << ")";}template<class T>ostream& operator<<(ostream& os, const vector<T>& v) {os << "{";for (int i = 0; i < int(v.size()); i++) {if (i) os << ", ";os << v[i];}return os << "}";}template<class Container> inline int SZ(Container& v) { return int(v.size()); }template<typename T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}inline int topbit(int x) { return x == 0 ? -1 : 31 - __builtin_clz(x); }inline int topbit(long long x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }inline int botbit(int x) { return x == 0 ? 32 : __builtin_ctz(x); }inline int botbit(long long x) { return x == 0 ? 64 : __builtin_ctzll(x); }inline int popcount(int x) { return __builtin_popcount(x); }inline int popcount(long long x) { return __builtin_popcountll(x); }inline int kthbit(long long x, int k) { return (x>>k) & 1; }inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }namespace detail {template<typename Tp, int Nb>auto make_vector(vector<int>& sizes, Tp const& x) {if constexpr (Nb == 1) {return vector(sizes[0], x);} else {int size = sizes[Nb-1];sizes.pop_back();return vector(size, make_vector<Tp, Nb-1>(sizes, x));}}}template<typename Tp, int Nb>auto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {vector<int> s(Nb);for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];return detail::make_vector<Tp, Nb>(s, x);}inline void print() { cout << "\n"; }template<class T>inline void print(const vector<T>& v) {for (int i = 0; i < int(v.size()); i++) {if (i) cout << " ";cout << v[i];}print();}template<class T, class... Args>inline void print(const T& x, const Args& ... args) {cout << x << " ";print(args...);}#ifdef MINATO_LOCALinline void debug_out() { cerr << endl; }template <class T, class... Args>inline void debug_out(const T& x, const Args& ... args) {cerr << " " << x;debug_out(args...);}#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////int main() {ll N,V; cin >> N >> V;vector<ll> A(N);rep(i,N) cin >> A[i];if (accumulate(all(A),0LL) <= V) {cout << "Draw" << ln;return 0;}vector<int> dp(1<<N,-1);auto rec=[&](auto self, int mask)->int {if (~dp[mask]) return dp[mask];ll s = 0;rep(i,N) if (kthbit(mask,i)) s += A[i];ll v = V - s;rep(i,N) {if (kthbit(mask,i)) continue;if (v >= A[i]) {if (!self(self,mask|(1<<i))) return dp[mask] = 1;}}return dp[mask] = 0;};cout << (rec(rec,0) ? "First" : "Second") << ln;}