結果
問題 | No.2020 Sum of Common Prefix Length |
ユーザー | souta-1326 |
提出日時 | 2022-07-12 23:32:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 828 ms / 2,000 ms |
コード長 | 2,125 bytes |
コンパイル時間 | 276 ms |
コンパイル使用メモリ | 87,088 KB |
実行使用メモリ | 291,072 KB |
最終ジャッジ日時 | 2023-09-06 02:50:38 |
合計ジャッジ時間 | 25,269 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 213 ms
183,896 KB |
testcase_01 | AC | 216 ms
183,980 KB |
testcase_02 | AC | 217 ms
184,088 KB |
testcase_03 | AC | 278 ms
191,964 KB |
testcase_04 | AC | 280 ms
191,612 KB |
testcase_05 | AC | 276 ms
191,768 KB |
testcase_06 | AC | 275 ms
191,788 KB |
testcase_07 | AC | 514 ms
227,188 KB |
testcase_08 | AC | 520 ms
227,520 KB |
testcase_09 | AC | 531 ms
227,732 KB |
testcase_10 | AC | 524 ms
227,312 KB |
testcase_11 | AC | 535 ms
228,164 KB |
testcase_12 | AC | 521 ms
227,692 KB |
testcase_13 | AC | 526 ms
227,252 KB |
testcase_14 | AC | 526 ms
228,088 KB |
testcase_15 | AC | 828 ms
291,072 KB |
testcase_16 | AC | 825 ms
290,964 KB |
testcase_17 | AC | 631 ms
239,540 KB |
testcase_18 | AC | 590 ms
232,920 KB |
testcase_19 | AC | 593 ms
234,840 KB |
testcase_20 | AC | 673 ms
263,020 KB |
testcase_21 | AC | 715 ms
258,144 KB |
testcase_22 | AC | 774 ms
258,608 KB |
testcase_23 | AC | 744 ms
257,412 KB |
testcase_24 | AC | 755 ms
263,300 KB |
testcase_25 | AC | 751 ms
262,544 KB |
testcase_26 | AC | 512 ms
239,284 KB |
testcase_27 | AC | 215 ms
184,112 KB |
testcase_28 | AC | 612 ms
247,784 KB |
testcase_29 | AC | 620 ms
249,148 KB |
testcase_30 | AC | 610 ms
245,932 KB |
testcase_31 | AC | 626 ms
258,276 KB |
testcase_32 | AC | 632 ms
261,088 KB |
testcase_33 | AC | 585 ms
242,528 KB |
testcase_34 | AC | 677 ms
258,888 KB |
testcase_35 | AC | 666 ms
259,104 KB |
testcase_36 | AC | 763 ms
276,984 KB |
testcase_37 | AC | 747 ms
266,668 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()) Query = [tuple()]*Q for i in range(Q): I = readline().split() Query[i] = tuple([int(I[0]),int(I[1])-1,(0 if I[0]=="2" else ord(I[2][0])-97)]) len_node = 1 nex = [[-1]*26 for i in range(400000)] S2 = deepcopy(S) for t,x,c in Query: if t == 1: S2[x].append(c) 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 t,x,c in Query: if t == 1: now_nodes[x] = nex[now_nodes[x]][c] Eul.add(now_nodes[x]) else: print(Eul.query(now_nodes[x])) if __name__ == "__main__": main()