#589999 (C++17) No.1310 量子アニーリング

• 問題: No.1310 量子アニーリング
• ユーザー: 👑 Nachia
• 提出日時: 2020-12-07 00:15:23
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 10 ms / 2,000 ms
• コード長: 2,433 bytes
• コンパイル時間: 2,023 ms
• コンパイル使用メモリ: 204,052 KB
• 実行使用メモリ: 11,136 KB
• 最終ジャッジ日時: 2023-10-17 15:41:32
• 合計ジャッジ時間: 3,080 ms
• ジャッジサーバーID （参考情報）: judge12 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 9,912 KB
testcase_01	AC	4 ms; 9,912 KB
testcase_02	AC	4 ms; 9,912 KB
testcase_03	AC	4 ms; 9,912 KB
testcase_04	AC	4 ms; 9,912 KB
testcase_05	AC	5 ms; 9,912 KB
testcase_06	AC	4 ms; 9,912 KB
testcase_07	AC	5 ms; 9,912 KB
testcase_08	AC	5 ms; 9,916 KB
testcase_09	AC	4 ms; 9,916 KB
testcase_10	AC	5 ms; 9,920 KB
testcase_11	AC	5 ms; 9,924 KB
testcase_12	AC	5 ms; 9,964 KB
testcase_13	AC	6 ms; 10,080 KB
testcase_14	AC	7 ms; 10,344 KB
testcase_15	AC	7 ms; 10,344 KB
testcase_16	AC	8 ms; 10,344 KB
testcase_17	AC	9 ms; 10,872 KB
testcase_18	AC	10 ms; 11,136 KB
testcase_19	AC	7 ms; 10,344 KB
testcase_20	AC	6 ms; 9,912 KB
testcase_21	AC	5 ms; 9,912 KB
testcase_22	AC	10 ms; 11,136 KB
testcase_23	AC	7 ms; 10,080 KB

ソースコード

//#include<atcoder/all>
//using namespace atcoder;




#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0;i<(n);i++)

template<ULL M>
struct static_modint {
	ULL x;
	static_modint(ULL val = 0) : x(val) {}
	template<class intTy, enable_if_t<is_integral<intTy>::value&& is_unsigned<intTy>::value, void*> isUnsignedInt = nullptr>
	static static_modint mod_construct(intTy val) { return static_modint(val % M); }
	template<class intTy, enable_if_t<is_integral<intTy>::value&& is_signed<intTy>::value, void*> isSignedInt = nullptr>
	static static_modint mod_construct(intTy val) { LL buf = val % (LL)M; if (buf < 0) buf += M; return static_modint((ULL)buf); }

	static_modint operator-() const { if (x == 0) return 0; else return M - x; }
	static_modint& operator+=(static_modint r) { x += r.x; if (x >= M) x -= M; return *this; }
	static_modint operator+(static_modint r) const { static_modint res = x; return res += r; }
	static_modint& operator-=(static_modint r) { x += M - r.x; if (x >= M) x -= M; return *this; }
	static_modint operator-(static_modint r) const { static_modint res = x; return res -= r; }
	static_modint& operator*=(static_modint r) { x = x * r.x % M; return *this; }
	static_modint operator*(static_modint r) const { return static_modint(x * r.x % M); }
	static_modint pow(ULL r) const {
		if (r == 0) return static_modint(1);
		static_modint res = pow(r / 2);
		res *= res;
		if (r % 2) res *= *this;
		return res;
	}
	static_modint inv() const { return pow(M - 2); }
	static_modint& operator/=(static_modint r) { *this *= r.inv(); return *this; }
	static_modint operator/(static_modint r) const { return *this * r.inv(); }
	ULL& operator*() { return x; }
	const ULL& operator*() const { return x; }
	bool operator==(static_modint r) const { return x == *r; }
	bool operator!=(static_modint r) const { return x != *r; }
};

const ULL M=998244353;
using MLL = static_modint<M>;
const int Z=200000;
MLL F[Z+1], I[Z+1], iF[Z+1];
MLL P[Z+1];

int main(){
  int N; cin>>N;
  F[0]=I[1]=iF[0]=1;
  for(int i=1; i<=N; i++) F[i]=F[i-1]*i;
  for(int i=2; i<=N; i++) I[i]=-(MLL(M/i)*I[M%i]);
  for(int i=1; i<=N; i++) iF[i]=iF[i-1]*I[i];

  P[0]=1;
  for(int i=1; i<=N; i++) P[i]=P[i-1]*2;

  vector<MLL> C(N+1); rep(i,N+1) C[i]=F[N]*iF[i]*iF[N-i];
  MLL ans=0;
  for(int i=0; i<=N; i+=2) ans+=C[i]*P[abs(N-2*i)]*2;

  cout<<*ans<<endl;

  return 0;
}