結果
問題 | No.2020 Sum of Common Prefix Length |
ユーザー | souta-1326 |
提出日時 | 2022-07-12 22:56:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 855 ms / 2,000 ms |
コード長 | 2,159 bytes |
コンパイル時間 | 350 ms |
コンパイル使用メモリ | 86,708 KB |
実行使用メモリ | 275,592 KB |
最終ジャッジ日時 | 2023-09-06 02:02:26 |
合計ジャッジ時間 | 27,542 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 225 ms
183,392 KB |
testcase_01 | AC | 226 ms
183,700 KB |
testcase_02 | AC | 223 ms
183,896 KB |
testcase_03 | AC | 291 ms
190,492 KB |
testcase_04 | AC | 293 ms
191,368 KB |
testcase_05 | AC | 291 ms
190,996 KB |
testcase_06 | AC | 288 ms
190,836 KB |
testcase_07 | AC | 515 ms
211,176 KB |
testcase_08 | AC | 510 ms
211,668 KB |
testcase_09 | AC | 534 ms
211,580 KB |
testcase_10 | AC | 575 ms
211,760 KB |
testcase_11 | AC | 542 ms
211,700 KB |
testcase_12 | AC | 536 ms
211,332 KB |
testcase_13 | AC | 534 ms
211,232 KB |
testcase_14 | AC | 537 ms
211,392 KB |
testcase_15 | AC | 855 ms
274,256 KB |
testcase_16 | AC | 845 ms
275,592 KB |
testcase_17 | AC | 610 ms
222,640 KB |
testcase_18 | AC | 585 ms
216,396 KB |
testcase_19 | AC | 579 ms
217,240 KB |
testcase_20 | AC | 653 ms
247,552 KB |
testcase_21 | AC | 737 ms
243,140 KB |
testcase_22 | AC | 790 ms
242,536 KB |
testcase_23 | AC | 735 ms
241,952 KB |
testcase_24 | AC | 745 ms
247,348 KB |
testcase_25 | AC | 748 ms
246,396 KB |
testcase_26 | AC | 508 ms
222,592 KB |
testcase_27 | AC | 223 ms
183,380 KB |
testcase_28 | AC | 605 ms
231,876 KB |
testcase_29 | AC | 607 ms
232,560 KB |
testcase_30 | AC | 613 ms
231,752 KB |
testcase_31 | AC | 618 ms
244,076 KB |
testcase_32 | AC | 634 ms
245,308 KB |
testcase_33 | AC | 587 ms
225,824 KB |
testcase_34 | AC | 677 ms
242,672 KB |
testcase_35 | AC | 682 ms
242,524 KB |
testcase_36 | AC | 711 ms
259,904 KB |
testcase_37 | AC | 697 ms
249,480 KB |
ソースコード
import sys from copy import deepcopy readline = sys.stdin.readline class Fenwick_Tree: def __init__(self,N:int): self.N = N self.dat = [0]*(N+1) def inc(self,p:int): p += 1 while p <= self.N: self.dat[p] += 1 p += p&-p def dec(self,p:int): p += 1 while p <= self.N: self.dat[p] -= 1 p += p&-p def _sum(self,r:int): s = 0 while r: s += self.dat[r] r -= r&-r return s class EulerTour: def __init__(self,G): self.N = len(G) self.begin = [0]*self.N self.end = [0]*self.N self.B_v = Fenwick_Tree(self.N*2) cnt = 0 f = 0 itr = [0]*self.N par = [0]*self.N par[f] = -1 while f != -1: if itr[f] == 0: self.begin[f] = cnt;cnt+=1 if itr[f] == len(G[f]): self.end[f] = cnt;cnt+=1 f = par[f] continue par[G[f][itr[f]]] = f itr[f]+=1 f = G[f][itr[f]-1] def add(self,p:int): self.B_v.inc(self.begin[p]) self.B_v.dec(self.end[p]) def query(self,p:int): return self.B_v._sum(self.begin[p]+1) def main(): N = int(readline()) S = [list(map(lambda c:ord(c)-97,readline().rstrip())) for _ in range(N)] Q = int(readline()) T = [0]*Q X = [0]*Q C = [""]*Q for i in range(Q): I = readline().split() T[i] = int(I[0]);X[i] = int(I[1])-1 if T[i]==1:C[i] = ord(I[2][0])-97 len_node = 1 nex = [[-1]*26 for i in range(400000)] S2 = deepcopy(S) for i in range(Q): if T[i] == 1: S2[X[i]].append(C[i]) for i in range(N): now_node = 0 for z in S2[i]: if nex[now_node][z] == -1: nex[now_node][z] = len_node len_node += 1 #nex.append([-1]*26) now_node = nex[now_node][z] V = len_node Eul = EulerTour([[elem for elem in nex[i] if elem != -1] for i in range(V)]) now_nodes = [0]*N for i in range(N): for z in S[i]: now_nodes[i] = nex[now_nodes[i]][z] Eul.add(now_nodes[i]) for i in range(Q): if T[i] == 1: now_nodes[X[i]] = nex[now_nodes[X[i]]][C[i]] Eul.add(now_nodes[X[i]]) else: print(Eul.query(now_nodes[X[i]])) if __name__ == "__main__": main()