結果
問題 | No.2857 Div Array |
ユーザー |
|
提出日時 | 2024-08-27 22:58:19 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 7,343 bytes |
コンパイル時間 | 6,068 ms |
コンパイル使用メモリ | 336,692 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-08-27 22:58:27 |
合計ジャッジ時間 | 7,478 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>namespace my{using namespace atcoder;using ml=modint998244353;auto&operator<<(std::ostream&o,const ml&x){return o<<x.val();}auto&operator>>(std::istream&i,ml&x){long long t;i>>t;x=t;return i;}void main();}int main(){my::main();}namespace my{#define eb emplace_back#define all(a) (a).begin(),(a).end()#define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__)#define LL(...) RD(ll,__VA_ARGS__)#define JO(a,b) a##b#define jo(a,b) JO(a,b)#define FE(v,e,...) for(au&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):v)#define FO(n) for(ll jo(i,__LINE__)=n;jo(i,__LINE__)-->0;)#define FOR(i,...) for(au[i,i##O,i##E]=rng(0,__VA_ARGS__);i<i##O;i+=i##E)#define fe(v,...) FE(v,__VA_ARGS__)#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))#define of(i,...) for(au[i,i##O,i##E]=rng(1,__VA_ARGS__);i>=i##O;i-=i##E)#define I template#define J class#define au auto#define rr returnusing namespace std;void solve();I<J A,J B>constexpr bool same=is_same_v<A,B>;using is=istream;using os=ostream;using dd=long double;using ll=long long;using ull=unsigned long long;using lll=__int128_t;using ulll=__uint128_t;using str=string;os&operator<<(os&o,const ulll&x){rr(x<10?o:o<<x/10)<<ll(x%10);}os&operator<<(os&o,const lll&x){rr o<<str(x<0,'-')<<ulll(x>0?x:-x);}constexpr dd ee=1e-12;constexpr ll oo=3e18;constexpr ll dx[]{-1,0,1,0,-1,1,1,-1},dy[]{0,-1,0,1,-1,-1,1,1};constexpr char sp=32,nl=10;au rng(bool s,ll a,ll b=oo,ll c=1){if(b==oo)b=a,(s?b:a)=0;rr tuple{a-s,b,c};}I<J T>T zz(T x){rr x<0?-x:x;}I<J T>ll len(const T&a){rr a.size();}I<J A,J B=A>struct cp{A a={};B b={};cp(){}cp(A a,B b):a(a),b(b){}cp(pair<A,B>p):a(p.first),b(p.second){}bool operator==(const cp&c)const{rr a==c.a&&b==c.b;}au operator<=>(const cp&c)const{rr a!=c.a?a<=>c.a:b<=>c.b;}friend is&operator>>(is&i,cp&c){rr i>>c.a>>c.b;}friend os&operator<<(os&o,const cp&c){rr o<<c.a<<sp<<c.b;}};using cl=cp<ll>;I<J A,J B=A,J C=A>struct tr{A a={};B b={};C c={};tr(){}tr(A a,B b,C c):a(a),b(b),c(c){}bool operator==(const tr&t)const{rr a==t.a&&b==t.b&&c==t.c;}au operator<=>(const tr&t)const{rr a!=t.a?a<=>t.a:b!=t.b?b<=>t.b:c<=>t.c;}friend is&operator>>(is&i,tr&t){rr i>>t.a>>t.b>>t.c;}friend os&operator<<(os&o,const tr&t){rr o<<t.a<<sp<<t.b<<sp<<t.c;}};using tl=tr<ll>;I<J T,size_t n>using ar=array<T,n>;I<J T,size_t n>os&operator<<(os&o,const ar<T,n>&a){fo(i,n)o<<a[i]<<str(i!=n-1,sp);rr o;}I<J T,J U=T>using map=std::map<T,U>;I<J T,J U>os&operator<<(os&o,const map<T,U>&m){fe(m,e)o<<e.first<<sp<<e.second<<nl;rr o;}I<J T,J U=T>using umap=unordered_map<T,U>;I<J T,J U>os&operator<<(os&o,const umap<T,U>&m){fe(m,e)o<<e.first<<sp<<e.second<<nl;rr o;}I<size_t n>using bset=bitset<n>;I<size_t n>os&operator<<(os&o,const bset<n>&b){fo(i,n)o<<b[i];rr o;}I<J...A>os&operator<<(os&o,const tuple<A...>&t){apply([&](const au&...a){ll i=sizeof...(a);(((o<<a<<str(--i>0,sp))),...);},t);rr o;}I<J T,J F>struct prique:priority_queue<T,vector<T>,F>{prique(const initializer_list<T>&a={}){fe(a,e)this->emplace(e);}prique(const vector<T>&a){fe(a,e)this->emplace(e);}T sum()const{au q=*this;T r{};while(len(q))r+=q.pot();rr r;}friend T bg(prique&q){rr q.top();}friend T pot(prique&q){T r=q.top();q.pop();rr r;}friend os&operator<<(os&o,prique q){while(len(q))o<<pot(q)<<str(len(q)>0,sp);rr o;}};I<J T>using qmax=prique<T,less<>>;I<J T>using qmin=prique<T,greater<>>;I<J V>struct ve;I<J V>constexpr bool isv=0;I<J V>constexpr bool isv<ve<V>> =1;I<J V>constexpr bool isv<vector<V>> =1;I<J V>au rawv(V){if constexpr(isv<V>)rr rawv(V(1)[0]);else rr V();}I<J V>struct ve:vector<V>{using vector<V>::vector;using T=decltype(rawv(V()));I<J U>ve(const vector<U>&v={}){static_assert(isv<V> ==isv<U>);fe(v,e)this->eb(e);}ve&operator+=(const ve&u){au&v=*this;fo(i,len(v))v[i]+=u[i];rr v;}ve operator+(const ve&u)const{rr ve(*this)+=u;}ve&operator-=(const ve&u){au&v=*this;fo(i,len(v))v[i]-=u[i];rr v;}ve operator-(const ve&u)const{rr ve(*this)-=u;}ve&operator^=(const ve&u){fe(u,e)this->eb(e);rr*this;}ve operator^(const ve&u)const{rr ve(*this)^=u;}ve&operator+=(const T&x){au&v=*this;fe(v,e)e+=x;rr v;}ve operator+(const T&x)const{rr ve(*this)+=x;}ve&operator-=(const T&x){au&v=*this;fe(v,e)e-=x;rr v;}ve operator-(const T&x)const{rr ve(*this)-=x;}ve&operator*=(const T&x){au&v=*this;fe(v,e)e*=x;rr v;}ve operator*(const T&x)const{rr ve(*this)*=x;}ve&operator++(){rr*this+=1;}ve&operator--(){rr*this-=1;}ve operator-()const{rr ve(*this)*=-1;}I<size_t n>au&operator+=(const bset<n>&a){fo(i,n)(*this)[i]+=a[i];rr*this;}I<size_t n>au&operator-=(const bset<n>&a){fo(i,n)(*this)[i]-=a[i];rr*this;}au lower_bound(const V&x)const{rr std::lower_bound(all(*this),x);}au upper_bound(const V&x)const{rr std::upper_bound(all(*this),x);}I<J F>au scan(F f)const{cp<T,bool>r;fe(*this,e)if constexpr(!isv<V>)r.b?f(r.a,e),r:r={e,1};else if(au s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;rr r;}T sum()const{rr scan([](T&a,const T&b){a+=b;}).a;}friend is&operator>>(is&i,ve&v){fe(v,e)i>>e;rr i;}friend os&operator<<(os&o,const ve&v){fe(v,e)o<<e<<str(&e!=&v.back(),isv<V>?nl:sp);rr o;}};I<J T=ll,size_t n,size_t i=0>au vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)rr ve<T>(s[i],x);else{au X=vec<T,n,i+1>(s,x);rr ve<decltype(X)>(s[i],X);}}I<ll n,J...A>void setsize(const ll(&l)[n],A&...a){((a=vec(l,rawv(a))),...);}I<J T>using v2=ve<ve<T>>;using u1=ve<ll>;using u2=v2<ll>;using graph=v2<cl>;void io(){cin.tie(0)->sync_with_stdio(0);cout<<fixed<<setprecision(15);cerr<<nl;}I<J...A>void li(A&...a){(cin>>...>>a);}I<char c=sp,J...A>void pp(const A&...a){ll i=sizeof...(a);((cout<<a<<str(--i>0,c)),...);cout<<nl;}ll flo_sqr(ll x){ll r=sqrt(zz(x-ee));while(r+1<=x/(r+1))++r;rr r;}I<J F>struct rec:F{rec(F&&f):F(std::forward<F>(f)){}I<J...A>decltype(au)operator()(A&&...a)const{rr F::operator()(*this,std::forward<A>(a)...);}};auto floor_range(ll n){ve<tuple<ll,ll,ll>>r;ll m=flo_sqr(n),l=n/(m+1);fo(i,1,m+1)r.eb(n/i,i,i+1);of(i,l+1,1)r.eb(i,n/(i+1)+1,n/i+1);return r;}template<class T>struct matrix:ve<ve<T>>{matrix(ll n){this->resize(n,ve<T>(n));}matrix(ll n,ll m,T x={}){this->resize(n,ve<T>(m,x));}ll h()const{return len(*this);}ll w()const{return len((*this)[0]);}matrix operator*(const matrix&m)const{return matrix{*this}*=m;}matrix&operator*=(const matrix&m){assert(w()==m.h());matrix r(h(),m.w());fo(i,h())fo(k,w())fo(j,m.w())r[i][j]+=(*this)[i][k]*m[k][j];swap(*this,r);return*this;}friend ve<T>operator*(const ve<T>&v,const matrix&m){assert(len(v)==m.h());ve<T>r(m.w());fo(i,m.h())fo(j,m.w())r[i]+=v[i]*m[i][j];rr r;}matrix pow(ll n){matrix x=*this,r(h());fo(i,len(r))r[i][i]=1;while(n)n&1?r*=x:r,x*=x,n>>=1;return r;}void transpose(){matrix r(w(),h());fo(i,h())fo(j,w())r[j][i]=(*this)[i][j];swap(*this,r);}};void main(){io();ll T=1;fo(T)solve();}void solve(){LL(N,M,K);au fr=floor_range(M);ll C=len(fr);ve<ml>cnt;fe(fr,x,l,r)cnt.eb(r-l);matrix<ml>A(C);fo(i,C){fo(j,C){if(zz(get<0>(fr[i])-get<0>(fr[j]))<=K){A[i][j]=cnt[i];}}}(A=A.pow(N-1)).transpose();cnt=cnt*A;pp(cnt.sum());}}