結果

問題 No.1646 Avoid Palindrome
ユーザー kimiyukikimiyuki
提出日時 2021-08-13 22:54:36
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,143 ms / 3,000 ms
コード長 4,915 bytes
コンパイル時間 1,952 ms
コンパイル使用メモリ 201,396 KB
実行使用メモリ 4,504 KB
最終ジャッジ日時 2023-08-08 10:10:58
合計ジャッジ時間 28,077 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 558 ms
4,376 KB
testcase_05 AC 553 ms
4,376 KB
testcase_06 AC 535 ms
4,380 KB
testcase_07 AC 557 ms
4,376 KB
testcase_08 AC 558 ms
4,376 KB
testcase_09 AC 531 ms
4,380 KB
testcase_10 AC 541 ms
4,504 KB
testcase_11 AC 529 ms
4,380 KB
testcase_12 AC 557 ms
4,380 KB
testcase_13 AC 561 ms
4,376 KB
testcase_14 AC 1,053 ms
4,380 KB
testcase_15 AC 1,070 ms
4,384 KB
testcase_16 AC 1,050 ms
4,380 KB
testcase_17 AC 1,091 ms
4,380 KB
testcase_18 AC 1,059 ms
4,380 KB
testcase_19 AC 1,057 ms
4,376 KB
testcase_20 AC 1,068 ms
4,380 KB
testcase_21 AC 1,095 ms
4,380 KB
testcase_22 AC 1,055 ms
4,380 KB
testcase_23 AC 1,091 ms
4,376 KB
testcase_24 AC 1,136 ms
4,376 KB
testcase_25 AC 1,140 ms
4,380 KB
testcase_26 AC 1,138 ms
4,380 KB
testcase_27 AC 1,141 ms
4,376 KB
testcase_28 AC 1,140 ms
4,380 KB
testcase_29 AC 221 ms
4,380 KB
testcase_30 AC 220 ms
4,376 KB
testcase_31 AC 218 ms
4,380 KB
testcase_32 AC 223 ms
4,380 KB
testcase_33 AC 222 ms
4,376 KB
testcase_34 AC 1,143 ms
4,380 KB
testcase_35 AC 1 ms
4,376 KB
testcase_36 AC 2 ms
4,380 KB
testcase_37 AC 1 ms
4,376 KB
testcase_38 AC 2 ms
4,376 KB
testcase_39 AC 1 ms
4,380 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 1 ms
4,380 KB
testcase_42 AC 1 ms
4,380 KB
testcase_43 AC 221 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"
#include <bits/stdc++.h>
#line 2 "/home/ubuntu/Library/utils/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
#line 4 "/home/ubuntu/Library/modulus/modpow.hpp"

inline int32_t modpow(uint_fast64_t x, uint64_t k, int32_t MOD) {
    assert (/* 0 <= x and */ x < (uint_fast64_t)MOD);
    uint_fast64_t y = 1;
    for (; k; k >>= 1) {
        if (k & 1) (y *= x) %= MOD;
        (x *= x) %= MOD;
    }
    assert (/* 0 <= y and */ y < (uint_fast64_t)MOD);
    return y;
}
#line 5 "/home/ubuntu/Library/modulus/modinv.hpp"

inline int32_t modinv_nocheck(int32_t value, int32_t MOD) {
    assert (0 <= value and value < MOD);
    if (value == 0) return -1;
    int64_t a = value, b = MOD;
    int64_t x = 0, y = 1;
    for (int64_t u = 1, v = 0; a; ) {
        int64_t q = b / a;
        x -= q * u; std::swap(x, u);
        y -= q * v; std::swap(y, v);
        b -= q * a; std::swap(b, a);
    }
    if (not (value * x + MOD * y == b and b == 1)) return -1;
    if (x < 0) x += MOD;
    assert (0 <= x and x < MOD);
    return x;
}

inline int32_t modinv(int32_t x, int32_t MOD) {
    int32_t y = modinv_nocheck(x, MOD);
    assert (y != -1);
    return y;
}
#line 6 "/home/ubuntu/Library/modulus/mint.hpp"

/**
 * @brief quotient ring / 剰余環 $\mathbb{Z}/n\mathbb{Z}$
 */
template <int32_t MOD>
struct mint {
    int32_t value;
    mint() : value() {}
    mint(int64_t value_) : value(value_ < 0 ? value_ % MOD + MOD : value_ >= MOD ? value_ % MOD : value_) {}
    mint(int32_t value_, std::nullptr_t) : value(value_) {}
    explicit operator bool() const { return value; }
    inline mint<MOD> operator + (mint<MOD> other) const { return mint<MOD>(*this) += other; }
    inline mint<MOD> operator - (mint<MOD> other) const { return mint<MOD>(*this) -= other; }
    inline mint<MOD> operator * (mint<MOD> other) const { return mint<MOD>(*this) *= other; }
    inline mint<MOD> & operator += (mint<MOD> other) { this->value += other.value; if (this->value >= MOD) this->value -= MOD; return *this; }
    inline mint<MOD> & operator -= (mint<MOD> other) { this->value -= other.value; if (this->value <    0) this->value += MOD; return *this; }
    inline mint<MOD> & operator *= (mint<MOD> other) { this->value = (uint_fast64_t)this->value * other.value % MOD; return *this; }
    inline mint<MOD> operator - () const { return mint<MOD>(this->value ? MOD - this->value : 0, nullptr); }
    inline bool operator == (mint<MOD> other) const { return value == other.value; }
    inline bool operator != (mint<MOD> other) const { return value != other.value; }
    inline mint<MOD> pow(uint64_t k) const { return mint<MOD>(modpow(value, k, MOD), nullptr); }
    inline mint<MOD> inv() const { return mint<MOD>(modinv(value, MOD), nullptr); }
    inline mint<MOD> operator / (mint<MOD> other) const { return *this * other.inv(); }
    inline mint<MOD> & operator /= (mint<MOD> other) { return *this *= other.inv(); }
};
template <int32_t MOD> mint<MOD> operator + (int64_t value, mint<MOD> n) { return mint<MOD>(value) + n; }
template <int32_t MOD> mint<MOD> operator - (int64_t value, mint<MOD> n) { return mint<MOD>(value) - n; }
template <int32_t MOD> mint<MOD> operator * (int64_t value, mint<MOD> n) { return mint<MOD>(value) * n; }
template <int32_t MOD> mint<MOD> operator / (int64_t value, mint<MOD> n) { return mint<MOD>(value) / n; }
template <int32_t MOD> std::istream & operator >> (std::istream & in, mint<MOD> & n) { int64_t value; in >> value; n = value; return in; }
template <int32_t MOD> std::ostream & operator << (std::ostream & out, mint<MOD> n) { return out << n.value; }
#line 4 "main.cpp"
using namespace std;

constexpr int64_t MOD = 998244353;
mint<MOD> solve(int64_t n, std::string s) {
    array<array<mint<MOD>, 27>, 27> cur = {};
    cur[26][26] += 1;
    for (char c : s) {
        array<array<mint<MOD>, 27>, 27> prv = {};
        cur.swap(prv);
        REP (k, 26) {
            if (k == c - 'a' or c == '?') {
                REP (i, 27) {
                    REP (j, 27) {
                        if (i != k and j != k) {
                            cur[j][k] += prv[i][j];
                        }
                    }
                }
            }
        }
    }
    mint<MOD> ans = 0;
    REP (i, 27) {
        REP (j, 27) {
            ans += cur[i][j];
        }
    }
    return ans;
}

// generated by oj-template v4.8.0 (https://github.com/online-judge-tools/template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int64_t N;
    std::string S;
    std::cin >> N >> S;
    auto ans = solve(N, S);
    std::cout << ans << '\n';
    return 0;
}
0