結果
問題 | No.1646 Avoid Palindrome |
ユーザー | milanis48663220 |
提出日時 | 2021-08-13 21:53:40 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 330 ms / 3,000 ms |
コード長 | 3,892 bytes |
コンパイル時間 | 1,275 ms |
コンパイル使用メモリ | 117,160 KB |
実行使用メモリ | 267,732 KB |
最終ジャッジ日時 | 2023-08-08 09:25:00 |
合計ジャッジ時間 | 15,951 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 105 ms
267,688 KB |
testcase_01 | AC | 103 ms
267,340 KB |
testcase_02 | AC | 102 ms
267,448 KB |
testcase_03 | AC | 101 ms
267,676 KB |
testcase_04 | AC | 304 ms
267,500 KB |
testcase_05 | AC | 305 ms
267,548 KB |
testcase_06 | AC | 299 ms
267,520 KB |
testcase_07 | AC | 305 ms
267,524 KB |
testcase_08 | AC | 308 ms
267,516 KB |
testcase_09 | AC | 298 ms
267,732 KB |
testcase_10 | AC | 300 ms
267,628 KB |
testcase_11 | AC | 296 ms
267,580 KB |
testcase_12 | AC | 308 ms
267,612 KB |
testcase_13 | AC | 310 ms
267,480 KB |
testcase_14 | AC | 312 ms
267,616 KB |
testcase_15 | AC | 315 ms
267,448 KB |
testcase_16 | AC | 309 ms
267,440 KB |
testcase_17 | AC | 320 ms
267,476 KB |
testcase_18 | AC | 314 ms
267,448 KB |
testcase_19 | AC | 311 ms
267,448 KB |
testcase_20 | AC | 313 ms
267,480 KB |
testcase_21 | AC | 319 ms
267,552 KB |
testcase_22 | AC | 312 ms
267,556 KB |
testcase_23 | AC | 320 ms
267,432 KB |
testcase_24 | AC | 330 ms
267,436 KB |
testcase_25 | AC | 326 ms
267,456 KB |
testcase_26 | AC | 326 ms
267,448 KB |
testcase_27 | AC | 327 ms
267,588 KB |
testcase_28 | AC | 326 ms
267,480 KB |
testcase_29 | AC | 309 ms
267,512 KB |
testcase_30 | AC | 311 ms
267,588 KB |
testcase_31 | AC | 312 ms
267,664 KB |
testcase_32 | AC | 314 ms
267,448 KB |
testcase_33 | AC | 310 ms
267,560 KB |
testcase_34 | AC | 327 ms
267,448 KB |
testcase_35 | AC | 102 ms
267,320 KB |
testcase_36 | AC | 103 ms
267,452 KB |
testcase_37 | AC | 103 ms
267,436 KB |
testcase_38 | AC | 103 ms
267,336 KB |
testcase_39 | AC | 103 ms
267,440 KB |
testcase_40 | AC | 103 ms
267,552 KB |
testcase_41 | AC | 103 ms
267,324 KB |
testcase_42 | AC | 104 ms
267,476 KB |
testcase_43 | AC | 311 ms
267,632 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; const ll MOD = 998244353; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v < 0) _v = (v%MOD)+MOD; if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } void operator+=(ll n){ v = (v+n)%MOD; } void operator-=(ll n){ v = (v-n+MOD)%MOD; } void operator*=(ll n){ v = (v*n+MOD)%MOD; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } void operator+=(ModInt n){ v = (v+n.v)%MOD; } void operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; } void operator*=(ModInt n){ v = (v*n.v)%MOD; } void operator=(ModInt n){ v = n.v; } bool operator==(ModInt n){ return v == n.v; } bool operator!=(ModInt n){ return v != n.v; } void operator=(ll n){ v = n%MOD; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } template <typename T> class OffsetVec{ public: int n; vector<T> v; T& operator[](int x) { return v[x+n]; } void print(){ for(int i = -n; i <= n; i++) cout << v[i+n] << ' '; cout << endl; } OffsetVec(int _n){ n = _n; v = vector<T>(2*n+1); } OffsetVec(int _n, T x){ n = _n; v = vector<T>(2*n+1, x); } }; using mint = ModInt; mint dp[50005][26][26]; bool ok(char a, char b){ if(a == '?' || b == '?') return true; return a == b; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n; string s; cin >> n >> s; if(n == 1){ if(s[0] == '?') cout << 26 << endl; else cout << 1 << endl; return 0; } for(int i = 0; i < 26; i++){ if(!ok(s[0], 'a'+i)) continue; for(int j = 0; j < 26; j++){ if(i == j) continue; if(!ok(s[1], 'a'+j)) continue; dp[1][i][j] = 1; } } for(int i = 2; i < n; i++){ for(int j = 0; j < 26; j++){ mint sum = 0; for(int k = 0; k < 26; k++) sum += dp[i-1][k][j]; for(int k = 0; k < 26; k++){ if(j == k) continue; if(!ok(s[i], 'a'+k)) continue; dp[i][j][k] = sum-dp[i-1][k][j]; } } } mint ans = 0; for(int i = 0; i < 26; i++){ for(int j = 0; j < 26; j++){ ans += dp[n-1][i][j]; } } cout << ans << endl; }