結果
問題 | No.1208 anti primenumber game |
ユーザー | chocopuu |
提出日時 | 2020-08-30 13:45:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 5,077 bytes |
コンパイル時間 | 2,850 ms |
コンパイル使用メモリ | 209,060 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-15 06:58:13 |
合計ジャッジ時間 | 5,499 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | AC | 1 ms
6,820 KB |
testcase_07 | AC | 2 ms
6,820 KB |
testcase_08 | AC | 2 ms
6,820 KB |
testcase_09 | AC | 2 ms
6,820 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,820 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | AC | 32 ms
6,816 KB |
testcase_17 | RE | - |
testcase_18 | AC | 32 ms
6,820 KB |
testcase_19 | AC | 32 ms
6,816 KB |
testcase_20 | AC | 31 ms
6,816 KB |
testcase_21 | AC | 33 ms
6,820 KB |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | AC | 106 ms
6,816 KB |
testcase_25 | AC | 106 ms
6,816 KB |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | AC | 95 ms
6,820 KB |
testcase_29 | AC | 100 ms
6,816 KB |
testcase_30 | RE | - |
testcase_31 | AC | 31 ms
6,820 KB |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | AC | 25 ms
6,820 KB |
testcase_37 | AC | 32 ms
6,816 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | RE | - |
testcase_41 | AC | 38 ms
6,816 KB |
testcase_42 | AC | 38 ms
6,816 KB |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
ソースコード
#include "bits/stdc++.h" using namespace std; #define int long long #define REP(i, n) for (int i = 0; i < (int)n; ++i) #define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i) #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i) #define ALL(a) a.begin(), a.end() #define IN(a, x, b) (a <= x && x < b) template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;} template<class T>inline void out(T t){cout << t << "\n";} template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);} template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;} template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;} constexpr int INF = 1e18; template<int MOD> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator - () const noexcept { return val ? MOD - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % MOD; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept { return os << x.val; } friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; template<class T> struct BiCoef { vector<T> fact_, inv_, finv_; constexpr BiCoef() {} constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { init(n); } constexpr void init(int n) noexcept { fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1); int MOD = fact_[0].getmod(); for(int i = 2; i < n; i++){ fact_[i] = fact_[i-1] * i; inv_[i] = -inv_[MOD%i] * (MOD/i); finv_[i] = finv_[i-1] * inv_[i]; } } constexpr T com(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n-k]; } constexpr T P(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[n-k]; } constexpr T fact(int n) const noexcept { if (n < 0) return 0; return fact_[n]; } constexpr T inv(int n) const noexcept { if (n < 0) return 0; return inv_[n]; } constexpr T finv(int n) const noexcept { if (n < 0) return 0; return finv_[n]; } }; const int MOD = 1000000007; // const int MOD = 998244353; using mint = Fp<MOD>; BiCoef<mint> bc; // bc.init(500050); struct UF{ vector<int>par,sz; void init(int n){ par.resize(n); sz.resize(n); for(int i=0;i<n;i++){ par[i]=i; sz[i]=1; } } int find(int x){ return x==par[x]?x:par[x]=find(par[x]); } void unite(int x,int y){ x=find(x);y=find(y); if(x==y)return; sz[x]+=sz[y]; par[y]=x; } bool same(int x,int y){ return find(x)==find(y); } int size(int x){ return sz[find(x)]; } }; signed main(){ int N, M; cin >> N >> M; vector<int>a(N); cin >> a; int f = 0, s = 0; int flg = 1; if(M == 0) { exit(EXIT_FAILURE); map<pair<int,int>, int>mp; auto dfs = [&](auto&&f, int turn, int isFirst) -> int { if(turn == N) return 0; if(mp.count({turn, isFirst})) { return mp[{turn, isFirst}]; } int ret = 0; if(isFirst) { if(a[turn] == 1) { ret = 1 + f(f, turn + 1, 0); } else { ret = max(a[turn] - 1 + f(f, turn + 1, 1), a[turn] + f(f, turn + 1, 0)); } } else { if(a[turn] == 1) { ret = f(f, turn + 1, 1); } else { ret = min(1 + f(f, turn + 1, 0), f(f, turn + 1, 1)); } } return mp[{turn, isFirst}] = ret; }; int sum = accumulate(ALL(a), 0); int fi = dfs(dfs, 0, 1); int se = sum - fi; if(fi > se) out("First"); else out("Second"); return 0; } REP(i, N) { if(flg) { if(a[i] == 1) { f += 1 - M; flg ^= 1; } else { f += a[i] - 1; s += 1 - M; } } else { if(a[i] == 1) { s += 1 - M; flg ^= 1; } else { s += a[i] - 1; f += 1 - M; } } } if(f > s) out("First"); else out("Second"); }