#543832 (C++17) No.1208 anti primenumber game

• 問題: No.1208 anti primenumber game
• ユーザー: chocopuu
• 提出日時: 2020-08-30 13:49:18
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 439 ms / 2,000 ms
• コード長: 5,073 bytes
• コンパイル時間: 2,510 ms
• コンパイル使用メモリ: 209,680 KB
• 実行使用メモリ: 51,604 KB
• 最終ジャッジ日時: 2023-08-09 12:02:28
• 合計ジャッジ時間: 12,202 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	2 ms; 4,380 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	1 ms; 4,376 KB
testcase_04	AC	1 ms; 4,384 KB
testcase_05	AC	2 ms; 4,384 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	1 ms; 4,380 KB
testcase_08	AC	1 ms; 4,380 KB
testcase_09	AC	1 ms; 4,380 KB
testcase_10	AC	1 ms; 4,384 KB
testcase_11	AC	2 ms; 4,380 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	1 ms; 4,376 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	108 ms; 39,220 KB
testcase_16	AC	108 ms; 38,880 KB
testcase_17	AC	108 ms; 38,892 KB
testcase_18	AC	108 ms; 38,960 KB
testcase_19	AC	108 ms; 39,012 KB
testcase_20	AC	108 ms; 39,188 KB
testcase_21	AC	196 ms; 51,340 KB
testcase_22	AC	195 ms; 51,292 KB
testcase_23	AC	162 ms; 51,308 KB
testcase_24	AC	439 ms; 51,416 KB
testcase_25	AC	439 ms; 51,596 KB
testcase_26	AC	432 ms; 51,392 KB
testcase_27	AC	433 ms; 51,472 KB
testcase_28	AC	428 ms; 51,596 KB
testcase_29	AC	429 ms; 51,288 KB
testcase_30	AC	189 ms; 50,276 KB
testcase_31	AC	176 ms; 48,772 KB
testcase_32	AC	140 ms; 51,304 KB
testcase_33	AC	167 ms; 51,300 KB
testcase_34	AC	367 ms; 51,364 KB
testcase_35	AC	368 ms; 51,424 KB
testcase_36	AC	281 ms; 41,096 KB
testcase_37	AC	369 ms; 51,328 KB
testcase_38	AC	213 ms; 51,348 KB
testcase_39	AC	210 ms; 51,488 KB
testcase_40	AC	341 ms; 51,344 KB
testcase_41	AC	148 ms; 51,292 KB
testcase_42	AC	178 ms; 51,304 KB
testcase_43	AC	176 ms; 51,604 KB
testcase_44	AC	172 ms; 51,492 KB
testcase_45	AC	169 ms; 51,360 KB
testcase_46	AC	145 ms; 46,068 KB

ソースコード

#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;
	
		
		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) - M;
				} else {
					ret = max(a[turn] - 1 + f(f, turn + 1, 1), a[turn] + f(f, turn + 1, 0) - M);
				}
			} else {
				if(a[turn] == 1) {
					ret = f(f, turn + 1, 1);
				} else {
					ret = min(1 + f(f, turn + 1, 0) - M, f(f, turn + 1, 1));
				}
			}
			return mp[{turn, isFirst}] = ret;
		};
		int sum = accumulate(ALL(a), 0) - M * N;
		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");
	*/
}