結果
| 問題 |
No.3239 Omnibus
|
| コンテスト | |
| ユーザー |
 detteiuu
|
| 提出日時 | 2025-09-28 00:14:31 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 7,556 bytes |
| コンパイル時間 | 406 ms |
| コンパイル使用メモリ | 82,660 KB |
| 実行使用メモリ | 625,380 KB |
| 最終ジャッジ日時 | 2025-09-28 00:16:59 |
| 合計ジャッジ時間 | 146,039 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 20 MLE * 13 |
ソースコード
class Node:
def __init__(self, init_val):
self.left = None
self.right = None
self.value = init_val
def op(x, y):
return x+y
class DynamicSegmentTree:
def __init__(self, L, R, op, init_val):
self.root = Node(init_val)
self.L = L
self.R = R
self.op = op
self.init_val = init_val
def update(self, idx, value):
stack = [(self.root, self.L, self.R)]
path = []
while stack:
node, s, e = stack.pop()
path.append((node, s, e))
if s == e:
node.value = value
break
mid = (s+e)//2
if idx <= mid:
if not node.left:
node.left = Node(self.init_val)
stack.append((node.left, s, mid))
else:
if not node.right:
node.right = Node(self.init_val)
stack.append((node.right, mid+1, e))
path.pop()
while path:
node, s, e = path.pop()
node.value = self.op(node.left.value if node.left else self.init_val, node.right.value if node.right else self.init_val)
def query(self, l, r):
stack = [(self.root, self.L, self.R)]
ans = self.init_val
while stack:
node, s, e = stack.pop()
if not node or e < l or r < s:
continue
if l <= s and e <= r:
ans = self.op(ans, node.value)
continue
mid = (s+e)//2
stack.append((node.left, s, mid))
stack.append((node.right, mid+1, e))
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)]
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, _, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, b, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def code(s):
return ord(s)-ord("a")
def codeR(n):
return chr(ord("a")+n)
def encode(s):
return 26**2*code(s[0])+26*code(s[1])+code(s[2])
N, Q = map(int, input().split())
S = list(input())
query = [list(input().split()) for _ in range(Q)]
seg = [DynamicSegmentTree(1, N, op, 0) for _ in range(26**3)]
sm = [SortedMultiset() for _ in range(26**3)]
for i in range(N-2):
seg[encode(S[i:i+3])].update(i+1, i+1)
sm[encode(S[i:i+3])].add(i+1)
for i in range(Q):
q = query[i][0]
if q == "1":
k, x = query[i][1:]
k = int(k)
for j in range(max(k-2, 1), min(k, N-2)+1):
seg[encode(S[j-1:j+2])].update(j, 0)
sm[encode(S[j-1:j+2])].discard(j)
S[k-1] = x
for j in range(max(k-2, 1), min(k, N-2)+1):
seg[encode(S[j-1:j+2])].update(j, j)
sm[encode(S[j-1:j+2])].add(j)
else:
l, r, a = query[i][1:]
l, r = int(l), int(r)
b = encode(a)
if r-l+1 < 3:
print(0)
continue
SUM = seg[b].query(l, r-2)
cnt = sm[b].index_right(r-2)-sm[b].index(l)
print(SUM-(l-1)*cnt)