結果
問題 | No.3044 よくあるカエルさん |
ユーザー |
👑 |
提出日時 | 2025-02-28 23:07:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 4,954 bytes |
コンパイル時間 | 3,911 ms |
コンパイル使用メモリ | 260,328 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2025-02-28 23:07:33 |
合計ジャッジ時間 | 5,077 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 20 |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;} template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} using mint = modint998244353; // combination mod prime // https://youtu.be/8uowVvQ_-Mo?t=6002 // https://youtu.be/Tgd_zLfRZOQ?t=9928 struct modinv { int n; vector<mint> d; modinv(): n(2), d({0,1}) {} mint operator()(int i) { while (n <= i) d.push_back(-d[mint::mod()%n]*(mint::mod()/n)), ++n; return d[i]; } mint operator[](int i) const { return d[i];} } invs; struct modfact { int n; vector<mint> d; modfact(): n(2), d({1,1}) {} mint operator()(int i) { while (n <= i) d.push_back(d.back()*n), ++n; return d[i]; } mint operator[](int i) const { return d[i];} } facts; struct modfactinv { int n; vector<mint> d; modfactinv(): n(2), d({1,1}) {} mint operator()(int i) { while (n <= i) d.push_back(d.back()*invs(n)), ++n; return d[i]; } mint operator[](int i) const { return d[i];} } ifacts; mint comb(int n, int k) { if (n < k || k < 0) return 0; return facts(n)*ifacts(k)*ifacts(n-k); } // https://youtu.be/ylWYSurx10A?t=2352 template<typename T> struct Matrix : vector<vector<T>> { int h, w; Matrix(int h, int w, T val=0): vector<vector<T>>(h, vector<T>(w, val)), h(h), w(w) {} Matrix(initializer_list<initializer_list<T>> a) : vector<vector<T>>(a.begin(), a.end()){ assert(int(this->size()) >= 1); assert(int((*this)[0].size()) >= 1); h = this->size(); w = (*this)[0].size(); rep(i, h) assert(int((*this)[i].size()) == w); } Matrix& unit() { assert(h == w); rep(i,h) (*this)[i][i] = 1; return *this; } Matrix operator*=(const Matrix& M){ assert(w == M.h); Matrix r(h, M.w); rep(i,h) rep(k,w) rep(j, M.w){ r[i][j] += (*this)[i][k] * M[k][j]; } swap(*this, r); return *this; } Matrix operator*(const Matrix& M) const {return (Matrix(*this) *= M);} Matrix operator*=(const T& a) { for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) (*this)[i][j] *= a; return *this; } Matrix operator*(const T& a) const {return (Matrix(*this) *= a);} Matrix operator+=(const Matrix& M){ assert(h == M.h and w == M.w); for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) (*this)[i][j] += M[i][j]; return *this; } Matrix operator+(const Matrix& M) const {return (Matrix(*this) += M);} Matrix pow(long long t) const { assert(h == w); if (!t) return Matrix(h,h).unit(); if (t == 1) return *this; Matrix r = pow(t>>1);r = r*r; if (t&1) r = r*(*this); return r; } }; int main(){ int n, t; cin >> n >> t; int k, l; cin >> k >> l; Matrix<mint> mat(t, t); rep(i, t - 1) mat[i + 1][i]++; mat[0][0] += mint(1) * (k - 1) / 6; mat[0][1] += mint(1) * (l - k) / 6; mat[0][t - 1] += mint(1) * (7 - l) / 6; mat = mat.pow(n - 1); cout << mat[0][0] << "\n"; return 0; }