結果
| 問題 | No.1788 Same Set |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2021-12-02 21:51:26 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 8,067 bytes |
| コンパイル時間 | 347 ms |
| コンパイル使用メモリ | 82,384 KB |
| 実行使用メモリ | 166,232 KB |
| 最終ジャッジ日時 | 2024-09-13 23:13:57 |
| 合計ジャッジ時間 | 18,178 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge6 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 64 ms
72,108 KB |
| testcase_01 | AC | 64 ms
71,708 KB |
| testcase_02 | AC | 65 ms
72,044 KB |
| testcase_03 | AC | 65 ms
71,492 KB |
| testcase_04 | AC | 65 ms
73,120 KB |
| testcase_05 | AC | 66 ms
71,892 KB |
| testcase_06 | AC | 155 ms
82,112 KB |
| testcase_07 | AC | 146 ms
82,312 KB |
| testcase_08 | AC | 142 ms
82,296 KB |
| testcase_09 | RE | - |
| testcase_10 | AC | 64 ms
71,756 KB |
| testcase_11 | AC | 189 ms
152,724 KB |
| testcase_12 | AC | 1,015 ms
152,700 KB |
| testcase_13 | AC | 1,265 ms
152,992 KB |
| testcase_14 | AC | 1,869 ms
152,680 KB |
| testcase_15 | AC | 2,016 ms
150,876 KB |
| testcase_16 | AC | 2,439 ms
151,428 KB |
| testcase_17 | RE | - |
| testcase_18 | AC | 2,510 ms
166,232 KB |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
ソースコード
import types
_atcoder_code = """
# Python port of AtCoder Library.
__version__ = '0.0.1'
"""
atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)
_atcoder__bit_code = """
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
"""
atcoder._bit = types.ModuleType('atcoder._bit')
exec(_atcoder__bit_code, atcoder._bit.__dict__)
_atcoder_lazysegtree_code = """
import typing
# import atcoder._bit
class LazySegTree:
def __init__(
self,
op: typing.Callable[[typing.Any, typing.Any], typing.Any],
e: typing.Any,
mapping: typing.Callable[[typing.Any, typing.Any], typing.Any],
composition: typing.Callable[[typing.Any, typing.Any], typing.Any],
id_: typing.Any,
v: typing.Union[int, typing.List[typing.Any]]) -> 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 = atcoder._bit._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: typing.Any) -> 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) -> typing.Any:
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) -> typing.Any:
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 >> 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) -> typing.Any:
return self._d[1]
def apply(self, left: int, right: typing.Optional[int] = None,
f: typing.Optional[typing.Any] = 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: typing.Callable[[typing.Any], bool]) -> 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: typing.Any) -> 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: typing.Any) -> 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
"""
atcoder.lazysegtree = types.ModuleType('atcoder.lazysegtree')
atcoder.lazysegtree.__dict__['atcoder'] = atcoder
atcoder.lazysegtree.__dict__['atcoder._bit'] = atcoder._bit
exec(_atcoder_lazysegtree_code, atcoder.lazysegtree.__dict__)
LazySegTree = atcoder.lazysegtree.LazySegTree
from typing import Tuple
# from atcoder.lazysegtree import LazySegTree
def op(l: Tuple[int, int], r: Tuple[int, int]) -> Tuple[int, int]:
if l[0] == r[0]:
return l[0], l[1] + r[1]
if l[0] < r[0]:
return l
else:
return r
e = 998244353, 0
def mapping(l: int, r: Tuple[int, int]) -> Tuple[int, int]:
return r[0] + l, r[1]
def composition(l: int, r:int) -> int:
return l + r;
id = 0
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
init = [(0, 1)] * n
init.append((0, 0))
seg = LazySegTree(op, e, mapping, composition, id, init)
sz = 200005;
pre_a = [-1] * sz
pre_b = [-1] * sz;
ans = 0;
for i in range(n):
upd = [];
upd.append(a[i]);
if a[i] != b[i]:
upd.append(b[i]);
for val in upd:
l = min(pre_a[val], pre_b[val]);
r = max(pre_a[val], pre_b[val]);
seg.apply(l + 1, r + 1, -1);
pre_a[a[i]] = i;
pre_b[b[i]] = i;
for val in upd:
l = min(pre_a[val], pre_b[val]);
r = max(pre_a[val], pre_b[val]);
seg.apply(l + 1, r + 1, 1);
ans += seg.all_prod()[1] - (n - i - 1);
print(ans)