結果
問題 | No.2204 Palindrome Splitting (No Rearrangement ver.) |
ユーザー |
![]() |
提出日時 | 2023-02-03 22:11:50 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,469 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 155,264 KB |
最終ジャッジ日時 | 2024-07-02 20:11:44 |
合計ジャッジ時間 | 10,047 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 TLE * 1 |
ソースコード
# UnionFind 参考は以下のサイト# https://note.nkmk.me/python-union-find/from collections import defaultdictclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse:self.parents[x] = self.find(self.parents[x])return self.parents[x]def union(self, x, y):x = self.find(x)y = self.find(y)if x == y:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef size(self, x):return -self.parents[self.find(x)]def same(self, x, y):return self.find(x) == self.find(y)def members(self, x):root = self.find(x)return [i for i in range(self.n) if self.find(i) == root]def roots(self):return [i for i, x in enumerate(self.parents) if x < 0]def group_count(self):return len(self.roots())def all_group_members(self):group_members = defaultdict(list)for member in range(self.n):group_members[self.find(member)].append(member)return group_membersdef __str__(self):return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())def is_ok(x):uf = UnionFind(N+1)for i,l in enumerate(L):for ll in l:if x<=ll:uf.union(i,i+ll)return uf.same(0,N)def meguru_bisect(ng, ok):while (abs(ok - ng) > 1):mid = (ok + ng) // 2if is_ok(mid):ok = midelse:ng = midreturn ok# 非クラス版base = 37; mod = 999983pw = Nonedef rolling_hash(s):l = len(s)h = [0]*(l + 1)v = 0for i in range(l):h[i+1] = v = (v * base + ord(s[i])) % modreturn h# RH前に、必要な長さの最大値分のpow-tableを計算しておくdef setup_pw(l):global pwpw = [1]*(l + 1)v = 1for i in range(l):pw[i+1] = v = v * base % moddef get(h, l, r):return (h[r] - h[l] * pw[r-l]) % modS = list(input())N = len(S)SR = S[::-1]setup_pw(N+2)ST = rolling_hash(S)SRT = rolling_hash(SR)L = [[] for _ in range(N)]for i in range(N):for j in range(1,N-i+1):if get(ST,i,i+j)==get(SRT,N-i-j,N-i):L[i].append(j)print(meguru_bisect(N+1,1))