結果

問題 No.1208 anti primenumber game
ユーザー ningenMeningenMe
提出日時 2020-08-30 15:43:20
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 95 ms / 2,000 ms
コード長 3,802 bytes
コンパイル時間 3,178 ms
コンパイル使用メモリ 211,540 KB
実行使用メモリ 46,892 KB
最終ジャッジ日時 2023-08-09 14:17:04
合計ジャッジ時間 8,217 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
34,064 KB
testcase_01 AC 48 ms
34,052 KB
testcase_02 AC 48 ms
34,252 KB
testcase_03 AC 47 ms
34,292 KB
testcase_04 AC 48 ms
34,100 KB
testcase_05 AC 47 ms
34,316 KB
testcase_06 AC 48 ms
34,316 KB
testcase_07 AC 47 ms
34,160 KB
testcase_08 AC 48 ms
34,384 KB
testcase_09 AC 48 ms
34,288 KB
testcase_10 AC 49 ms
34,368 KB
testcase_11 AC 48 ms
34,224 KB
testcase_12 AC 47 ms
34,060 KB
testcase_13 AC 48 ms
34,284 KB
testcase_14 AC 47 ms
34,272 KB
testcase_15 AC 74 ms
46,780 KB
testcase_16 AC 76 ms
46,852 KB
testcase_17 AC 75 ms
46,836 KB
testcase_18 AC 75 ms
46,804 KB
testcase_19 AC 75 ms
46,772 KB
testcase_20 AC 75 ms
46,744 KB
testcase_21 AC 78 ms
46,852 KB
testcase_22 AC 78 ms
46,812 KB
testcase_23 AC 78 ms
46,748 KB
testcase_24 AC 95 ms
46,700 KB
testcase_25 AC 95 ms
46,700 KB
testcase_26 AC 93 ms
46,812 KB
testcase_27 AC 92 ms
46,748 KB
testcase_28 AC 94 ms
46,708 KB
testcase_29 AC 94 ms
46,788 KB
testcase_30 AC 82 ms
46,848 KB
testcase_31 AC 80 ms
46,700 KB
testcase_32 AC 79 ms
46,812 KB
testcase_33 AC 79 ms
46,708 KB
testcase_34 AC 77 ms
46,768 KB
testcase_35 AC 77 ms
46,852 KB
testcase_36 AC 71 ms
44,200 KB
testcase_37 AC 78 ms
46,752 KB
testcase_38 AC 92 ms
46,892 KB
testcase_39 AC 90 ms
46,768 KB
testcase_40 AC 93 ms
46,740 KB
testcase_41 AC 81 ms
46,772 KB
testcase_42 AC 80 ms
46,680 KB
testcase_43 AC 80 ms
46,700 KB
testcase_44 AC 82 ms
46,688 KB
testcase_45 AC 81 ms
46,696 KB
testcase_46 AC 76 ms
45,316 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = 1'000'000'000LL + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

auto dp = multivector(200001,2,2,HIGHINF);
vector<ll> A(200001);
ll N,M;

ll rec(int idx,int trn,int res) {
    if(idx == N) return 0;
    if(dp[idx][trn][res] != HIGHINF) return dp[idx][trn][res];

    //最大化
    if(trn == 0 && res == 0) {
        dp[idx][trn][res] = -LOWINF;
        chmax(dp[idx][trn][res],rec(idx+1,trn^1,1)-M+1);
    }
    if(trn == 0 && res == 1) {
        dp[idx][trn][res] = -LOWINF;
        if(A[idx] > 1) {
            chmax(dp[idx][trn][res],rec(idx,trn^1,0)+A[idx]-1);
            chmax(dp[idx][trn][res],rec(idx+1,trn^1,1)+A[idx]-M);
        }
        else {
            chmax(dp[idx][trn][res],rec(idx,trn,0));
        }
    }

    //最小化
    if(trn == 1 && res == 0) {
        dp[idx][trn][res] = LOWINF;
        chmin(dp[idx][trn][res],rec(idx+1,trn^1,1)+M-1);
    }
    if(trn == 1 && res == 1) {
        dp[idx][trn][res] = LOWINF;
        if(A[idx] > 1) {
            chmin(dp[idx][trn][res],rec(idx,trn^1,0)-(A[idx]-1));
            chmin(dp[idx][trn][res],rec(idx+1,trn^1,1)-(A[idx]+M));
        }
        else {
            chmin(dp[idx][trn][res],rec(idx,trn,0));
        }
    }
    return dp[idx][trn][res];
}

int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    cin >> N >> M;
    for(int i = 0; i < N; ++i) cin >> A[i];
    ll cnt = rec(0,0,1);
    cout << (cnt>0?"First":"Second") << endl;
    return 0;
}
0