結果
| 問題 |
No.3322 引っ張りだこ
|
| コンテスト | |
| ユーザー |
 kidodesu
|
| 提出日時 | 2025-10-31 23:19:09 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 8,283 bytes |
| コンパイル時間 | 265 ms |
| コンパイル使用メモリ | 82,668 KB |
| 実行使用メモリ | 372,424 KB |
| 最終ジャッジ日時 | 2025-10-31 23:20:14 |
| 合計ジャッジ時間 | 16,793 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 38 TLE * 5 |
ソースコード
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 LazySegTree:
def __init__(
self,
op,
e,
mapping,
composition,
id_,
v) -> None:
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 = _ceil_pow2(self._n)
self._size = 1 << self._log
self._d = [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: int, x) -> None:
assert 0 <= p < self._n
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: int):
assert 0 <= p < self._n
p += self._size
for i in range(self._log, 0, -1):
self._push(p >> i)
return self._d[p]
def prod(self, left: int, right: int):
assert 0 <= left <= right <= self._n
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 - 1) >> 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: int, right = None,
f = None) -> None:
assert f is not None
if right is None:
p = left
assert 0 <= left < self._n
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:
assert 0 <= left <= right <= self._n
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: int, g) -> int:
assert 0 <= left <= self._n
assert g(self._e)
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: int, g) -> int:
assert 0 <= right <= self._n
assert g(self._e)
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: int) -> None:
self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])
def _all_apply(self, k: int, f) -> None:
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: int) -> None:
self._all_apply(2 * k, self._lz[k])
self._all_apply(2 * k + 1, self._lz[k])
self._lz[k] = self._id
inf = 1 << 70
def op(a, b):
if a == -1:
return b
elif b == -1:
return a
sa = a[0]
sb = b[0]
c = [sa+sb]
m0, m1, m2, r0, l1, r1, l2 = a[1]
m0_, m1_, m2_, r0_, l1_, r1_, l2_ = b[1]
if m0 >= sa + m0_:
tm0 = m0
tr0 = r0
else:
tm0 = sa + m0_
tr0 = r0_
if m2_ >= sb + m2:
tm2 = m2_
tl2 = l2_
else:
tm2 = sb + m2
tl2 = l2
if m1 >= m1_ and m1 >= m2 + m0_:
tm1 = m1
tl1, tr1 = l1, r1
elif m1_ >= m1 and m1_ >= m2 + m0_:
tm1 = m1_
tl1, tr1 = l1_, r1_
else:
tm1 = m2 + m0_
tl1, tr1 = l2, r0_
c.append((tm0, tm1, tm2, tr0, tl1, tr1, tl2))
m0, m1, m2, r0, l1, r1, l2 = a[2]
m0_, m1_, m2_, r0_, l1_, r1_, l2_ = b[2]
if m0 <= sa + m0_:
tm0 = m0
tr0 = r0
else:
tm0 = sa + m0_
tr0 = r0_
if m2_ <= sb + m2:
tm2 = m2_
tl2 = l2_
else:
tm2 = sb + m2
tl2 = l2
if m1 <= m1_ and m1 <= m2 + m0_:
tm1 = m1
tl1, tr1 = l1, r1
elif m1_ <= m1 and m1_ <= m2 + m0_:
tm1 = m1_
tl1, tr1 = l1_, r1_
else:
tm1 = m2 + m0_
tl1, tr1 = l2, r0_
c.append((tm0, tm1, tm2, tr0, tl1, tr1, tl2))
return c
e = -1
def mapp(a, b):
if a == 0:
return b
else:
c = [-b[0]]
a0, a1, a2, a3, a4, a5, a6 = b[2]
c.append((-a0, -a1, -a2, a3, a4, a5, a6))
a0, a1, a2, a3, a4, a5, a6 = b[1]
c.append((-a0, -a1, -a2, a3, a4, a5, a6))
return c
def comp(a, b):
return a ^ b
INF = 1 << 80
def main(n, k, A, B):
ans = sum(A)
C = [B[i]-A[i] for i in range(n)]
lst = []
for i in range(n):
lst.append((C[i], (C[i], C[i], C[i], i+1, i, i+1, i), (C[i], C[i], C[i], i+1, i, i+1, i)))
st = LazySegTree(op, e, mapp, comp, 0, lst)
for _ in range(k // 2):
rep = st.all_prod()
l, r = rep[1][4: 6]
if rep[1][1] < 0:
break
ans += rep[1][1]
st.apply(l, r, 1)
return ans
for _ in range(int(input())):
n, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if not k % 2:
print(main(n, k, A, B))
else:
print(main(n+1, k+1, A+[0], B+[1<<80]) - (1 << 80))