結果
| 問題 | No.833 かっこいい電車 |
| ユーザー |
 stng
|
| 提出日時 | 2022-07-10 16:24:59 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,498 bytes |
| コンパイル時間 | 477 ms |
| コンパイル使用メモリ | 82,048 KB |
| 実行使用メモリ | 94,912 KB |
| 最終ジャッジ日時 | 2024-06-11 05:27:00 |
| 合計ジャッジ時間 | 8,710 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 246 ms
92,756 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | AC | 53 ms
68,480 KB |
| testcase_05 | WA | - |
| testcase_06 | AC | 53 ms
68,480 KB |
| testcase_07 | WA | - |
| testcase_08 | AC | 55 ms
68,352 KB |
| testcase_09 | AC | 53 ms
68,224 KB |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | AC | 104 ms
79,468 KB |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | AC | 227 ms
94,912 KB |
| testcase_31 | AC | 255 ms
92,416 KB |
ソースコード
import sys
input = sys.stdin.readline
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
# https://githubplus.com/tatyam-prime/SortedSet
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a=None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = self.size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
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 __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 _find_bucket(self, x: T) -> List[T]:
"Find the bucket which should contain x. self must not be empty."
for a in self.a:
if x <= a[-1]: return a
return a
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a = self._find_bucket(x)
i = bisect_left(a, 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 = self._find_bucket(x)
insort(a, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a = self._find_bucket(x)
i = bisect_left(a, x)
if i == len(a) or a[i] != x: return False
a.pop(i)
self.size -= 1
if len(a) == 0: self._build()
return True
def lt(self, x: T) -> Union[T, None]:
"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) -> Union[T, None]:
"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) -> Union[T, None]:
"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) -> Union[T, None]:
"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, x: int) -> T:
"Return the x-th element, or IndexError if it doesn't exist."
if x < 0: x += self.size
if x < 0: raise IndexError
for a in self.a:
if x < len(a): return a[x]
x -= 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
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
class SegTree(object):
def __init__(self, N, op_data, u_data):
self._n = N
self.log = (N-1).bit_length()
self.size = 1 << self.log
self.op = op_data
self.e = u_data
self.data = [u_data] * (2 * self.size)
# self.len = [1] * (2 * self.size)
def _update(self, i):
self.data[i] = self.op(self.data[i << 1], self.data[i << 1 | 1])
def initialize(self, arr=None):
""" segtreeをarrで初期化する。len(arr) == Nにすること """
if arr:
for i, a in enumerate(arr, self.size):
self.data[i] = a
for i in reversed(range(1, self.size)):
self._update(i)
# self.len[i] = self.len[i << 1] + self.len[i << 1 | 1]
def update(self, p, x):
""" data[p] = x とする (0-indexed)"""
p += self.size
self.data[p] = x
for i in range(1, self.log + 1):
self._update(p >> i)
def get(self, p):
""" data[p]を返す """
return self.data[p + self.size]
def prod(self, l, r):
"""
op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
"""
sml = self.e
smr = self.e
l += self.size
r += self.size
while l < r:
if l & 1:
sml = self.op(sml, self.data[l])
l += 1
if r & 1:
r -= 1
smr = self.op(self.data[r], smr)
l >>= 1
r >>= 1
return self.op(sml, smr)
def all_prod(self):
""" op(data[0], data[1], ... data[N-1])を返す """
return self.data[1]
def max_right(self, l, func):
"""
func(l, l+1, ..., r-1) = True,
func(l, l+1, ..., r-1, r) = Falseとなる r を返す
"""
if l == self._n:
return self._n
l += self.size
sm = self.e
while True:
while l % 2 == 0:
l >>= 1
if not func(self.op(sm, self.data[l])):
while l < self.size:
l <<= 1
if func(self.op(sm, self.data[l])):
sm = self.op(sm, self.data[l])
l += 1
return l - self.size
sm = self.op(sm, self.data[l])
l += 1
if (l & -l) == l:
break
return self._n
def min_left(self, r, func):
"""
func( l, l+1, ..., r-1) = True,
func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
"""
if r == 0:
return 0
r += self.size
sm = self.e
while True:
r -= 1
while r > 1 and r & 1:
r >>= 1
if not func(self.op(self.data[r], sm)):
while r < self.size:
r = r << 1 | 1
if func(self.op(self.data[r], sm)):
sm = self.op(self.data[r], sm)
r -= 1
return r + 1 - self.size
sm = self.op(self.data[r], sm)
if (r & -r) == r:
break
return 0
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
n,q = map(int,input().split())
a = [int(i) for i in input().split()]
qry = [[int(i) for i in input().split()] for j in range(q)]
bit = Bit(n+1) # 要素数を与えてインスタンス化
st = SortedMultiset()
for i in range(n):
bit.add(i+1,a[i])
#for i in range(n+1):
# print(bit.sum(i),i)
#exit()
for i in range(n+1):
st.add(i)
for i in range(q):
q,x = qry[i]
if q == 1:
st.discard(x)
if q == 2:
st.add(x)
if q == 3:
bit.add(x,1)
if q == 4:
r = st.ge(x)
l = st.lt(x)
#print(idx,x,1111)
print(bit.sum(r)-bit.sum(l))