結果

問題 No.1267 Stop and Coin Game
コンテスト
ユーザー kei
提出日時 2020-10-23 22:54:00
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 307 ms / 2,000 ms
コード長 2,763 bytes
コンパイル時間 1,841 ms
コンパイル使用メモリ 179,732 KB
実行使用メモリ 19,200 KB
最終ジャッジ日時 2024-07-21 12:04:22
合計ジャッジ時間 4,079 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

template<class Type>
Type solve(Type res = Type()){
    int N; ll V;
    cin >> N >> V;
    vector<ll> A(N); for(auto& in:A) cin >> in;
    ll sumA = accumulate(A.begin(),A.end(),0LL);
    if(sumA <= V) return "Draw";

    
    map<pll,int> mp;

    function<int(int,ll)> dfs = [&](int state,ll leaf){
        int& ret = mp[pll(state,leaf)];

        if(ret != 0) return ret;
        
        bool win = false;
        for(int i = 0; i < N;i++){
            if((state >> i)&1) continue;
            if(leaf-A[i] < 0) continue;

            if(dfs(state + (1<<i),leaf-A[i]) == -1){
                win = true;
                break;
            }
        }

        if(win) ret = 1;
        else ret = -1;

        return ret;
    };

    int ret = dfs(0,V);
    if(ret == 1) return "First";
    else return "Second";
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    //solve<ll>(0);
    cout << fixed << setprecision(12) << solve<string>() << endl;
    return 0;
}
0