結果

問題 No.1646 Avoid Palindrome
ユーザー nawawan
提出日時 2021-08-13 21:58:22
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 488 ms / 3,000 ms
コード長 4,046 bytes
コンパイル時間 2,105 ms
コンパイル使用メモリ 202,480 KB
最終ジャッジ日時 2025-01-23 19:05:39
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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>;
int main(){
    int N;
    cin >> N;
    string S;
    cin >> S;
    if(N == 1){
        if(S[0] == '?') cout << 26 << endl;
        else cout << 1 << endl;
        return 0;
    }
    vector<vector<vector<mint>>> dp(N, vector<vector<mint>>(26, vector<mint>(26)));
    if(S[0] == '?'){
        if(S[1] == '?'){
            for(int i = 0; i < 26; i++){
                for(int j = 0; j < 26; j++){
                    if(i == j) continue;
                    dp[1][i][j] = 1;
                }
            }
        }
        else{
            for(int i = 0; i < 26; i++){
                if(i == S[1] - 'a') continue;
                dp[1][S[1] - 'a'][i] = 1;
            }
        }
    }
    else{
        if(S[1] == '?'){
            for(int i = 0; i < 26; i++){
                if(i == S[0] - 'a') continue;
                dp[1][i][S[0] - 'a'] = 1;
            }
        }
        else{
            if(S[1] != S[0]) dp[1][S[1] - 'a'][S[0] - 'a'] = 1;
        }
    }
    for(int i = 2; i < N; i++){
        if(S[i] == '?'){
            for(int j = 0; j < 26; j++){
                mint temp = 0;
                for(int k = 0; k < 26; k++) {
                    if(j == k) continue;
                    temp += dp[i - 1][j][k];
                }
                for(int k = 0; k < 26; k++){
                    if(j == k) continue;
                    dp[i][k][j] += temp - dp[i - 1][j][k];
                }
            }
        }
        else{
            int id = S[i] - 'a';
            for(int j = 0; j < 26; j++){
                if(id == j) continue;
                mint temp = 0;
                for(int k = 0; k < 26; k++){
                    if(k == id) continue;
                    temp += dp[i - 1][j][k];
                }
                dp[i][id][j] += temp;
            }
        }
    }
    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.val << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0