結果
| 問題 | No.1646 Avoid Palindrome |
| ユーザー |
 ansain
|
| 提出日時 | 2021-08-13 21:39:20 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 2,354 bytes |
| コンパイル時間 | 344 ms |
| コンパイル使用メモリ | 82,528 KB |
| 実行使用メモリ | 127,564 KB |
| 最終ジャッジ日時 | 2024-04-14 17:13:41 |
| 合計ジャッジ時間 | 5,343 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 42 ms
62,744 KB |
| testcase_01 | AC | 41 ms
54,912 KB |
| testcase_02 | AC | 41 ms
54,904 KB |
| testcase_03 | AC | 95 ms
76,540 KB |
| testcase_04 | TLE | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
ソースコード
import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod, comb #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)
def main():
mod = 10**9+7
mod2 = 998244353
n = int(input())
s = input()
dp = defaultdict(int)
bet = 'abcdefghijklmnopqrstuvwxyz'
if n == 1 and s == '?':
print(26)
elif n == 1:
print(1)
else:
if s[:2] == '??':
for a, b in product(bet, repeat=2):
if a != b:
dp[a+b] = 1
elif s[0] == '?':
for a in bet:
if a != s[1]:
dp[a+s[1]] = 1
elif s[1] == '?':
for a in bet:
if a != s[0]:
dp[s[0]+a] = 1
elif s[0] != s[1]:
dp[s[:2]] = 1
for ss in s[2:]:
newdp = defaultdict(int)
if ss == '?':
for key, value in dp.items():
v = value % mod2
for a in bet:
if key[0] != a and key[1] != a:
newdp[key[1]+a] += v
else:
for key, value in dp.items():
v = value % mod2
if key[0] != ss and key[1] != ss:
newdp[key[1]+ss] += v
dp=newdp
print(sum(v for v in dp.values())%mod2)
if __name__ == '__main__':
main()