#894305 (C++23) No.2388 At Least K-Characters

提出ソース

結果

問題	No.2388 At Least K-Characters
ユーザー	eQe
提出日時	2023-07-21 23:12:55
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	MLE
実行時間	-
コード長	10,033 bytes
コンパイル時間	7,069 ms
コンパイル使用メモリ	335,972 KB
実行使用メモリ	542,424 KB
最終ジャッジ日時	2024-07-05 04:04:51
合計ジャッジ時間	26,780 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	5 ms 6,940 KB
testcase_14	AC	5 ms 6,940 KB
testcase_15	AC	4 ms 6,940 KB
testcase_16	MLE	-
testcase_17	MLE	-
testcase_18	MLE	-
testcase_19	MLE	-
testcase_20	MLE	-
testcase_21	MLE	-
testcase_22	MLE	-
testcase_23	MLE	-
testcase_24	MLE	-
testcase_25	MLE	-
testcase_26	MLE	-
testcase_27	MLE	-
testcase_28	MLE	-
testcase_29	MLE	-
testcase_30	MLE	-
testcase_31	MLE	-
testcase_32	MLE	-
testcase_33	MLE	-
testcase_34	MLE	-
testcase_35	MLE	-
testcase_36	MLE	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: In function 'my::vo my::solve()':
main.cpp:126:10: warning: '*r' may be used uninitialized [-Wmaybe-uninitialized]
  126 |   dp[0][0][1]=1;
      |          ^

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define ep emplace
#define eb emplace_back
#define all(a) begin(a),end(a)
#define wh(...) while(__VA_ARGS__)
#define ef(...) else if(__VA_ARGS__)
#define done(...) rr pp(__VA_ARGS__)
#define LL(...) RD(ll,__VA_ARGS__)
#define ST(...) RD(str,__VA_ARGS__)
#define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__)
#define UL(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__)
#define UV(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);vi(__VA_ARGS__)
#define SS(n,...) strs __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__)
#define U2(n,m,...) u2 __VA_ARGS__;resize({n,m},__VA_ARGS__);li(__VA_ARGS__)
#define inner_fe(v,e,...) for(au&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__)__VA_OPT__(]):v)
#define inner_fo(n) for(ll join(__,__LINE__)=n;join(__,__LINE__)-->0;)
#define inner_for(i,...) for(au[i,i##stop,i##step]=rng_fo(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fe(...) inner_fe(__VA_ARGS__)
#define fo(i,...) inner_fo##__VA_OPT__(r)(i __VA_OPT__(,__VA_ARGS__))
#define of(i,...) for(au[i##stop,i,i##step]=rng_fo(1,__VA_ARGS__);i>=i##stop;i-=i##step)
#define debug(...) pp(#__VA_ARGS__,__VA_ARGS__)
#define join(s,t) inner_join(s,t)
#define inner_join(s,t) s##t
#define I(...) template<__VA_ARGS__>
#define J typename
#define O operator
#define au auto
#define cs const
#define ifc if constexpr
#define rr return
#define uu using
namespace my{uu vo=void;vo main();vo solve();}int main(){my::main();}namespace my{uu namespace std;uu is=istream;uu os=ostream;
uu bo=bool;uu dd=long double;uu ll=long long;uu ull=unsigned long long;uu lll=__int128_t;uu ulll=__uint128_t;I(J T)uu vt=J T::value_type;
I(J T)uu ilis=initializer_list<T>;I(J T)uu v1=vector<T>;I(J T)uu v2=v1<v1<T>>;uu u1=v1<ll>;uu u2=v2<ll>;uu str=string;uu strs=v1<str>;
uu namespace atcoder;uu ml=modint998244353;is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<<x.val();}uu m1=v1<ml>;
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){}cp O-()cs{rr cp(-a,-b);}
  cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}bo O<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}
  cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}
  bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}
};uu cl=cp<ll>;uu cls=v1<cl>;I(J T)uu qmax=priority_queue<T>;I(J T)uu qmin=priority_queue<T,v1<T>,greater<>>;I(J T)T sq(T a){rr a*a;}
I(J T)struct set:std::set<T>{set(v1<T>a={}){fe(a,e)this->ep(e);}};I(J T)struct uset:unordered_set<T>{uset(v1<T>a={}){fe(a,e)this->ep(e);}};
I(J T)struct mset:multiset<T>{mset(v1<T>a={}){fe(a,e)this->ep(e);}vo erase(cs T&x){if(this->contains(x))multiset<T>::erase(this->find(x));}};
I(J T,J U=T)uu map=std::map<T,U>;I(J T,J U=T)uu umap=unordered_map<T,U>;str Yes(bo y=1){rr y?"Yes":"No";}str No(){rr Yes(0);}
ll oo=3e18;dd ee=1e-12;u1 dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1};str sp=" ",nc="",nl="\n";I(J T)ll len(cs T&a){rr a.size();}
ll rnd(ll l,ll r=oo){static ull x=76,y=53,z=20,w=41;ull t=x^(x<<11);x=y,y=z,z=w,w=(w^(w>>19))^(t^(t>>8));if(r==oo)r=l,l=0;rr w%(r-l)+l;}
ll l2(ulll x){x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}bo odd(ll x){rr x&1;}ll pwm1(ll x){rr 1-2*(x&1);}I(J T)bo at(T x,ll i){rr x>>i&1;}
ll l10(ulll x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;}bo eve(ll x){rr~x&1;}ll pw2(ll n){rr 1LL<<n;}I(J T,J U,J V)bo in(T l,U x,V r){rr l<=x&&x<r;}
I(J T)T flo(T x,T y){rr y<0?x=-x,y=-y:x>=0?x/y:(x+1)/y-1;}array<ll,3>rng_fo(bo s,ll a,ll b=oo,ll c=1){if(b==oo)b=a,a=0;rr{a,b-s,c};}
I(J T)T cei(T x,T y){rr y<0?x=-x,y=-y:x<=0?x/y:(x-1)/y+1;}I(J T)T zz(T x){rr x<0?-x:x;}I(J T)bo add(T&a,cs T&b){rr a+=b;}

I(J T)au&O+=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]+=u[i];rr v;}I(J T)au O+(v1<T>v,cs v1<T>&u){rr v+=u;}I(J T)constexpr bo isv=0;
I(J T)au&O-=(v1<T>&v,cs v1<T>&u){fo(i,len(v))v[i]-=u[i];rr v;}I(J T)au O-(v1<T>v,cs v1<T>&u){rr v-=u;}I(J T)constexpr bo isv<v1<T>> =1;
I(J T,J U)au&O+=(v1<T>&v,cs U&x){fe(v,e)e+=x;rr v;}I(J T,J U)au O+(v1<T>v,cs U&x){rr v+=x;}I(J T)au&O++(v1<T>&v){rr v+=1;}
I(J T,J U)au&O-=(v1<T>&v,cs U&x){fe(v,e)e-=x;rr v;}I(J T,J U)au O-(v1<T>v,cs U&x){rr v-=x;}I(J T)au&O--(v1<T>&v){rr v-=1;}
I(J T)au&O^=(v1<T>&v,cs v1<T>&u){fe(u,e)v.eb(e);rr v;}I(J T)au O^(v1<T>v,cs v1<T>&u){rr v^=u;}I(J T)vo af(T&a,vt<T>e={}){a.ep(begin(a),e);}
I(J T,J F=less<>)T&srt(T&a,F f={}){sort(all(a),f);rr a;}I(J T)T&rv(T&a){reverse(all(a));rr a;}I(J T)vo df(T&a){a.erase(begin(a));}
I(J T)T&rsr(T&a){rr rv(srt(a));}I(J T)T&uq(T&a){srt(a).erase(unique(all(a)),end(a));rr a;}u1 io(ll n,ll x=0){u1 a;fo(i,n)a.eb(i+x);rr a;}
I(J T)decltype(au)bg(T&a){rr*begin(a);}I(J T)au pof(T&q){au r=bg(q);q.pop_front();rr r;}I(J T,J U)bo amax(T&a,cs U&b){rr a<b?a=b,1:0;}
I(J T)decltype(au)rb(T&a){rr*rbegin(a);}I(J T)au pob(T&q){au r=rb(q);q.pop_back();rr r;}I(J T,J U)bo amin(T&a,cs U&b){rr a>b?a=b,1:0;}
I(J T)decltype(au)rb(T&a,ll x){rr*(rbegin(a)+x);}I(J T)au pop(T&a){ifc(isv<T>)rr pob(a);else{au r=a.top();a.pop();rr r;}}
I(J...A)au max(cs A&...a){rr max(ilis<common_type_t<A...>>{a...});}I(J T,J U)ll arglb(cs v1<T>&v,cs U&x){rr lower_bound(all(v),x)-begin(v);}
I(J...A)au min(cs A&...a){rr min(ilis<common_type_t<A...>>{a...});}I(J T,J U)ll argub(cs v1<T>&v,cs U&x){rr upper_bound(all(v),x)-begin(v);}
I(J T=ll,ll n,ll i=0)au vec(cs ll(&l)[n],T x={}){ifc(n==i+1)rr v1<T>(l[i],x);else rr vector(l[i],vec<T,n,i+1>(l,x));}
I(J S,bo f(S&,cs S&),J V)au scan(cs V&v){cp<S,bo>r;ifc(!isv<V>)r={v,1};else fe(v,x)if(au t=scan<S,f>(x);t.b)!r.b?r=t,0:f(r.a,t.a);rr r;}
I(J V)au pv(V){ifc(isv<V>)rr pv(vt<V>());else rr V();}I(J V)uu pt=decltype(pv(V()));I(J V)au sum(cs v1<V>&v){rr scan<pt<V>,add>(v).a;}
I(J V)au zt(V v){ifc(isv<V>){fe(v,e)e=zt(e);fo(i,len(v)-1)v[i+1]+=v[i];}rr v;}I(J V)au max(cs v1<V>&v){rr scan<pt<V>,amax>(v).a;}
I(J V)au mb(V v){ifc(isv<V>){fe(v,e)e=mb(e);of(i,len(v)-1)v[i+1]-=v[i];}rr v;}I(J V)au min(cs v1<V>&v){rr scan<pt<V>,amin>(v).a;}
I(J V)vo fill(v1<V>&v,pt<V>x={}){fe(v,e)ifc(isv<V>)fill(e,x);else e=x;}I(ll n,J...A)vo resize(cs ll(&l)[n],A&...a){((a=vec(l,pv(a))),...);}

struct fio{fio(){cin.tie(0)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}}fio;
os&O<<(os&o,cs ulll&x){rr(x<10?o:o<<x/10)<<ll(x%10);}os&O<<(os&o,cs lll&x){rr o<<(x<0?"-":nc)<<ulll(zz(x));}
I(J V)os&O<<(os&o,cs v1<V>&v){str s=nl;ifc(!isv<V>)s=sp;else ifc(isv<vt<V>>)s+=nl;fe(v,e)o<<e<<(&e!=&rb(v)?s:nc);rr o;}
I(J T)os&O<<(os&o,cs set<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J T,J U)os&O<<(os&o,cs cp<T,U>&c){rr o<<c.a<<sp<<c.b;}
I(J T)os&O<<(os&o,cs mset<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J T,J U)os&O<<(os&o,cs map<T,U>&m){fe(m,e)o<<cp(e)<<nl;rr o;}
I(J T)os&O<<(os&o,cs deque<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J...A)vo pp(cs A&...a){ll i=0;((cout<<a<<(++i<sizeof...(a)?sp:nc)),...);cout<<nl;}
I(J V)is&O>>(is&i,v1<V>&v){fe(v,e)i>>e;rr i;}I(J...A)vo li(A&...a){(cin>>...>>a);}I(J...A)vo vi(A&...a){fo(i,(len(a)&...))(cin>>...>>a[i]);}

struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2<edg>;
graph tog(cs u2&a){graph g;fe(a,e){g.eb();fe(e,v)rb(g).eb(v);}rr g;}u2 tou(cs graph&g){u2 a;fe(g,e){a.eb();fe(e,v,w)rb(a).eb(v);}rr a;}
I(J G)au ygi(G&g,ll m,bo f=1){ifc(is_same_v<G,u2>){UV(m,a,b);a-=f,b-=f;fo(i,m)g[a[i]].eb(b[i]);rr tuple{a,b};}
  else{UV(m,a,b,c);a-=f,b-=f;fo(i,m)g[a[i]].eb(b[i],c[i]);rr tuple{a,b,c};}}
I(J G)au mgi(G&g,ll m,bo f=1){ifc(is_same_v<G,u2>){au[a,b]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i]);rr tuple{a,b};}
  else{au[a,b,c]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i],c[i]);rr tuple{a,b,c};}}I(J G)au ti(G&g,bo f=1){rr mgi(g,len(g)-1,f);}
u1 en(cs str&s,cs str&b="a"){u1 r;fe(s,e)r.eb(len(b)==1?e-b[0]:b.find_first_of(e));rr r;}u1 sien(cs str&b="a"){RD(str,s);rr en(s,b);}
u2 en(cs strs&s,cs str&b="a"){u2 r;fe(s,e)r.eb(en(e,b));rr r;}u2 sien(ll n,cs str&b="a"){strs s(n);li(s);rr en(s,b);}
str de(cs u1&a,cs str&b="a"){str r;fe(a,e)r+=len(b)==1?e+b[0]:0<=e&&e<len(b)?b[e]:'|';rr r;}
strs de(cs u2&a,cs str&b="a"){strs r;fe(a,e)r.eb(de(e,b));rr r;}

I(J F)struct rec:F{rec(F&&f):F(forward<F>(f)){}I(J...A)decltype(au)O()(A&&...a)cs{rr F::O()(*this,std::forward<A>(a)...);}};
I(J...A)u1 zp(A&...a){u1 v=(a^...);uq(v);([&](u1&u){fe(u,e)e=arglb(v,e);}(a),...);rr v;}I(J...A)vo dec(A&...a){((--a),...);}
I(J F,J...A)u1 vs(F f,A&...a){u1 o=io((len(a)&...));srt(o,cref(f));([&](au&e){au c=e;fo(i,len(e))e[i]=c[o[i]];}(a),...);rr o;}
I(J F)dd bsd(F f,dd o,dd n){fo(l2(zz(o-n)/ee)+5)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}ll sqr(ll x){ll r=sqrt(zz(x-ee));wh(r+1<=x/(r+1))++r;rr r;}
I(J F)ll bsl(F f,ll o,ll n){wh(zz(o-n)>1)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}u1 divs(ll n){u1 r;fo(i,1,sqr(n)+1)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r);}
cls fact(ll n){umap<ll>m;fo(i,2,sqr(n)+1)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];cls r;fe(m,e)r.eb(e);rr srt(r);}
cls rle(cs u1&a){cls r;fe(a,e)len(r)&&e==rb(r).a?++rb(r).b:r.eb(e,1).b;rr r;}cls rce(u1 a){rr rle(srt(a));}
lll pow(lll x,ulll n,ulll m=0){lll r=1;wh(n)n&1?r*=x:r,x*=x,m?r%=m,x%=m:r,n>>=1;rr r;}

I(J T=ll,ll n,ll k=0)auto arr(cs ll(&l)[n],cs T&x={}){
  ll m=l[k];
  ifc(k==n-1){
    T*r=(T*)malloc(sizeof(T)*m);
    fo(i,m)r[i]=x;
    rr r;
  }else{
    uu U=decltype(arr<T,n,k+1>(l,x));
    U*r=(U*)malloc(sizeof(U)*m);
    fo(i,m)r[i]=arr<T,n,k+1>(l,x);
    rr r;
  }
}

//I(ll n,J A,J T)vo fill(A(&a)[n],T x={}){ifc(is_same_v<decltype(a[0]),T&>)fo(i,n)a[i]=x;else fo(i,n)fill(a[i],x);}

vo main(){ll T=1;fo(T)solve();}
vo solve(){
  LL(N,M,K);
  u1 s=sien();
  
  ll A=26;
  fo(M-N)s.eb(-1);
  
  ll used=0;
  au dp=arr({M+1,A+1,2},ml());
  fo(i,M+1)fo(j,A+1)fo(e,2)dp[i][j][e]=0;
  dp[0][0][1]=1;
  fo(i,M){
    fo(j,A+1){
      fo(e,2){
        if(dp[i][j][e]==0)continue;
        
        if(e==0){
          if(j+1<=A)dp[i+1][j+1][e]+=dp[i][j][e]*(A-j);
          dp[i+1][j][e]+=dp[i][j][e]*j;
        }else{
          ll lim=s[i];
          fo(x,lim+1){
            ll ne=(x<lim?0:e);
            ll nj=j+!at(used,x);
            if(nj<=A)dp[i+1][nj][ne]+=dp[i][j][e];
          }
        }
      }
    }
    used|=pw2(s[i]);
  }
  
  ml ans=0;
  fo(i,1,M+1){
    fo(j,K,A+1){
      ans+=dp[i][j][0];
      if(i<N)ans+=dp[i][j][1];
    }
  }
  pp(ans);
}}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード