結果

問題 No.1646 Avoid Palindrome
ユーザー sten_sansten_san
提出日時 2023-04-18 00:54:28
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,030 ms / 3,000 ms
コード長 3,899 bytes
コンパイル時間 2,063 ms
コンパイル使用メモリ 203,984 KB
実行使用メモリ 135,572 KB
最終ジャッジ日時 2024-10-12 23:58:53
合計ジャッジ時間 61,945 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
135,300 KB
testcase_01 AC 36 ms
135,424 KB
testcase_02 AC 37 ms
135,336 KB
testcase_03 AC 38 ms
135,392 KB
testcase_04 AC 1,856 ms
135,300 KB
testcase_05 AC 1,839 ms
135,452 KB
testcase_06 AC 1,768 ms
135,528 KB
testcase_07 AC 1,835 ms
135,356 KB
testcase_08 AC 1,866 ms
135,440 KB
testcase_09 AC 1,761 ms
135,472 KB
testcase_10 AC 1,816 ms
135,524 KB
testcase_11 AC 1,823 ms
135,436 KB
testcase_12 AC 1,852 ms
135,492 KB
testcase_13 AC 1,855 ms
135,332 KB
testcase_14 AC 1,645 ms
135,376 KB
testcase_15 AC 1,662 ms
135,556 KB
testcase_16 AC 1,616 ms
135,388 KB
testcase_17 AC 1,684 ms
135,556 KB
testcase_18 AC 1,669 ms
135,360 KB
testcase_19 AC 1,646 ms
135,384 KB
testcase_20 AC 1,644 ms
135,416 KB
testcase_21 AC 1,682 ms
135,456 KB
testcase_22 AC 1,638 ms
135,364 KB
testcase_23 AC 1,709 ms
135,460 KB
testcase_24 AC 1,742 ms
135,400 KB
testcase_25 AC 1,751 ms
135,400 KB
testcase_26 AC 1,750 ms
135,476 KB
testcase_27 AC 1,741 ms
135,376 KB
testcase_28 AC 1,739 ms
135,316 KB
testcase_29 AC 2,009 ms
135,492 KB
testcase_30 AC 2,001 ms
135,324 KB
testcase_31 AC 1,977 ms
135,340 KB
testcase_32 AC 2,013 ms
135,456 KB
testcase_33 AC 2,021 ms
135,328 KB
testcase_34 AC 1,747 ms
135,420 KB
testcase_35 AC 37 ms
135,312 KB
testcase_36 AC 37 ms
135,232 KB
testcase_37 AC 39 ms
135,424 KB
testcase_38 AC 38 ms
135,204 KB
testcase_39 AC 38 ms
135,420 KB
testcase_40 AC 37 ms
135,208 KB
testcase_41 AC 39 ms
135,200 KB
testcase_42 AC 39 ms
135,204 KB
testcase_43 AC 2,030 ms
135,572 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

constexpr int lim = 50000;
constexpr int alpha = 'z' - 'a' + 1;

mint dp[lim][alpha][alpha];

int main() {
    int n; cin >> n;
    string s; cin >> s;

    if (n == 1) {
        cout << (s[0] == '?' ? alpha : 1) << endl;
        return 0;
    }

    for (char c = 'a'; c <= 'z'; ++c) {
        if (!(s[0] == c || s[0] == '?')) {
            continue;
        }
        for (char d = 'a'; d <= 'z'; ++d) {
            if (!(s[1] == d || s[1] == '?') || c == d) {
                continue;
            }
            dp[1][c - 'a'][d - 'a'] = 1;
        }
    }

    for (int i = 2; i < n; ++i) {
        for (char c = 'a'; c <= 'z'; ++c) {
            for (char d = 'a'; d <= 'z'; ++d) {
                if (c == d) {
                    continue;
                }
                for (char e = 'a'; e <= 'z'; ++e) {
                    if (e == c || e == d) {
                        continue;
                    }
                    if (!(s[i] == e || s[i] == '?')) {
                        continue;
                    }
                    dp[i][d - 'a'][e - 'a'] += dp[i - 1][c - 'a'][d - 'a'];
                }
            }
        }
    }

    mint ans = 0;

    for (char c = 'a'; c <= 'z'; ++c) {
        for (char d = 'a'; d <= 'z'; ++d) {
            ans += dp[n - 1][c - 'a'][d - 'a'];
        }
    }

    cout << ans.val() << endl;
}
0