#704089 (PyPy3) No.1695 Mirror Mirror

• 問題: No.1695 Mirror Mirror
• ユーザー: chineristAC
• 提出日時: 2021-10-01 22:54:03
• 言語: PyPy3 (7.3.15)
• 結果: RE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 2,714 bytes
• コンパイル時間: 337 ms
• コンパイル使用メモリ: 82,304 KB
• 実行使用メモリ: 180,412 KB
• 最終ジャッジ日時: 2024-12-29 20:07:22
• 合計ジャッジ時間: 16,567 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 60 RE * 1

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
class SegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        self.size = n
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
    def update(self, k, x):
        k += self.num
        self.tree[k] = x
        while k > 1:
            k >>= 1
            self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])
    def query(self, l, r):
        if r==self.size:
            r = self.num
        res = self.ide_ele
        l += self.num
        r += self.num
        right = []
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                right.append(self.tree[r-1])
            l >>= 1
            r >>= 1
        for e in right[::-1]:
            res = self.segfunc(res,e)
        return res
from math import radians
import sys,random
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
"""
from:https://tjkendev.github.io/procon-library/python/string/manacher.html
"""
# 偶数長含めた回文の長さを求める
# R[2*i] = L: S[i]を中心とする奇数長の最大回文
# R[2*i+1] = L: S[i:i+2]を中心とする偶数長の最大回文
# ダミー文字を挟むが、各 R[i] は実際の回文の文字列長と一致する
def manacher(S):
    C = []
    for a in S:
        C.append(a)
        C.append(0)
    C.pop()
    L = len(C)
    R = [0]*L
    i = j = 0
    while i < L:
        while j <= i < L-j and C[i-j] == C[i+j]:
            j += 1
        R[i] = j
        k = 1
        while j-R[i-k] > k <= i < L-k:
            R[i+k] = R[i-k]
            k += 1
        i += k; j -= k
    return R
N,M = mi()
S = input()
T = input()
if M&1:
    exit(print(-1))
if any(T[i]!=T[-i-1] for i in range(M)):
    exit(print(-1))
R = manacher(T)
m = M//2
INF = 10**9
dp = [INF for i in range(M)]
dp[-1] = 0
dp = SegmentTree([INF]*M,min,INF)
dp.update(M-1,0)
for i in range(M-2,-1,-1):
    l = i
    r = i + (R[2*i+1]//2)
    tmp = dp.query(l+1,r+1) + 1
    if tmp < INF:
        dp.update(i,tmp)
dp = dp.tree[dp.num:]
res = INF
for i in range(N):
    if S[i]==T[i]:
        res = min(res,dp[i])
    else:
        break
for i in range(N-1,-1,-1):
    if S[i]==T[M-1-(N-1-i)]:
        res = min(res,dp[N-1-i])
    else:
        break
if res==INF:
    print(-1)
else:
    print(res)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX