結果
| 問題 |
No.2156 ぞい文字列
|
| コンテスト | |
| ユーザー |
 a16784542
|
| 提出日時 | 2022-12-09 22:06:30 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 9,322 bytes |
| コンパイル時間 | 4,590 ms |
| コンパイル使用メモリ | 260,288 KB |
| 最終ジャッジ日時 | 2025-02-09 08:11:54 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 16 |
ソースコード
#if !__INCLUDE_LEVEL__
#include __FILE__
//https://qiita.com/gnbrganchan/items/47118d45b3af9d5ae9a4
template<typename T>
struct mat {
// 行列m
vector<vector<T>> m;
// コンストラクタ:第1引数⇒行数、第2引数⇒列数、第3引数⇒初期値
mat():m(vector<vector<T>>()){}
mat(int h,int w):m(vector<vector<T>>(h,vector<T>(w))){}
mat(int h,int w, T d):m(vector<vector<T>>(h,vector<T>(w,d))){}
// 添字演算子
vector<T> operator[](const int i) const {return m[i];} //読み取り
vector<T>& operator[](const int i){return m[i];} //書き込み
// 行数・列数
int nrow = sz(m);
int ncol = sz(m[0]);
// 行列同士の演算
// constexpr mat& operator=(const mat& a){return *a;}
constexpr mat& operator+=(const mat& a){assert(ncol == a.ncol && nrow == a.nrow);rep(i,nrow)rep(j,ncol)m[i][j] += a[i][j]; return *this;}
constexpr mat& operator-=(const mat& a){assert(ncol == a.ncol && nrow == a.nrow);rep(i,nrow)rep(j,ncol)m[i][j] -= a[i][j]; return *this;}
constexpr mat& operator*=(const mat& a){assert(ncol == a.nrow);mat<T> m2(nrow, a.ncol, 0);rep(i,nrow)rep(j,a.ncol)rep(k,ncol)m2[i][j] += m[i][k]*a[k][j];ncol = a.ncol;rep(i,nrow)m[i].resize(ncol);rep(i,nrow)rep(j,ncol)m[i][j] = m2[i][j]; return *this;}
constexpr mat operator+(const mat& a) const noexcept { return mat(*this) += a;}
constexpr mat operator-(const mat& a) const noexcept { return mat(*this) -= a;}
constexpr mat operator*(const mat& a) const noexcept { return mat(*this) *= a;}
bool operator==(const mat& a){assert(ncol == a.ncol && nrow == a.nrow);bool flg = true;rep(i,nrow)rep(j,ncol)if(m[i][j] != a[i][j])flg = false; return flg;}
// 行列とスカラの演算
mat& operator+=(const T& a){rep(i,nrow)rep(j,ncol)m[i][j] += a;return *this;}
mat& operator-=(const T& a){rep(i,nrow)rep(j,ncol)m[i][j] -= a;return *this;}
mat& operator*=(const T& a){rep(i,nrow)rep(j,ncol)m[i][j] *= a;return *this;}
mat& operator/=(const T& a){rep(i,nrow)rep(j,ncol)m[i][j] /= a;return *this;}
mat operator+(const T& a) const { return mat(*this) += a;}
mat operator-(const T& a) const { return mat(*this) -= a;}
mat operator*(const T& a) const { return mat(*this) *= a;}
mat operator/(const T& a) const { return mat(*this) /= a;}
// 回転（degの数だけ時計回りに90度回転）
mat& rot(int deg){
mat<T> m2(ncol, nrow);
if(deg == 1 || deg == 3){
if(deg == 1)rep(i,nrow)rep(j,ncol)m2[j][nrow -i -1] = m[i][j];
if(deg == 3)rep(i,nrow)rep(j,ncol)m2[ncol -j -1][i] = m[i][j];
swap(ncol,nrow); // 列数と行数を入れ替える
m.resize(nrow);rep(i,nrow)m[i].resize(ncol); //リサイズ
}
if(deg == 2)rep(i,nrow)rep(j,ncol)m2[nrow -i -1][ncol -j -1] = m[i][j];
rep(i,nrow)rep(j,ncol)m[i][j] = m2[i][j];
return *this;
}
//累乗
void pow(ll n){
mat<T> m2=*this;
mat<T> res(ncol,nrow);
rep(i,ncol)res[i][i]=1;
while(n){
if(n&1){
res*=m2;
}
n>>=1;
m2*=m2;
}
*this=res;
return ;
}
// 標準出力
void show(){
rep(i,nrow)rep(j,ncol){
if(j != 0)cout << " ";
cout << m[i][j];
if(j==ncol-1)cout << endl;
}
return ;
}
};
// int sample(){
// mat<int> m(2,3,2),m2(3,2,1); // オブジェクトの作成
// V<mat<int>> g(10,mat<int>(3,3)); // 3*3行列*10個
// m[0][0] = 1; // 一部の要素を書き換え
// m.show(); // 表示
// cout << endl;
// mat<int> m3 = m * m2; // 行列同士の掛け算
// m3.show();
// cout << endl;
// m.rot(1); //時計回りに90度回転
// m.show();
// return 0;
// }
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;
}
};
// const int MOD = 1000000007;
const int MOD = 998244353;
using mint = Fp<MOD>;
struct Solver {
void solve() {
ll n;cin>>n;
mat<mint> m(4,4);
m[0][2]=m[1][3]=m[2][1]=m[3][0]=m[3][1]=1;
m[2][0]=2;
// m.show();
m.pow(n-2);
mat<mint> x(4,1);
x[0][0]=x[2][0]=x[3][0]=1;
m*=x;
// m.show();
mint ans=m[2][0]+m[3][0]-1;
cout<<ans<<endl;
return ;
}};
signed main() {
int ts = 1;
// scanf("%lld",&ts);
rep(ti,ts) {
Solver solver;
solver.solve();
}
return 0;
}
#else
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int ll
using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)
#define all(x) x.begin(),x.end()
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}
const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;
#endif