結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | Navier_Boltzmann |
提出日時 | 2023-11-29 15:39:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,235 ms / 3,000 ms |
コード長 | 2,637 bytes |
コンパイル時間 | 414 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 415,376 KB |
最終ジャッジ日時 | 2023-11-29 15:40:59 |
合計ジャッジ時間 | 111,044 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
57,812 KB |
testcase_01 | AC | 45 ms
57,812 KB |
testcase_02 | AC | 1,756 ms
261,284 KB |
testcase_03 | AC | 1,588 ms
261,124 KB |
testcase_04 | AC | 1,414 ms
234,948 KB |
testcase_05 | AC | 1,124 ms
140,668 KB |
testcase_06 | AC | 1,503 ms
248,564 KB |
testcase_07 | AC | 1,419 ms
264,072 KB |
testcase_08 | AC | 631 ms
87,320 KB |
testcase_09 | AC | 1,450 ms
265,148 KB |
testcase_10 | AC | 982 ms
127,772 KB |
testcase_11 | AC | 728 ms
164,848 KB |
testcase_12 | AC | 1,207 ms
230,584 KB |
testcase_13 | AC | 1,747 ms
278,940 KB |
testcase_14 | AC | 1,273 ms
192,896 KB |
testcase_15 | AC | 1,677 ms
262,852 KB |
testcase_16 | AC | 2,055 ms
277,200 KB |
testcase_17 | AC | 943 ms
265,512 KB |
testcase_18 | AC | 1,542 ms
278,144 KB |
testcase_19 | AC | 929 ms
167,324 KB |
testcase_20 | AC | 1,903 ms
276,748 KB |
testcase_21 | AC | 968 ms
92,632 KB |
testcase_22 | AC | 2,228 ms
274,688 KB |
testcase_23 | AC | 2,188 ms
274,496 KB |
testcase_24 | AC | 2,210 ms
274,784 KB |
testcase_25 | AC | 2,182 ms
276,528 KB |
testcase_26 | AC | 2,235 ms
274,940 KB |
testcase_27 | AC | 2,227 ms
275,772 KB |
testcase_28 | AC | 2,199 ms
276,436 KB |
testcase_29 | AC | 2,209 ms
275,024 KB |
testcase_30 | AC | 2,199 ms
276,276 KB |
testcase_31 | AC | 2,192 ms
274,412 KB |
testcase_32 | AC | 2,155 ms
276,216 KB |
testcase_33 | AC | 2,196 ms
275,208 KB |
testcase_34 | AC | 2,183 ms
274,052 KB |
testcase_35 | AC | 2,210 ms
274,236 KB |
testcase_36 | AC | 2,165 ms
276,872 KB |
testcase_37 | AC | 2,176 ms
275,856 KB |
testcase_38 | AC | 2,171 ms
274,604 KB |
testcase_39 | AC | 2,181 ms
273,468 KB |
testcase_40 | AC | 2,166 ms
276,212 KB |
testcase_41 | AC | 2,185 ms
274,128 KB |
testcase_42 | AC | 1,601 ms
184,384 KB |
testcase_43 | AC | 1,574 ms
184,544 KB |
testcase_44 | AC | 1,524 ms
184,544 KB |
testcase_45 | AC | 1,560 ms
184,516 KB |
testcase_46 | AC | 1,556 ms
184,544 KB |
testcase_47 | AC | 1,600 ms
273,988 KB |
testcase_48 | AC | 1,600 ms
274,008 KB |
testcase_49 | AC | 1,584 ms
273,988 KB |
testcase_50 | AC | 1,601 ms
274,012 KB |
testcase_51 | AC | 1,595 ms
273,996 KB |
testcase_52 | AC | 1,338 ms
415,376 KB |
testcase_53 | AC | 1,305 ms
415,376 KB |
testcase_54 | AC | 1,286 ms
415,376 KB |
testcase_55 | AC | 1,330 ms
283,120 KB |
testcase_56 | AC | 1,307 ms
283,120 KB |
testcase_57 | AC | 1,342 ms
283,116 KB |
testcase_58 | AC | 653 ms
214,132 KB |
testcase_59 | AC | 2,141 ms
276,808 KB |
testcase_60 | AC | 716 ms
81,636 KB |
testcase_61 | AC | 1,327 ms
283,120 KB |
testcase_62 | AC | 203 ms
79,464 KB |
testcase_63 | AC | 806 ms
79,308 KB |
testcase_64 | AC | 811 ms
79,036 KB |
testcase_65 | AC | 878 ms
80,080 KB |
testcase_66 | AC | 1,348 ms
283,112 KB |
testcase_67 | AC | 1,396 ms
84,876 KB |
testcase_68 | AC | 637 ms
80,688 KB |
testcase_69 | AC | 1,395 ms
84,748 KB |
ソースコード
from collections import * from itertools import * from functools import * from heapq import * import sys,math input = sys.stdin.readline N = int(input()) class Rolling_hash(): def __init__(self,S,mod_list = [1000000009,998244353,3000012541],base_num_list=[500009,500029,500041]): self.n = len(mod_list) self.S = S self.N = len(self.S) self.H = [[0]*(self.N+1) for _ in range(self.n)] self.b_inv = [[1]*self.N for _ in range(self.n)] self.b = [[1]*self.N for _ in range(self.n)] self.mod_list = mod_list for j in range(self.n): tb = base_num_list[j] base_num = base_num_list[j] mod = mod_list[j] tb_inv = 1 base_inv = pow(base_num,mod-2,mod) tH = self.S[0] self.H[j][1] = tH for i in range(self.N-1): tH = (tH + self.S[i+1]*tb)%mod self.H[j][i+2] = tH self.b[j][i+1] = tb tb = (tb*base_num)%mod tb_inv *= base_inv tb_inv %= mod self.b_inv[j][i+1] = tb_inv # self.b[j][i+1] = tb def query(self,j,l,r): if l==r: return 0 tmp = (self.H[j][r]-self.H[j][l])*self.b_inv[j][l]%self.mod_list[j] return tmp X = [set(),set(),set()] for _ in range(N): s = list(input())[:-1] s = [ord(i)-ord('a')+1 for i in s] + [0] rh = Rolling_hash(s) n = len(s) - 1 v0,v1,v2 = rh.query(0,0,n),rh.query(1,0,n),rh.query(2,0,n) if (v0 in X[0])&(v1 in X[1])&(v2 in X[2]): print('Yes') else: print('No') X[0].add(v0) X[1].add(v1) X[2].add(v2) # print(_,v0,v1) for i in range(n-1): flg = 0 v0 = (rh.query(flg,0,i) + rh.query(flg,i,i+1)*rh.b[flg][i+1] + rh.query(flg,i+1,i+2)*rh.b[flg][i] + rh.query(flg,i+2,n)*rh.b[flg][i+2])%rh.mod_list[flg] X[0].add(v0) flg = 1 v1 = (rh.query(flg,0,i) + rh.query(flg,i,i+1)*rh.b[flg][i+1] + rh.query(flg,i+1,i+2)*rh.b[flg][i] + rh.query(flg,i+2,n)*rh.b[flg][i+2])%rh.mod_list[flg] X[1].add(v1) flg = 2 v2 = (rh.query(flg,0,i) + rh.query(flg,i,i+1)*rh.b[flg][i+1] + rh.query(flg,i+1,i+2)*rh.b[flg][i] + rh.query(flg,i+2,n)*rh.b[flg][i+2])%rh.mod_list[flg] X[2].add(v2) # print(i,v0,v1) # print(s)