結果
問題 | No.1740 Alone 'a' |
ユーザー | LayCurse |
提出日時 | 2021-11-12 22:06:25 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 49 ms / 2,000 ms |
コード長 | 7,485 bytes |
コンパイル時間 | 2,457 ms |
コンパイル使用メモリ | 221,344 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-25 18:45:28 |
合計ジャッジ時間 | 4,185 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 49 ms
5,248 KB |
testcase_04 | AC | 49 ms
5,248 KB |
testcase_05 | AC | 4 ms
5,248 KB |
testcase_06 | AC | 3 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 1 ms
5,248 KB |
testcase_10 | AC | 1 ms
5,248 KB |
testcase_11 | AC | 10 ms
5,248 KB |
testcase_12 | AC | 36 ms
5,248 KB |
testcase_13 | AC | 26 ms
5,248 KB |
testcase_14 | AC | 46 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 33 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 7 ms
5,248 KB |
testcase_19 | AC | 37 ms
5,248 KB |
testcase_20 | AC | 20 ms
5,248 KB |
testcase_21 | AC | 26 ms
5,248 KB |
testcase_22 | AC | 31 ms
5,248 KB |
testcase_23 | AC | 31 ms
5,248 KB |
testcase_24 | AC | 19 ms
5,248 KB |
testcase_25 | AC | 20 ms
5,248 KB |
testcase_26 | AC | 26 ms
5,248 KB |
testcase_27 | AC | 22 ms
5,248 KB |
testcase_28 | AC | 24 ms
5,248 KB |
testcase_29 | AC | 42 ms
5,248 KB |
testcase_30 | AC | 21 ms
5,248 KB |
testcase_31 | AC | 34 ms
5,248 KB |
testcase_32 | AC | 25 ms
5,248 KB |
testcase_33 | AC | 35 ms
5,248 KB |
testcase_34 | AC | 6 ms
5,248 KB |
testcase_35 | AC | 22 ms
5,248 KB |
testcase_36 | AC | 18 ms
5,248 KB |
testcase_37 | AC | 8 ms
5,248 KB |
testcase_38 | AC | 16 ms
5,248 KB |
testcase_39 | AC | 4 ms
5,248 KB |
testcase_40 | AC | 10 ms
5,248 KB |
ソースコード
#pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("inline") #include<bits/stdc++.h> using namespace std; #define MD (998244353U) struct Modint{ unsigned val; Modint(){ val=0; } Modint(int a){ val = ord(a); } Modint(unsigned a){ val = ord(a); } Modint(long long a){ val = ord(a); } Modint(unsigned long long a){ val = ord(a); } inline unsigned ord(unsigned a){ return a%MD; } inline unsigned ord(int a){ a %= (int)MD; if(a < 0){ a += MD; } return a; } inline unsigned ord(unsigned long long a){ return a%MD; } inline unsigned ord(long long a){ a %= (int)MD; if(a < 0){ a += MD; } return a; } inline unsigned get(){ return val; } inline Modint &operator++(){ val++; if(val >= MD){ val -= MD; } return *this; } inline Modint &operator--(){ if(val == 0){ val = MD - 1; } else{ --val; } return *this; } inline Modint operator++(int a){ Modint res(*this); val++; if(val >= MD){ val -= MD; } return res; } inline Modint operator--(int a){ Modint res(*this); if(val == 0){ val = MD - 1; } else{ --val; } return res; } inline Modint &operator+=(Modint a){ val += a.val; if(val >= MD){ val -= MD; } return *this; } inline Modint &operator-=(Modint a){ if(val < a.val){ val = val + MD - a.val; } else{ val -= a.val; } return *this; } inline Modint &operator*=(Modint a){ val = ((unsigned long long)val*a.val)%MD; return *this; } inline Modint &operator/=(Modint a){ return *this *= a.inverse(); } inline Modint operator+(Modint a){ return Modint(*this)+=a; } inline Modint operator-(Modint a){ return Modint(*this)-=a; } inline Modint operator*(Modint a){ return Modint(*this)*=a; } inline Modint operator/(Modint a){ return Modint(*this)/=a; } inline Modint operator+(int a){ return Modint(*this)+=Modint(a); } inline Modint operator-(int a){ return Modint(*this)-=Modint(a); } inline Modint operator*(int a){ return Modint(*this)*=Modint(a); } inline Modint operator/(int a){ return Modint(*this)/=Modint(a); } inline Modint operator+(long long a){ return Modint(*this)+=Modint(a); } inline Modint operator-(long long a){ return Modint(*this)-=Modint(a); } inline Modint operator*(long long a){ return Modint(*this)*=Modint(a); } inline Modint operator/(long long a){ return Modint(*this)/=Modint(a); } inline Modint operator-(void){ Modint res; if(val){ res.val=MD-val; } else{ res.val=0; } return res; } inline operator bool(void){ return val!=0; } inline operator int(void){ return get(); } inline operator long long(void){ return get(); } inline Modint inverse(){ int a = val; int b = MD; int u = 1; int v = 0; int t; Modint res; while(b){ t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } if(u < 0){ u += MD; } res.val = u; return res; } inline Modint pw(unsigned long long b){ Modint a(*this); Modint res; res.val = 1; while(b){ if(b&1){ res *= a; } b >>= 1; a *= a; } return res; } inline bool operator==(int a){ return ord(a)==val; } inline bool operator!=(int a){ return ord(a)!=val; } } ; inline Modint operator+(int a, Modint b){ return Modint(a)+=b; } inline Modint operator-(int a, Modint b){ return Modint(a)-=b; } inline Modint operator*(int a, Modint b){ return Modint(a)*=b; } inline Modint operator/(int a, Modint b){ return Modint(a)/=b; } inline Modint operator+(long long a, Modint b){ return Modint(a)+=b; } inline Modint operator-(long long a, Modint b){ return Modint(a)-=b; } inline Modint operator*(long long a, Modint b){ return Modint(a)*=b; } inline Modint operator/(long long a, Modint b){ return Modint(a)/=b; } inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(int &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } inline void rd(char &c){ int i; for(;;){ i = my_getchar_unlocked(); if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){ break; } } c = i; } inline int rd(char c[]){ int i; int sz = 0; for(;;){ i = my_getchar_unlocked(); if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){ break; } } c[sz++] = i; for(;;){ i = my_getchar_unlocked(); if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){ break; } c[sz++] = i; } c[sz]='\0'; return sz; } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } inline void wt_L(char a){ my_putchar_unlocked(a); } inline void wt_L(int x){ int s=0; int m=0; char f[10]; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(Modint x){ int i; i = (int)x; wt_L(i); } int main(){ int i; int N; rd(N); char S[N+2]; int nx; int ny; Modint dp[2][2] = {}; Modint nn[2][2]; rd(S); dp[0][0] = 1; for(i=(0);i<(N);i++){ int x; for(x=(0);x<(2);x++){ int y; for(y=(0);y<(2);y++){ nn[x][y] = 0; } } for(x=(0);x<(2);x++){ int y; for(y=(0);y<(2);y++){ int k; for(k=('a');k<('z'+1);k++){ if(x == 0 && k > S[i]){ continue; } if(k < S[i]){ nx =1; } else{ nx =x; } if(k=='a'){ ny = y +1; } else{ ny = y +0; } if(ny <= 1){ nn[nx][ny] += dp[x][y]; } } } } for(x=(0);x<(2);x++){ int y; for(y=(0);y<(2);y++){ dp[x][y] = nn[x][y]; } } } wt_L(dp[1][1]); wt_L('\n'); return 0; } // cLay version 20211024-1 // --- original code --- // #define MD 998244353 // int @N; char S[N+2]; // int nx, ny; // Modint dp[2][2] = {}, nn[2][2]; // rd(S); // dp[0][0] = 1; // rep(i,N){ // rep(x,2) rep(y,2) nn[x][y] = 0; // rep(x,2) rep(y,2) rep(k,'a','z'+1){ // if(x == 0 && k > S[i]) continue; // nx = if[k < S[i], 1, x]; // ny = y + if[k=='a', 1, 0]; // if(ny <= 1) nn[nx][ny] += dp[x][y]; // } // rep(x,2) rep(y,2) dp[x][y] = nn[x][y]; // } // wt(dp[1][1]);