結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | Navier_Boltzmann |
提出日時 | 2023-11-29 15:33:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,348 bytes |
コンパイル時間 | 322 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 343,500 KB |
最終ジャッジ日時 | 2023-11-29 15:35:48 |
合計ジャッジ時間 | 98,136 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
57,844 KB |
testcase_01 | AC | 44 ms
57,844 KB |
testcase_02 | AC | 1,271 ms
189,844 KB |
testcase_03 | AC | 1,528 ms
248,868 KB |
testcase_04 | AC | 1,246 ms
183,664 KB |
testcase_05 | AC | 1,033 ms
120,160 KB |
testcase_06 | AC | 1,365 ms
193,272 KB |
testcase_07 | AC | 1,121 ms
261,516 KB |
testcase_08 | AC | 653 ms
82,848 KB |
testcase_09 | AC | 1,249 ms
265,364 KB |
testcase_10 | AC | 770 ms
107,540 KB |
testcase_11 | AC | 622 ms
135,736 KB |
testcase_12 | AC | 1,045 ms
179,080 KB |
testcase_13 | AC | 1,419 ms
265,632 KB |
testcase_14 | AC | 1,113 ms
153,584 KB |
testcase_15 | AC | 1,475 ms
207,460 KB |
testcase_16 | AC | 1,749 ms
259,984 KB |
testcase_17 | WA | - |
testcase_18 | AC | 1,229 ms
255,936 KB |
testcase_19 | AC | 866 ms
139,436 KB |
testcase_20 | AC | 1,583 ms
264,660 KB |
testcase_21 | AC | 903 ms
88,976 KB |
testcase_22 | AC | 1,866 ms
266,784 KB |
testcase_23 | AC | 1,883 ms
266,560 KB |
testcase_24 | AC | 1,864 ms
266,424 KB |
testcase_25 | AC | 1,855 ms
259,324 KB |
testcase_26 | AC | 1,844 ms
266,712 KB |
testcase_27 | AC | 1,908 ms
259,320 KB |
testcase_28 | AC | 1,823 ms
260,204 KB |
testcase_29 | AC | 1,861 ms
259,696 KB |
testcase_30 | AC | 1,888 ms
259,372 KB |
testcase_31 | AC | 1,820 ms
265,704 KB |
testcase_32 | AC | 1,819 ms
259,600 KB |
testcase_33 | AC | 1,847 ms
259,632 KB |
testcase_34 | AC | 1,825 ms
266,056 KB |
testcase_35 | AC | 1,825 ms
267,136 KB |
testcase_36 | AC | 1,813 ms
266,056 KB |
testcase_37 | AC | 1,821 ms
259,784 KB |
testcase_38 | AC | 1,823 ms
265,944 KB |
testcase_39 | AC | 1,839 ms
266,924 KB |
testcase_40 | AC | 1,833 ms
267,372 KB |
testcase_41 | AC | 1,823 ms
265,832 KB |
testcase_42 | AC | 1,253 ms
151,084 KB |
testcase_43 | AC | 1,302 ms
150,972 KB |
testcase_44 | AC | 1,310 ms
150,952 KB |
testcase_45 | AC | 1,263 ms
150,956 KB |
testcase_46 | AC | 1,323 ms
150,960 KB |
testcase_47 | AC | 1,262 ms
251,112 KB |
testcase_48 | AC | 1,242 ms
251,120 KB |
testcase_49 | AC | 1,251 ms
251,120 KB |
testcase_50 | AC | 1,248 ms
251,112 KB |
testcase_51 | AC | 1,205 ms
251,248 KB |
testcase_52 | AC | 937 ms
343,496 KB |
testcase_53 | AC | 929 ms
343,496 KB |
testcase_54 | AC | 925 ms
343,500 KB |
testcase_55 | AC | 951 ms
247,652 KB |
testcase_56 | AC | 978 ms
247,728 KB |
testcase_57 | AC | 971 ms
247,728 KB |
testcase_58 | AC | 536 ms
199,900 KB |
testcase_59 | AC | 1,851 ms
266,344 KB |
testcase_60 | AC | 635 ms
79,944 KB |
testcase_61 | AC | 978 ms
247,652 KB |
testcase_62 | AC | 169 ms
78,988 KB |
testcase_63 | AC | 732 ms
80,168 KB |
testcase_64 | AC | 710 ms
79,816 KB |
testcase_65 | AC | 758 ms
80,572 KB |
testcase_66 | AC | 975 ms
247,384 KB |
testcase_67 | AC | 1,293 ms
82,296 KB |
testcase_68 | AC | 522 ms
78,864 KB |
testcase_69 | AC | 1,295 ms
83,212 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()] 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 = rh.query(0,0,n),rh.query(1,0,n) if (v0 in X[0])&(v1 in X[1]): print('Yes') else: print('No') X[0].add(v0) X[1].add(v1) # 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) # print(i,v0,v1) # print(s)