結果
問題 | No.2857 Div Array |
ユーザー |
👑 ![]() |
提出日時 | 2024-08-25 16:13:28 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 3,652 bytes |
コンパイル時間 | 2,446 ms |
コンパイル使用メモリ | 217,568 KB |
最終ジャッジ日時 | 2025-02-24 01:46:51 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}#include <atcoder/modint>using mint = atcoder::modint998244353;template<class T>using square_matrix=std::vector<std::vector<T>>;template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){int n=l.size();assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);square_matrix<T> val(n,std::vector<T>(n,add_e()));for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));}return val;}template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>square_matrix<T> pow_matrix(square_matrix<T> l,long long times){int n=l.size();square_matrix<T> val(n,std::vector<T>(n,add_e()));for(int i=0;i<n;i++) val[i][i]=mul_e();while(times){if(times&1){val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);}l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);times>>=1;}return val;}using mat_F=mint;mat_F add_op(mat_F a,mat_F b){return (a+b);}mat_F add_e(){return 0;}mat_F mul_op(mat_F a,mat_F b){return (a*b);}mat_F mul_e(){return 1;}#define calc mat_F,add_op,add_e,mul_op,mul_evoid solve();// CYAN / FREDERICint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;//cin >> t;rep(i, 0, t) solve();}void solve(){ll N, M, K;cin >> N >> M >> K;set<ll> s;rep(i, 1, M + 1){s.insert(M / i);}int L = s.size();map<ll, ll> m;vector<ll> X;for (auto x : s) m[x] = m.size(),X.push_back(x);vector<ll> C(L);rep(i, 1, M + 1) C[m[M / i]]++;vector base(L, vector<mint>(L));rep(i, 0, L) rep(j, 0, L){if (abs(X[i] - X[j]) <= K) base[i][j] = C[j];}auto tmp = pow_matrix<calc>(base, N - 1);mint ans = 0;rep(i, 0, L) rep(j, 0, L) ans += C[i] * tmp[i][j];cout << ans.val() << "\n";}