結果
問題 | No.2204 Palindrome Splitting (No Rearrangement ver.) |
ユーザー | 👑 H20 |
提出日時 | 2023-02-03 22:11:50 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,469 bytes |
コンパイル時間 | 2,243 ms |
コンパイル使用メモリ | 86,760 KB |
実行使用メモリ | 157,180 KB |
最終ジャッジ日時 | 2023-09-15 18:07:39 |
合計ジャッジ時間 | 11,878 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
71,676 KB |
testcase_01 | AC | 91 ms
71,636 KB |
testcase_02 | AC | 90 ms
71,480 KB |
testcase_03 | AC | 198 ms
78,380 KB |
testcase_04 | AC | 136 ms
78,556 KB |
testcase_05 | AC | 126 ms
78,356 KB |
testcase_06 | AC | 251 ms
78,392 KB |
testcase_07 | AC | 236 ms
78,568 KB |
testcase_08 | AC | 228 ms
78,480 KB |
testcase_09 | AC | 231 ms
78,660 KB |
testcase_10 | AC | 249 ms
78,476 KB |
testcase_11 | AC | 226 ms
78,520 KB |
testcase_12 | AC | 249 ms
78,428 KB |
testcase_13 | AC | 249 ms
78,612 KB |
testcase_14 | AC | 254 ms
78,552 KB |
testcase_15 | AC | 242 ms
78,272 KB |
testcase_16 | AC | 170 ms
78,388 KB |
testcase_17 | AC | 183 ms
78,500 KB |
testcase_18 | AC | 250 ms
78,560 KB |
testcase_19 | AC | 253 ms
78,496 KB |
testcase_20 | AC | 251 ms
78,452 KB |
testcase_21 | AC | 248 ms
78,520 KB |
testcase_22 | AC | 252 ms
78,444 KB |
testcase_23 | AC | 248 ms
78,464 KB |
testcase_24 | AC | 251 ms
78,572 KB |
testcase_25 | AC | 250 ms
78,488 KB |
testcase_26 | AC | 249 ms
78,468 KB |
testcase_27 | AC | 230 ms
78,968 KB |
testcase_28 | AC | 246 ms
78,924 KB |
testcase_29 | AC | 243 ms
78,468 KB |
testcase_30 | AC | 88 ms
71,752 KB |
testcase_31 | AC | 89 ms
71,556 KB |
testcase_32 | AC | 615 ms
157,180 KB |
testcase_33 | AC | 250 ms
78,712 KB |
testcase_34 | AC | 89 ms
71,608 KB |
testcase_35 | TLE | - |
ソースコード
# UnionFind 参考は以下のサイト # https://note.nkmk.me/python-union-find/ from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: 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: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def 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_members def __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) // 2 if is_ok(mid): ok = mid else: ng = mid return ok # 非クラス版 base = 37; mod = 999983 pw = None def rolling_hash(s): l = len(s) h = [0]*(l + 1) v = 0 for i in range(l): h[i+1] = v = (v * base + ord(s[i])) % mod return h # RH前に、必要な長さの最大値分のpow-tableを計算しておく def setup_pw(l): global pw pw = [1]*(l + 1) v = 1 for i in range(l): pw[i+1] = v = v * base % mod def get(h, l, r): return (h[r] - h[l] * pw[r-l]) % mod S = 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))