結果
問題 | No.2857 Div Array |
ユーザー |
👑 |
提出日時 | 2024-08-25 14:17:27 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 4,182 bytes |
コンパイル時間 | 4,059 ms |
コンパイル使用メモリ | 265,864 KB |
最終ジャッジ日時 | 2025-02-24 01:08:11 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#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;ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}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<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" : " "); returnos;}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){returntrue;}); 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;// https://youtu.be/ylWYSurx10A?t=2352template<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, m, k;cin >> n >> m >> k;map<int, int> ma;for(int x = 1; x <= m; x++) ma[m / x]++;int sz = ma.size();Matrix<mint> mat(sz, sz);map<int, int> inv;{int idx = 0;for(auto [x, cnt] : ma){inv[x] = idx;idx++;}}for(auto [x1, cnt1] : ma){for(int x2 = x1 - k; x2 <= x1 + k; x2++){if(inv.find(x2) != inv.end()) mat[inv[x2]][inv[x1]] += ma[x2];}}vector<mint> vec;for(auto [x, cnt] : ma) vec.push_back(cnt);mint ans = 0;mat = mat.pow(n - 1);rep(i, sz) rep(j, sz){ans += mat[i][j] * vec[j];}cout << ans << "\n";return 0;}