結果
問題 | No.1646 Avoid Palindrome |
ユーザー | ansain |
提出日時 | 2021-08-13 21:56:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,506 ms / 3,000 ms |
コード長 | 2,419 bytes |
コンパイル時間 | 393 ms |
コンパイル使用メモリ | 82,668 KB |
実行使用メモリ | 79,624 KB |
最終ジャッジ日時 | 2024-04-26 02:51:20 |
合計ジャッジ時間 | 39,816 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
62,688 KB |
testcase_01 | AC | 53 ms
64,588 KB |
testcase_02 | AC | 51 ms
63,364 KB |
testcase_03 | AC | 59 ms
66,148 KB |
testcase_04 | AC | 1,219 ms
78,648 KB |
testcase_05 | AC | 1,234 ms
78,880 KB |
testcase_06 | AC | 1,371 ms
78,760 KB |
testcase_07 | AC | 1,209 ms
78,916 KB |
testcase_08 | AC | 1,221 ms
78,712 KB |
testcase_09 | AC | 1,147 ms
78,500 KB |
testcase_10 | AC | 1,404 ms
79,516 KB |
testcase_11 | AC | 1,427 ms
79,028 KB |
testcase_12 | AC | 1,218 ms
78,640 KB |
testcase_13 | AC | 1,226 ms
78,780 KB |
testcase_14 | AC | 967 ms
79,048 KB |
testcase_15 | AC | 970 ms
79,316 KB |
testcase_16 | AC | 958 ms
79,168 KB |
testcase_17 | AC | 979 ms
79,284 KB |
testcase_18 | AC | 969 ms
79,400 KB |
testcase_19 | AC | 941 ms
79,040 KB |
testcase_20 | AC | 946 ms
79,056 KB |
testcase_21 | AC | 960 ms
79,272 KB |
testcase_22 | AC | 929 ms
78,972 KB |
testcase_23 | AC | 991 ms
79,368 KB |
testcase_24 | AC | 1,011 ms
79,524 KB |
testcase_25 | AC | 1,012 ms
79,576 KB |
testcase_26 | AC | 1,066 ms
79,316 KB |
testcase_27 | AC | 1,025 ms
79,216 KB |
testcase_28 | AC | 1,005 ms
79,624 KB |
testcase_29 | AC | 1,431 ms
78,828 KB |
testcase_30 | AC | 1,485 ms
79,212 KB |
testcase_31 | AC | 1,506 ms
79,056 KB |
testcase_32 | AC | 1,500 ms
79,300 KB |
testcase_33 | AC | 1,423 ms
79,160 KB |
testcase_34 | AC | 1,002 ms
78,640 KB |
testcase_35 | AC | 40 ms
55,252 KB |
testcase_36 | AC | 40 ms
55,692 KB |
testcase_37 | AC | 41 ms
54,708 KB |
testcase_38 | AC | 40 ms
54,852 KB |
testcase_39 | AC | 40 ms
54,120 KB |
testcase_40 | AC | 43 ms
54,940 KB |
testcase_41 | AC | 44 ms
60,344 KB |
testcase_42 | AC | 42 ms
60,824 KB |
testcase_43 | AC | 1,427 ms
79,504 KB |
ソースコード
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() #s = '?'*(5*10**4) s = [ord(ss)-97 for ss in s] dp = [0]*(26**2) bet = list(range(26)) if n == 1 and s == [-34]: print(26) elif n == 1: print(1) else: if s[:2] == [-34, -34]: for a, b in product(bet, repeat=2): if a != b: dp[a*26+b] = 1 elif s[0] == -34: for a in bet: if a != s[1]: dp[a*26+s[1]] = 1 elif s[1] == -34: for a in bet: if a != s[0]: dp[s[0]*26+a] = 1 elif s[0] != s[1]: dp[s[0]*26+s[1]] = 1 for ss in s[2:]: newdp = [0]*(26**2) dpsum= [sum(dp[a*26+b] for a in bet)%mod2 for b in bet] if ss == -34: for b in bet: for new in bet: if b!=new: newdp[b*26+new]=dpsum[b]-dp[new*26+b] else: for key, value in enumerate(dp): v = value % mod2 if key//26 != ss and key % 26 != ss: newdp[(key%26)*26+ss] += v dp = newdp print(sum(dp) % mod2) if __name__ == '__main__': main()