結果
問題 | No.1695 Mirror Mirror |
ユーザー | eSeF |
提出日時 | 2021-09-15 16:54:06 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 311 ms / 2,000 ms |
コード長 | 1,424 bytes |
コンパイル時間 | 444 ms |
コンパイル使用メモリ | 86,884 KB |
実行使用メモリ | 139,812 KB |
最終ジャッジ日時 | 2023-08-28 16:07:03 |
合計ジャッジ時間 | 12,906 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,600 KB |
testcase_01 | AC | 94 ms
71,620 KB |
testcase_02 | AC | 96 ms
71,692 KB |
testcase_03 | AC | 93 ms
71,808 KB |
testcase_04 | AC | 94 ms
71,844 KB |
testcase_05 | AC | 95 ms
71,556 KB |
testcase_06 | AC | 95 ms
71,696 KB |
testcase_07 | AC | 95 ms
71,788 KB |
testcase_08 | AC | 99 ms
72,072 KB |
testcase_09 | AC | 98 ms
72,396 KB |
testcase_10 | AC | 91 ms
71,608 KB |
testcase_11 | AC | 94 ms
71,708 KB |
testcase_12 | AC | 94 ms
71,616 KB |
testcase_13 | AC | 96 ms
71,428 KB |
testcase_14 | AC | 96 ms
71,768 KB |
testcase_15 | AC | 93 ms
71,616 KB |
testcase_16 | AC | 93 ms
71,600 KB |
testcase_17 | AC | 96 ms
71,668 KB |
testcase_18 | AC | 93 ms
71,424 KB |
testcase_19 | AC | 94 ms
71,892 KB |
testcase_20 | AC | 92 ms
71,572 KB |
testcase_21 | AC | 311 ms
139,812 KB |
testcase_22 | AC | 224 ms
136,804 KB |
testcase_23 | AC | 248 ms
130,836 KB |
testcase_24 | AC | 241 ms
133,864 KB |
testcase_25 | AC | 178 ms
100,244 KB |
testcase_26 | AC | 94 ms
71,568 KB |
testcase_27 | AC | 95 ms
71,376 KB |
testcase_28 | AC | 97 ms
73,284 KB |
testcase_29 | AC | 94 ms
71,608 KB |
testcase_30 | AC | 179 ms
104,076 KB |
testcase_31 | AC | 225 ms
128,944 KB |
testcase_32 | AC | 143 ms
88,460 KB |
testcase_33 | AC | 244 ms
134,556 KB |
testcase_34 | AC | 157 ms
88,172 KB |
testcase_35 | AC | 225 ms
126,208 KB |
testcase_36 | AC | 248 ms
135,008 KB |
testcase_37 | AC | 152 ms
87,488 KB |
testcase_38 | AC | 225 ms
127,120 KB |
testcase_39 | AC | 151 ms
90,240 KB |
testcase_40 | AC | 235 ms
132,216 KB |
testcase_41 | AC | 248 ms
138,180 KB |
testcase_42 | AC | 223 ms
132,828 KB |
testcase_43 | AC | 171 ms
102,752 KB |
testcase_44 | AC | 191 ms
117,864 KB |
testcase_45 | AC | 178 ms
101,772 KB |
testcase_46 | AC | 215 ms
120,752 KB |
testcase_47 | AC | 197 ms
115,720 KB |
testcase_48 | AC | 227 ms
132,996 KB |
testcase_49 | AC | 249 ms
137,756 KB |
testcase_50 | AC | 100 ms
77,988 KB |
testcase_51 | AC | 99 ms
78,940 KB |
testcase_52 | AC | 101 ms
77,680 KB |
testcase_53 | AC | 98 ms
73,316 KB |
testcase_54 | AC | 96 ms
73,028 KB |
testcase_55 | AC | 145 ms
90,576 KB |
testcase_56 | AC | 177 ms
116,240 KB |
testcase_57 | AC | 175 ms
114,220 KB |
testcase_58 | AC | 184 ms
117,048 KB |
testcase_59 | AC | 179 ms
116,928 KB |
testcase_60 | AC | 177 ms
103,240 KB |
testcase_61 | AC | 135 ms
86,868 KB |
testcase_62 | AC | 221 ms
118,136 KB |
testcase_63 | AC | 225 ms
115,224 KB |
testcase_64 | AC | 96 ms
71,732 KB |
ソースコード
from collections import deque def manacher(s): i, j = 0, 0 n = len(s) ret = [0]*n while i < n: while i-j>=0 and i+j<n and s[i-j]==s[i+j]: j+=1 ret[i] = j k = 1 while i-k>=0 and k+ret[i-k]<j: ret[i+k]=ret[i-k] k+=1 i+=k j-=k return ret def manacher_even(s): n = len(s) ret = [0]*(n-1) ss = ['@']*(2*n) for i in range(n): ss[2*i] = s[i] m = manacher(ss) for i in range(n-1): ret[i] = m[2*i+1]//2 return ret N, M = map(int,input().split()) S = input() T = input() if M%2==1: print(-1) exit(0) for i in range(M): if T[i]!=T[M-1-i]: print(-1) exit(0) M//=2 T = T[0:M] INF = 1<<30 dp = [INF]*M bfs = deque() for i in range(N): if i>=M or S[i]!=T[i]: break dp[i] = 1 bfs.append(i) for i in range(N): if i>= M or S[N-1-i]!=T[i]: break if dp[i] == INF: bfs.append(i) dp[i] = 1 R = manacher_even(T) G = [[]for i in range(M)] for i in range(M-1): G[i+1].append((i,0)) if R[i] > 0: G[i].append((i+R[i],1)) while len(bfs) > 0: v = bfs.popleft() for (nx, c) in G[v]: if dp[nx] > dp[v] + c: dp[nx] = dp[v] + c if c == 0: bfs.appendleft(nx) else: bfs.append(nx) print(-1 if dp[M-1] == INF else dp[M-1])