#943001 (C++17) No.2600 Avator Height

• 問題: No.2600 Avator Height
• ユーザー: ゆにぽけ
• 提出日時: 2024-01-12 21:24:06
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 50 ms / 2,000 ms
• コード長: 3,006 bytes
• コンパイル時間: 1,334 ms
• コンパイル使用メモリ: 129,192 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-27 21:03:50
• 合計ジャッジ時間: 5,088 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 5,248 KB
testcase_01	AC	46 ms; 5,376 KB
testcase_02	AC	45 ms; 5,376 KB
testcase_03	AC	44 ms; 5,376 KB
testcase_04	AC	45 ms; 5,376 KB
testcase_05	AC	45 ms; 5,376 KB
testcase_06	AC	45 ms; 5,376 KB
testcase_07	AC	44 ms; 5,376 KB
testcase_08	AC	47 ms; 5,376 KB
testcase_09	AC	45 ms; 5,376 KB
testcase_10	AC	47 ms; 5,376 KB
testcase_11	AC	46 ms; 5,376 KB
testcase_12	AC	45 ms; 5,376 KB
testcase_13	AC	45 ms; 5,376 KB
testcase_14	AC	45 ms; 5,376 KB
testcase_15	AC	45 ms; 5,376 KB
testcase_16	AC	47 ms; 5,376 KB
testcase_17	AC	46 ms; 5,376 KB
testcase_18	AC	45 ms; 5,376 KB
testcase_19	AC	49 ms; 5,376 KB
testcase_20	AC	48 ms; 5,376 KB
testcase_21	AC	48 ms; 5,376 KB
testcase_22	AC	50 ms; 5,376 KB
testcase_23	AC	45 ms; 5,376 KB
testcase_24	AC	29 ms; 5,376 KB
testcase_25	AC	39 ms; 5,376 KB

ソースコード

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
/* using mint = modint<1000000007>; */
void solve()
{
	vector<mint> R(2 << 17),E(2 << 17);
	R[1] = 1,R[2] =1;
	E[1] = 1,E[2] = 3;
	for(int i = 3;i < 2 << 17;i++) R[i] = R[i - 1] + R[i - 2];
	for(int i = 3;i < 2 << 17;i++) E[i] = E[i - 1] + E[i - 2];
	int Q;
	cin >> Q;
	for(;Q--;)
	{
		int N;
		cin >> N;
		cout << 5 * R[N] * R[N] - E[N] * E[N] << "\n";
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}