結果
| 問題 | No.879 Range Mod 2 Query |
| ユーザー |
 mkawa2
|
| 提出日時 | 2023-09-26 16:25:15 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,714 bytes |
| コンパイル時間 | 220 ms |
| コンパイル使用メモリ | 82,560 KB |
| 実行使用メモリ | 147,408 KB |
| 最終ジャッジ日時 | 2024-07-19 10:31:27 |
| 合計ジャッジ時間 | 7,625 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 43 ms
58,624 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | TLE | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
ソースコード
import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
md = 10**9+7
# md = 998244353
class LazySegTree:
def __init__(self, op, e, mapping, composition, _id, v):
self._op = op
self._e = e
self._mapping = mapping
self._composition = composition
self._id = _id
if isinstance(v, int):
v = [e]*v
self._n = len(v)
self._log = (self._n-1).bit_length()
self._size = 1 << self._log
self._d = [self._e]*(2*self._size)
self._lz = [self._id]*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, x):
p += self._size
for i in range(self._log, 0, -1):
self._push(p >> i)
self._d[p] = x
for i in range(1, self._log+1):
self._update(p >> i)
def get(self, p):
p += self._size
for i in range(self._log, 0, -1):
self._push(p >> i)
return self._d[p]
def prod(self, left, right):
if left == right:
return self._e
left += self._size
right += self._size
for i in range(self._log, 0, -1):
if ((left >> i) << i) != left:
self._push(left >> i)
if ((right >> i) << i) != right:
self._push(right >> i)
sml = self._e
smr = self._e
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):
return self._d[1]
def apply(self, left, right, f):
if right is None:
p = left
p += self._size
for i in range(self._log, 0, -1):
self._push(p >> i)
self._d[p] = self._mapping(f, self._d[p])
for i in range(1, self._log+1):
self._update(p >> i)
else:
if left == right:
return
left += self._size
right += self._size
for i in range(self._log, 0, -1):
if ((left >> i) << i) != left:
self._push(left >> i)
if ((right >> i) << i) != right:
self._push((right-1) >> i)
l2 = left
r2 = right
while left < right:
if left & 1:
self._all_apply(left, f)
left += 1
if right & 1:
right -= 1
self._all_apply(right, f)
left >>= 1
right >>= 1
left = l2
right = r2
for i in range(1, self._log+1):
if ((left >> i) << i) != left:
self._update(left >> i)
if ((right >> i) << i) != right:
self._update((right-1) >> i)
def max_right(self, left, g):
if left == self._n:
return self._n
left += self._size
for i in range(self._log, 0, -1):
self._push(left >> i)
sm = self._e
first = True
while first or (left & -left) != left:
first = False
while left%2 == 0:
left >>= 1
if not g(self._op(sm, self._d[left])):
while left < self._size:
self._push(left)
left *= 2
if g(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, g):
if right == 0:
return 0
right += self._size
for i in range(self._log, 0, -1):
self._push((right-1) >> i)
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 g(self._op(self._d[right], sm)):
while right < self._size:
self._push(right)
right = 2*right+1
if g(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):
self._d[k] = self._op(self._d[2*k], self._d[2*k+1])
def _all_apply(self, k, f):
self._d[k] = self._mapping(f, self._d[k])
if k < self._size:
self._lz[k] = self._composition(f, self._lz[k])
def _push(self, k):
self._all_apply(2*k, self._lz[k])
self._all_apply(2*k+1, self._lz[k])
self._lz[k] = self._id
# treeのマージ
def op(x, y):
return x+y
# treeの単位元
e = 0
# lazy(f)からtree(x)への操作
def mapping(f, x):
x, odd = divmod(x, 1 << 17)
x, size = divmod(x, 1 << 17)
if f & 1: odd = size-odd
if f & 2: x = odd
x += (f >> 2)*size
if f & 4: odd = size-odd
return x << 34 | size << 17 | odd
# lazyの下への分解
def composition(f, g):
if f == 2:
rev = (g & 1) ^ (g >> 2 & 1)
return 2 | rev
return f+g
# lazyの単位元
_id = 0
n, q = LI()
aa = LI()
seg = LazySegTree(op, e, mapping, composition, _id, [a << 34 | 1 << 17 | a & 1 for a in aa])
for _ in range(q):
t, *para = LI()
if t == 1:
l, r = para
seg.apply(l-1, r, 2)
if t == 2:
l, r, x = para
seg.apply(l-1, r, x << 2)
if t == 3:
l, r = para
print(seg.prod(l-1, r) >> 34)