結果
問題 | No.2606 Mirror Relay |
ユーザー | 👑 amentorimaru |
提出日時 | 2023-11-02 00:59:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 303 ms / 2,000 ms |
コード長 | 2,190 bytes |
コンパイル時間 | 177 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 200,816 KB |
最終ジャッジ日時 | 2024-01-02 13:43:33 |
合計ジャッジ時間 | 9,618 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
53,460 KB |
testcase_01 | AC | 36 ms
53,460 KB |
testcase_02 | AC | 37 ms
53,460 KB |
testcase_03 | AC | 38 ms
53,460 KB |
testcase_04 | AC | 53 ms
64,216 KB |
testcase_05 | AC | 48 ms
64,212 KB |
testcase_06 | AC | 50 ms
64,212 KB |
testcase_07 | AC | 51 ms
64,212 KB |
testcase_08 | AC | 48 ms
64,216 KB |
testcase_09 | AC | 49 ms
64,212 KB |
testcase_10 | AC | 49 ms
64,212 KB |
testcase_11 | AC | 49 ms
64,228 KB |
testcase_12 | AC | 53 ms
66,312 KB |
testcase_13 | AC | 49 ms
64,216 KB |
testcase_14 | AC | 37 ms
53,460 KB |
testcase_15 | AC | 38 ms
53,460 KB |
testcase_16 | AC | 37 ms
53,460 KB |
testcase_17 | AC | 37 ms
53,460 KB |
testcase_18 | AC | 37 ms
53,460 KB |
testcase_19 | AC | 70 ms
73,332 KB |
testcase_20 | AC | 67 ms
73,324 KB |
testcase_21 | AC | 68 ms
73,336 KB |
testcase_22 | AC | 71 ms
73,324 KB |
testcase_23 | AC | 68 ms
73,336 KB |
testcase_24 | AC | 71 ms
73,336 KB |
testcase_25 | AC | 64 ms
70,600 KB |
testcase_26 | AC | 55 ms
68,480 KB |
testcase_27 | AC | 67 ms
73,336 KB |
testcase_28 | AC | 71 ms
73,588 KB |
testcase_29 | AC | 52 ms
66,292 KB |
testcase_30 | AC | 51 ms
64,224 KB |
testcase_31 | AC | 53 ms
66,316 KB |
testcase_32 | AC | 54 ms
66,288 KB |
testcase_33 | AC | 56 ms
68,504 KB |
testcase_34 | AC | 51 ms
64,224 KB |
testcase_35 | AC | 53 ms
66,316 KB |
testcase_36 | AC | 54 ms
66,432 KB |
testcase_37 | AC | 50 ms
64,224 KB |
testcase_38 | AC | 51 ms
64,224 KB |
testcase_39 | AC | 139 ms
89,628 KB |
testcase_40 | AC | 136 ms
89,628 KB |
testcase_41 | AC | 140 ms
89,732 KB |
testcase_42 | AC | 142 ms
89,612 KB |
testcase_43 | AC | 138 ms
89,616 KB |
testcase_44 | AC | 142 ms
89,832 KB |
testcase_45 | AC | 136 ms
89,912 KB |
testcase_46 | AC | 139 ms
89,720 KB |
testcase_47 | AC | 138 ms
88,316 KB |
testcase_48 | AC | 137 ms
90,040 KB |
testcase_49 | AC | 202 ms
115,852 KB |
testcase_50 | AC | 205 ms
117,712 KB |
testcase_51 | AC | 201 ms
120,124 KB |
testcase_52 | AC | 174 ms
109,348 KB |
testcase_53 | AC | 178 ms
118,936 KB |
testcase_54 | AC | 196 ms
115,072 KB |
testcase_55 | AC | 233 ms
140,572 KB |
testcase_56 | AC | 197 ms
117,068 KB |
testcase_57 | AC | 175 ms
110,432 KB |
testcase_58 | AC | 212 ms
125,272 KB |
testcase_59 | AC | 142 ms
90,052 KB |
testcase_60 | AC | 142 ms
89,652 KB |
testcase_61 | AC | 136 ms
90,020 KB |
testcase_62 | AC | 139 ms
89,916 KB |
testcase_63 | AC | 142 ms
90,152 KB |
testcase_64 | AC | 138 ms
89,900 KB |
testcase_65 | AC | 144 ms
89,716 KB |
testcase_66 | AC | 140 ms
89,916 KB |
testcase_67 | AC | 140 ms
90,068 KB |
testcase_68 | AC | 139 ms
90,264 KB |
testcase_69 | AC | 303 ms
200,816 KB |
testcase_70 | AC | 37 ms
53,460 KB |
testcase_71 | AC | 38 ms
53,460 KB |
testcase_72 | AC | 37 ms
53,460 KB |
ソースコード
import sys input = sys.stdin.readline def read_values(): return tuple(map(int, input().split())) def read_list(): return list(map(int, input().split())) class PalindromicTree: def __init__(self): self.st=[] self.length=[-1,0] self.parent=[0,0] self.count=[0,0] self.link=[dict() for _ in range(2)] self.lastNodeIdx=0 def add(self,v): self.st.append(v) prevNodeIdx=self.lastNodeIdx nextNodeIdx=self.lastNodeIdx while True: head = self.length[nextNodeIdx] + 2 if head <= len(self.st) and self.st[-head]==self.st[-1]: break nextNodeIdx=self.parent[nextNodeIdx] nextLen=self.length[nextNodeIdx]+2 if v in self.link[nextNodeIdx].keys(): self.lastNodeIdx=self.link[nextNodeIdx][v] self.count[self.lastNodeIdx]+=1 return self.lastNodeIdx=len(self.length) self.length.append(nextLen) if self.length[-1]==1: self.parent.append(1) else: prevNodeIdx=self.parent[nextNodeIdx] while True: head = self.length[prevNodeIdx] + 2 if head <= len(self.st) and self.st[-head]==self.st[-1]: break prevNodeIdx=self.parent[prevNodeIdx] self.parent.append(self.link[prevNodeIdx][v]) self.count.append(1) self.link[nextNodeIdx][v]=self.lastNodeIdx self.link.append(dict()) def main(): s=input() pt = PalindromicTree() for i in range(len(s)): pt.add(s[i]) nodeCount = len(pt.length) count=pt.count[:] for i in range(nodeCount-1,1,-1): count[pt.parent[i]]+=count[i] score=[-1]*nodeCount score[0]=0 score[1]=0 for i in range(nodeCount): if score[i]!=-1: continue stk=[i] while score[stk[-1]]==-1: stk.append(pt.parent[stk[-1]]) tmp=score[stk[-1]] stk.pop() for v in stk[::-1]: tmp+=pt.length[v]*count[v] score[v]=tmp print(max(score)) if __name__ == "__main__": main()