結果

問題 No.1267 Stop and Coin Game
ユーザー packer_jppacker_jp
提出日時 2020-10-23 23:05:12
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 309 ms / 2,000 ms
コード長 3,807 bytes
コンパイル時間 2,334 ms
コンパイル使用メモリ 207,200 KB
実行使用メモリ 11,420 KB
最終ジャッジ日時 2023-09-28 17:45:24
合計ジャッジ時間 5,741 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 3 ms
4,380 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 13 ms
4,380 KB
testcase_09 AC 1 ms
4,376 KB
testcase_10 AC 162 ms
11,420 KB
testcase_11 AC 66 ms
5,160 KB
testcase_12 AC 14 ms
4,376 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 293 ms
11,292 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 3 ms
4,376 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 1 ms
4,380 KB
testcase_21 AC 1 ms
4,376 KB
testcase_22 AC 3 ms
4,384 KB
testcase_23 AC 2 ms
4,380 KB
testcase_24 AC 45 ms
7,144 KB
testcase_25 AC 231 ms
7,200 KB
testcase_26 AC 1 ms
4,376 KB
testcase_27 AC 4 ms
4,376 KB
testcase_28 AC 2 ms
4,504 KB
testcase_29 AC 2 ms
4,376 KB
testcase_30 AC 79 ms
11,220 KB
testcase_31 AC 4 ms
4,380 KB
testcase_32 AC 12 ms
4,380 KB
testcase_33 AC 40 ms
7,204 KB
testcase_34 AC 172 ms
7,328 KB
testcase_35 AC 77 ms
11,344 KB
testcase_36 AC 2 ms
4,376 KB
testcase_37 AC 51 ms
4,376 KB
testcase_38 AC 309 ms
11,352 KB
testcase_39 AC 25 ms
4,376 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 27 ms
4,376 KB
testcase_42 AC 1 ms
4,380 KB
testcase_43 AC 47 ms
4,380 KB
testcase_44 AC 1 ms
4,376 KB
testcase_45 AC 2 ms
4,380 KB
testcase_46 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a " = " << (a) << endl
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int sign(int a) { return (a > 0) - (a < 0); }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> void fin(T a) {
    cout << a << endl;
    exit(0);
}
template<typename T> T sq(T a) { return a * a; }
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template<typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "{";
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        os << *itr << (next(itr) != a.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

signed main() {
    int N, V;
    cin >> N >> V;
    vint A(N);
    rep(i, N) { cin >> A[i]; }
    if (V >= accumulate(all(A), 0LL)) { fin("Draw"); }
    vint dp(bit(N));
    rep(i, bit(N)) {
        int cur = 0, omin = V + 1;
        rep(j, N) {
            if (!(i & bit(j))) { cur += A[j]; }
            else { chmin(omin, A[j]); }
        }
        if (cur + omin > V) { continue; }
        auto mex = [](vint v) -> int {
            sort(all(v));
            uniq(v);
            rep(i, v.size()) {
                if (v[i] > i) { return i; }
            }
            return v.size();
        };
        vint v;
        rep(j, N) {
            if ((i & bit(j)) && cur + A[j] <= V) { v.emplace_back(dp[i & ~bit(j)]); }
        }
        dp[i] = mex(v);
    }
    if (dp[bit(N) - 1]) { cout << "First" << endl; }
    else { cout << "Second" << endl; }
}
0