結果
問題 | No.1740 Alone 'a' |
ユーザー | nawawan |
提出日時 | 2021-11-12 22:14:26 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 3,392 bytes |
コンパイル時間 | 2,257 ms |
コンパイル使用メモリ | 206,400 KB |
実行使用メモリ | 23,840 KB |
最終ジャッジ日時 | 2023-08-17 01:56:34 |
合計ジャッジ時間 | 4,530 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
12,916 KB |
testcase_01 | AC | 6 ms
12,960 KB |
testcase_02 | AC | 7 ms
12,968 KB |
testcase_03 | AC | 22 ms
23,840 KB |
testcase_04 | AC | 22 ms
23,836 KB |
testcase_05 | AC | 7 ms
13,196 KB |
testcase_06 | AC | 6 ms
13,116 KB |
testcase_07 | AC | 6 ms
13,144 KB |
testcase_08 | AC | 6 ms
13,056 KB |
testcase_09 | AC | 6 ms
13,024 KB |
testcase_10 | AC | 6 ms
12,920 KB |
testcase_11 | AC | 9 ms
14,704 KB |
testcase_12 | AC | 18 ms
22,028 KB |
testcase_13 | AC | 18 ms
21,164 KB |
testcase_14 | AC | 20 ms
23,272 KB |
testcase_15 | AC | 6 ms
13,056 KB |
testcase_16 | AC | 17 ms
20,948 KB |
testcase_17 | AC | 6 ms
13,080 KB |
testcase_18 | AC | 8 ms
14,040 KB |
testcase_19 | AC | 19 ms
21,740 KB |
testcase_20 | AC | 13 ms
17,340 KB |
testcase_21 | AC | 15 ms
19,268 KB |
testcase_22 | AC | 17 ms
20,420 KB |
testcase_23 | AC | 16 ms
20,472 KB |
testcase_24 | AC | 12 ms
17,700 KB |
testcase_25 | AC | 12 ms
17,612 KB |
testcase_26 | AC | 15 ms
19,024 KB |
testcase_27 | AC | 16 ms
19,536 KB |
testcase_28 | AC | 14 ms
18,396 KB |
testcase_29 | AC | 21 ms
23,616 KB |
testcase_30 | AC | 15 ms
19,428 KB |
testcase_31 | AC | 17 ms
20,660 KB |
testcase_32 | AC | 14 ms
18,536 KB |
testcase_33 | AC | 17 ms
20,688 KB |
testcase_34 | AC | 9 ms
14,288 KB |
testcase_35 | AC | 14 ms
18,132 KB |
testcase_36 | AC | 13 ms
17,384 KB |
testcase_37 | AC | 9 ms
14,468 KB |
testcase_38 | AC | 11 ms
16,532 KB |
testcase_39 | AC | 7 ms
13,148 KB |
testcase_40 | AC | 9 ms
15,048 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; template<const int MOD> struct modint{ long long val; modint(): val(0) {} modint(long long x){ if(x < 0) val = x % MOD + MOD; else val = x % MOD; } modint(const modint &t){ val = t.val; } modint& operator =(const modint m){ val = m.val; return *this; } modint operator -(){ return modint(-val); } modint& operator-=(const modint &m){ val -= m.val; if(val < 0) val += MOD; return *this; } modint& operator+=(const modint &m){ val += m.val; if(val >= MOD) val -= MOD; return *this; } modint& operator*=(const modint &m){ val *= m.val; val %= MOD; return *this; } modint& operator/=(modint m){ *this *= m.inv(); return *this; } modint inv(){ long long x = 1, y = 0; long long a = val, b = MOD; while(b != 0){ long long t = a / b; a -= t * b; x -= t * y; swap(a, b); swap(x, y); } x %= MOD; if(x < 0) x += MOD; return modint(x); } modint pow(long long k){ long long res = 1; long long v = val; while(k > 0){ if(k & 1) res = res * v % MOD; v = v * v % MOD; k >>= 1; } return modint(res); } bool operator==(const modint &m){ return val == m.val; } modint operator+(const modint &m){ return modint(*this) += m; } modint operator-(const modint &m){ return modint(*this) -= m; } modint operator*(const modint &m){ return modint(*this) *= m; } modint operator/(const modint &m){ return modint(*this) /= m; } bool operator!=(const modint &m){ return modint(*this).val != m.val; } bool operator!=(const int &m){ return modint(*this).val != m; } }; const int MOD = 998244353; using mint = modint<MOD>; const int MAX = 410000; mint fac[MAX], finv[MAX], inv[MAX]; void COMinit(){ fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for(int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i; inv[i] = mint(MOD) - inv[MOD % i] * (MOD / i); finv[i] = finv[i - 1] * inv[i]; } } mint COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * finv[k] * finv[n - k]; } int main(){ int N; cin >> N; string S; cin >> S; vector<vector<vector<mint>>> dp(2, vector<vector<mint>>(2, vector<mint>(N))); if(S[0] == 'a'){ dp[0][1][0] = 1; } else{ dp[0][0][0] = 1; dp[1][0][0] = S[0] - 'a' - 1; dp[1][1][0] = 1; } for(int i = 1; i < N; i++){ if(S[i] == 'a'){ dp[0][1][i] = dp[0][0][i - 1]; dp[1][0][i] = dp[1][0][i - 1] * 25; dp[1][1][i] = dp[1][0][i - 1] + dp[1][1][i - 1] * 25; } else{ dp[0][0][i] = dp[0][0][i - 1]; dp[0][1][i] = dp[0][1][i - 1]; dp[1][0][i] = dp[1][0][i - 1] * 25 + dp[0][0][i - 1] * (S[i] - 'a' - 1); dp[1][1][i] = dp[1][0][i - 1] + dp[1][1][i - 1] * 25 + dp[0][0][i - 1] + dp[0][1][i - 1] * (S[i] - 'a' - 1); } } cout << dp[1][1][N - 1].val << endl; }