結果
問題 | No.1646 Avoid Palindrome |
ユーザー | sten_san |
提出日時 | 2023-04-18 00:54:28 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,899 bytes |
コンパイル時間 | 2,383 ms |
コンパイル使用メモリ | 198,428 KB |
実行使用メモリ | 135,812 KB |
最終ジャッジ日時 | 2024-04-21 01:37:29 |
合計ジャッジ時間 | 96,043 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
135,612 KB |
testcase_01 | AC | 62 ms
135,560 KB |
testcase_02 | AC | 61 ms
135,436 KB |
testcase_03 | AC | 61 ms
135,384 KB |
testcase_04 | AC | 2,863 ms
135,452 KB |
testcase_05 | AC | 2,863 ms
135,500 KB |
testcase_06 | AC | 2,757 ms
135,732 KB |
testcase_07 | AC | 2,852 ms
135,628 KB |
testcase_08 | AC | 2,876 ms
135,596 KB |
testcase_09 | AC | 2,739 ms
135,608 KB |
testcase_10 | AC | 2,805 ms
135,704 KB |
testcase_11 | AC | 2,733 ms
135,608 KB |
testcase_12 | AC | 2,844 ms
135,604 KB |
testcase_13 | AC | 2,883 ms
135,596 KB |
testcase_14 | AC | 2,679 ms
135,660 KB |
testcase_15 | AC | 2,735 ms
135,516 KB |
testcase_16 | AC | 2,668 ms
135,752 KB |
testcase_17 | AC | 2,785 ms
135,676 KB |
testcase_18 | AC | 2,712 ms
135,584 KB |
testcase_19 | AC | 2,696 ms
135,688 KB |
testcase_20 | AC | 2,725 ms
135,460 KB |
testcase_21 | AC | 2,779 ms
135,652 KB |
testcase_22 | AC | 2,698 ms
135,712 KB |
testcase_23 | AC | 2,800 ms
135,616 KB |
testcase_24 | AC | 2,904 ms
135,592 KB |
testcase_25 | AC | 2,903 ms
135,448 KB |
testcase_26 | AC | 2,900 ms
135,784 KB |
testcase_27 | AC | 2,897 ms
135,572 KB |
testcase_28 | AC | 2,895 ms
135,616 KB |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | AC | 2,887 ms
135,576 KB |
testcase_35 | AC | 61 ms
135,480 KB |
testcase_36 | AC | 61 ms
135,460 KB |
testcase_37 | AC | 60 ms
135,496 KB |
testcase_38 | AC | 61 ms
135,356 KB |
testcase_39 | AC | 61 ms
135,376 KB |
testcase_40 | AC | 61 ms
135,480 KB |
testcase_41 | AC | 62 ms
135,356 KB |
testcase_42 | AC | 61 ms
135,464 KB |
testcase_43 | TLE | - |
ソースコード
#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; }