結果
| 問題 | No.2992 Range ABCD String Query |
| ユーザー |
 nikoro256
|
| 提出日時 | 2024-12-17 01:02:37 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 4,767 bytes |
| コンパイル時間 | 466 ms |
| コンパイル使用メモリ | 82,420 KB |
| 実行使用メモリ | 353,324 KB |
| 最終ジャッジ日時 | 2024-12-17 01:06:03 |
| 合計ジャッジ時間 | 180,745 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,335 ms
353,324 KB |
| testcase_01 | AC | 1,294 ms
83,144 KB |
| testcase_02 | AC | 1,676 ms
85,864 KB |
| testcase_03 | AC | 1,535 ms
84,032 KB |
| testcase_04 | AC | 1,802 ms
86,584 KB |
| testcase_05 | AC | 1,384 ms
83,600 KB |
| testcase_06 | AC | 1,683 ms
85,392 KB |
| testcase_07 | AC | 991 ms
83,488 KB |
| testcase_08 | AC | 1,903 ms
88,236 KB |
| testcase_09 | AC | 1,511 ms
84,332 KB |
| testcase_10 | TLE | - |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | TLE | - |
| testcase_18 | TLE | - |
| testcase_19 | TLE | - |
| testcase_20 | AC | 4,635 ms
272,316 KB |
| testcase_21 | AC | 5,104 ms
273,412 KB |
| testcase_22 | AC | 4,546 ms
271,864 KB |
| testcase_23 | AC | 4,698 ms
273,540 KB |
| testcase_24 | AC | 4,670 ms
272,116 KB |
| testcase_25 | TLE | - |
| testcase_26 | TLE | - |
| testcase_27 | TLE | - |
| testcase_28 | TLE | - |
| testcase_29 | TLE | - |
| testcase_30 | AC | 5,292 ms
215,360 KB |
| testcase_31 | AC | 5,679 ms
214,296 KB |
| testcase_32 | AC | 5,324 ms
214,972 KB |
| testcase_33 | AC | 5,790 ms
215,580 KB |
| testcase_34 | AC | 5,230 ms
215,096 KB |
| testcase_35 | AC | 4,740 ms
147,584 KB |
| testcase_36 | AC | 4,748 ms
147,072 KB |
| testcase_37 | AC | 688 ms
80,220 KB |
| testcase_38 | AC | 839 ms
82,200 KB |
| testcase_39 | AC | 1,015 ms
83,460 KB |
| testcase_40 | AC | 998 ms
293,096 KB |
ソースコード
import typing
def _ceil_pow2(n: int) -> int:
x = 0
while (1 << x) < n:
x += 1
return x
def _bsf(n: int) -> int:
x = 0
while n % 2 == 0:
x += 1
n //= 2
return x
class SegTree:
def __init__(self,
op: typing.Callable[[typing.Any, typing.Any], typing.Any],
e: typing.Any,
v: typing.Union[int, typing.List[typing.Any]]) -> None:
self._op = op
self._e = e
if isinstance(v, int):
v = [e] * v
self._n = len(v)
self._log = _ceil_pow2(self._n)
self._size = 1 << self._log
self._d = [e] * (2 * self._size)
for i in range(self._n):
self._d[self._size + i] = v[i]
for i in range(self._size - 1, 0, -1):
self._update(i)
def set(self, p: int, x: typing.Any) -> None:
assert 0 <= p < self._n
p += self._size
self._d[p] = x
for i in range(1, self._log + 1):
self._update(p >> i)
def get(self, p: int) -> typing.Any:
assert 0 <= p < self._n
return self._d[p + self._size]
def prod(self, left: int, right: int) -> typing.Any:
assert 0 <= left <= right <= self._n
sml = self._e
smr = self._e
left += self._size
right += self._size
while left < right:
if left & 1:
sml = self._op(sml, self._d[left])
left += 1
if right & 1:
right -= 1
smr = self._op(self._d[right], smr)
left >>= 1
right >>= 1
return self._op(sml, smr)
def all_prod(self) -> typing.Any:
return self._d[1]
def max_right(self, left: int,
f: typing.Callable[[typing.Any], bool]) -> int:
assert 0 <= left <= self._n
assert f(self._e)
if left == self._n:
return self._n
left += self._size
sm = self._e
first = True
while first or (left & -left) != left:
first = False
while left % 2 == 0:
left >>= 1
if not f(self._op(sm, self._d[left])):
while left < self._size:
left *= 2
if f(self._op(sm, self._d[left])):
sm = self._op(sm, self._d[left])
left += 1
return left - self._size
sm = self._op(sm, self._d[left])
left += 1
return self._n
def min_left(self, right: int,
f: typing.Callable[[typing.Any], bool]) -> int:
assert 0 <= right <= self._n
assert f(self._e)
if right == 0:
return 0
right += self._size
sm = self._e
first = True
while first or (right & -right) != right:
first = False
right -= 1
while right > 1 and right % 2:
right >>= 1
if not f(self._op(self._d[right], sm)):
while right < self._size:
right = 2 * right + 1
if f(self._op(self._d[right], sm)):
sm = self._op(self._d[right], sm)
right -= 1
return right + 1 - self._size
sm = self._op(self._d[right], sm)
return 0
def _update(self, k: int) -> None:
self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])
N,Q=map(int,input().split())
S=input()
S=list(S)
"""
a
b
c
d
ab
bc
cd
da
abc
bcd
d
"""
change = []
for i in range(4):
for j in range(4):
if j + i < 4:
change.append((j,j+i))
move = []
for k in range(len(change)):
for t in range(len(change)):
if change[k][1] <= change[t][0]:
new = (change[k][0],change[t][1])
move.append((k,t,change.index(new)))
s = "ABCD"
def one(n):
count = 0
res = []
for i in range(4):
for j in range(4):
if j + i < 4:
count += 1
if j <= n <= j+i:
res.append(0)
else:
res.append(1)
return tuple(res)
ones = [one(i) for i in range(4)]
inf = 10**10
def op(a,b):
new = [inf for _ in range(10)]
for a_,b_,c in move:
new[c] =min(new[c], a[a_]+b[b_])
return tuple(new)
st = SegTree(op=lambda a,b:op(a,b),e=tuple(0 for _ in range(10)),v=[ones[s.index(S[i])] for i in range(N)])
for _ in range(Q):
q=list(map(str,input().split()))
if q[0] == "1":
_,x,c = q
x=int(x)
st.set(x-1,one(s.index(c)))
else:
_,l,r = q
l=int(l)
r=int(r)
ans=st.prod(l-1,r)
print(min(ans))