結果
問題 | No.1208 anti primenumber game |
ユーザー |
|
提出日時 | 2020-08-30 15:43:20 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 125 ms / 2,000 ms |
コード長 | 3,802 bytes |
コンパイル時間 | 2,563 ms |
コンパイル使用メモリ | 206,316 KB |
最終ジャッジ日時 | 2025-01-13 22:54:56 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 44 |
ソースコード
#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;}