結果
問題 | No.2162 Copy and Paste 2 |
ユーザー | akakimidori |
提出日時 | 2021-12-22 12:12:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,155 ms / 7,000 ms |
コード長 | 2,130 bytes |
コンパイル時間 | 238 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 103,936 KB |
最終ジャッジ日時 | 2024-04-24 13:02:42 |
合計ジャッジ時間 | 18,409 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
52,480 KB |
testcase_01 | AC | 37 ms
52,480 KB |
testcase_02 | AC | 36 ms
52,608 KB |
testcase_03 | AC | 36 ms
52,352 KB |
testcase_04 | AC | 36 ms
52,736 KB |
testcase_05 | AC | 36 ms
52,480 KB |
testcase_06 | AC | 244 ms
90,240 KB |
testcase_07 | AC | 259 ms
89,984 KB |
testcase_08 | AC | 495 ms
94,976 KB |
testcase_09 | AC | 524 ms
90,112 KB |
testcase_10 | AC | 496 ms
89,856 KB |
testcase_11 | AC | 624 ms
92,544 KB |
testcase_12 | AC | 648 ms
91,136 KB |
testcase_13 | AC | 888 ms
94,728 KB |
testcase_14 | AC | 532 ms
91,008 KB |
testcase_15 | AC | 590 ms
90,624 KB |
testcase_16 | AC | 577 ms
91,008 KB |
testcase_17 | AC | 835 ms
95,376 KB |
testcase_18 | AC | 1,047 ms
94,464 KB |
testcase_19 | AC | 1,022 ms
95,696 KB |
testcase_20 | AC | 960 ms
95,748 KB |
testcase_21 | AC | 591 ms
95,068 KB |
testcase_22 | AC | 627 ms
94,896 KB |
testcase_23 | AC | 173 ms
88,832 KB |
testcase_24 | AC | 1,155 ms
103,552 KB |
testcase_25 | AC | 1,141 ms
103,936 KB |
testcase_26 | AC | 1,067 ms
96,628 KB |
testcase_27 | AC | 1,124 ms
103,852 KB |
testcase_28 | AC | 1,061 ms
96,796 KB |
ソースコード
# https://yukicoder.me/submissions/692361 # これをベースに書き換え # ACL-for-python by shakayami # https://github.com/shakayami/ACL-for-python class string: def z_algorithm(s): n = len(s) if n == 0: return [] z = [0]*n i = 1 j = 0 while(i < n): z[i] = 0 if (j+z[j] <= i) else min(j+z[j]-i, z[i-j]) while((i+z[i] < n) and (s[z[i]] == s[i+z[i]])): z[i] += 1 if (j+z[j] < i+z[i]): j = i i += 1 z[0] = n return z class fenwick_tree(): n = 1 data = [0 for i in range(n)] def __init__(self, N): self.n = N self.data = [0 for i in range(N)] def add(self, p, x): assert 0 <= p < self.n, "0<=p<n,p={0},n={1}".format(p, self.n) p += 1 while(p <= self.n): self.data[p-1] += x p += p & -p def sum(self, l, r): assert (0 <= l and l <= r and r <= self.n), "0<=l<=r<=n,l={0},r={1},n={2}".format(l, r, self.n) return self.sum0(r)-self.sum0(l) def sum0(self, r): s = 0 while(r > 0): s += self.data[r-1] r -= r & -r return s def lower_bound(self, w): if w < 0: return -1 k = 1 while k < self.n: k <<= 1 x = 0 ww = w while k > 0: if x + k - 1 < self.n and self.data[x + k - 1] < ww: ww -= self.data[x + k - 1] x += k k >>= 1 return x s = input() n = len(s) z = string.z_algorithm(s) invz = [[] for i in range(n + 1)] fw = fenwick_tree(n + 1) for i in range(n): if z[i] >= 2: invz[z[i]].append(i) fw.add(i, 1) fw.add(n, 1) dp = [0 for i in range(n + 1)] for j in range(2, n): d = dp[j] dp[j + 1] = max(dp[j + 1], d) d += -1 + j - 1 pos = fw.lower_bound(fw.sum0(j) + 1) + j while pos <= n: dp[pos] = max(dp[pos], d) d += j - 1 pos = fw.lower_bound(fw.sum0(pos) + 1) + j for ii in invz[j]: fw.add(ii, -1) ans = n - dp[n] print(ans)